How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
The localized lifted subdifferential is a pointwise constrained subdifferential
Statement
Assume AC and the hypotheses of the feature-measure energy definition. Fix any probability label space and use the localized lift on . Separability of is not assumed or needed for the subdifferential formula and minimum-section conclusion. For a semiconvex functional with coefficient , define The set is closed and convex, and is proper, lower semicontinuous, and lower bounded. Write , , in the bounded-selection convention, and let bound the Lipschitz constant and norm of on the closed convex hull of . Let and . For , its Hilbert subdifferential with coefficient is exactly The pointwise minimum-norm selection is Borel on and has norm at most ; hence its composition with any is a measurable member of . More generally, for put and . This full shifted minimum is jointly Borel in , has , and the minimum-norm element of is exactly . It is generally different from the smooth gradient plus the minimum of the potential subdifferential alone.
Statement references
Facts & Assumptions
Given: AC and the localized lift and hypotheses above.
The smooth lifted term has the displayed gradient and a quadratic Taylor remainder bounded by its gradient-Lipschitz constant. The localized lifted feature energy is semiconvex
For each , contains a vector of norm at most . Such a vector also belongs to , so the constrained subdifferential is nonempty, closed, and convex; it need not be bounded because it can contain normal-cone vectors. Feature-measure energy and its regularity assumptions
AC supplies Countable Choice for representatives and countable dense tests. The Axiom of Choice AC implies DC implies countable choice The Axiom of Countable Choice ()
Fatou's lemma passes pointwise lower bounds for the nonnegative potential through almost-everywhere limits. Fatou's lemma
A nonempty convex subset of has nonempty relative interior (the barycenter of a maximal affinely independent finite subset lies in it), and a finite convex function is continuous on that relative interior in its affine hull. A convex function on an open convex set is continuous
Tonelli's theorem permits integration of a nonnegative countable sum by summing its integrals. Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
Proof
Given: AC, and .
The set is convex because is convex. To show it is closed, take with in . Countable Choice [F3] gives a subsequence with and strongly measurable representatives; discard their countably many exceptional null sets. Tonelli [F6] implies for almost every , so there; closedness of gives . For lower semicontinuity of , consider a sequence with finite energy liminf and pass to a subsequence of finite energies, so every term lies in and its limit lies there by the closure just proved. For any , a vector supplied by [F2] gives for , proving lower semicontinuity of at . Fatou [F4] makes the potential integral lower semicontinuous along this sequence, and the smooth term is continuous by [F1]. A constant -valued function has finite energy because is nonempty and are bounded on it, while make bounded below. Thus is proper, lower semicontinuous, and lower bounded.
Let . Since every point of has a subgradient by [F2], the supporting inequality implies that is lower semicontinuous at every point of . The function is proper, lower semicontinuous and convex, with . For small enough that , minimize . This is strongly convex and coercive, so it has a unique minimizer . Its optimality inequality says ; this follows by testing minimality at , using semiconvexity of , dividing by , and letting . Comparing the two optimality inequalities at and and adding gives , so is continuous. For fixed , comparison with shows . Monotonicity of between and any gives . Thus is bounded by every candidate norm in the limit. Passing to a limit in the defining subgradient inequalities shows the graph of is closed; every convergent subsequence therefore limits to an element of . The norm inequality makes that limit the unique minimum-norm element. Finite-dimensional compactness gives convergence of the full sequence , so the minimum section is a pointwise limit of continuous maps and hence Borel.
The selected section has norm at most by [F2], so composition with a strongly measurable is measurable and square integrable; call it . For any , its pointwise supporting inequality integrates to Together with [F1], this proves that and establishes nonemptiness.
Conversely, let . Put and . Then is the sum of the convex integral and the differentiable convex function . The latter has gradient . The convex sum rule here follows directly from one-sided directional derivatives: if is convex and is differentiable convex, a supporting vector of satisfies for every feasible direction ; convex secant slopes dominate , so supports . Apply this with to conclude that supports the convex integral. Testing with off a measurable set and on gives a pointwise supporting inequality for every in a countable dense subset of , outside a common null set by [F3]. The relative interior is nonempty by [F5]; on it, continuity [F5] extends the inequality from the dense subset. For a boundary point , choose in the relative interior and let be a relative ball contained in . For , convexity gives a relative ball of radius around contained in , so is in the relative interior. Convexity gives , and lower semicontinuity gives ; hence and the supporting inequality passes to . Undoing the quadratic shift proves is a -section of , proving the reverse inclusion.
For the shifted selection, apply step 1.2 to , whose semiconvexity coefficient is . Its resolvent is jointly continuous in where : comparison of the two optimality inequalities gives when the coefficient is taken as a common lower bound for the two parameters. Hence is jointly continuous there. On each bounded parameter ball, step 1.2 proves its pointwise limit at is the minimum of ; the sum formula follows by subtracting the smooth Taylor remainder in the local supporting inequality. The parameter balls exhaust , so the limit is jointly Borel. A bounded potential subgradient gives an admissible shifted vector of norm , proving the bound. The pointwise projection inequality for every in the shifted set integrates over labels. The exact subdifferential formula from step 3.1 therefore proves that this measurable section is the unique minimum-norm Hilbert subgradient.
Depends on
- Localized Hilbert lift of the feature energy
- The localized lifted feature energy is semiconvex
- The Axiom of Choice
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- AC implies DC implies countable choice
- Feature-measure energy and its regularity assumptions
- Fatou's lemma
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- A convex function on an open convex set is continuous
Used by
Dependency tree · two levels
35 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Luigi Ambrosio, Gigli, and Giuseppe Savaré, Gradient Flows in Metric Spaces and in the Space of Probability Measures (standard reference, not scraped)
- Lénaïc Chizat and Francis Bach, On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transport (standard reference, not scraped)