Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generated
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 feature energy is semiconvex

Statement

Assume AC and the hypotheses of the feature-measure energy definition. Fix an arbitrary probability label space (S,Σ,σ), let K=L2(σ;Rd), and let Cr={X:X(s)∈Qr for σ-almost every s}. Write Ar=sup⁡Qr∥dΦ∥, Br=Lip⁡Qr(dΦ), Mr=sup⁡Qr∥∂V∥, and let Lr and Nr be, respectively, a Lipschitz constant and a norm bound for dR on the closed convex hull of Φ(Qr). For all X,Y∈Cr, the smooth part Gr(X)=R(∫Φ(X)dσ) has the first-order expansion on Cr with gradient ∇Gr(X)(s)=dΦX(s)∗∇R(∫Φ(X)dσ), and this gradient is Lipschitz with constant LrAr2+NrBr. No separability of the label space is required for these estimates. Consequently Er(X)=Gr(X)+∫V(X)dσ+ιCr(X) is (λV−LrAr2−NrBr)-semiconvex on K.

Facts & Assumptions

Given: AC, σ,Qr,Φ,R,V and the constants in the Statement.

[F1]

Bounded linear maps commute with Bochner integration, and Bochner integrability is characterized by strong measurability plus integrability of the norm. Bounded linear maps commute with Bochner integration Bochner integrability criterion Bochner-integrable function

[F2]

The differential of R has a unique Hilbert gradient with the same norm. Riesz representation for Hilbert spaces

[F3]

The feature map is differentiable, dΦ is bounded and Lipschitz on Qr, and dR is Lipschitz on bounded sets; on the relevant bounded convex hull its norm has some finite bound. Feature-measure energy and its regularity assumptions

[F6]

On every segment in Qr, semiconvexity of V means V(u)−(λV/2)∣u∣2 is convex. Feature-measure energy and its regularity assumptions

[F4]

AC supplies Countable Choice for the Bochner approximation and Riesz branches. The Axiom of Choice AC implies DC implies countable choice The Axiom of Countable Choice (ACω)

Proof

Given: AC and the data above.

1.1F1F3F4F5construct

For X,Y∈Cr, the segment Xθ=X+θ(Y−X) lies in Cr by convexity of Qr. Pointwise Fréchet differentiability and the bound Ar give ∥Φ(Y)−Φ(X)∥L2(σ;H)≤Ar∥Y−X∥K; moreover Lipschitz continuity of dΦ gives the pointwise remainder bound ∥Φ(Y)−Φ(X)−dΦX(Y−X)∥H≤(Br/2)∣Y−X∣2. Integrating this bound and using [F1], [F4], and [F5] proves m(Y)=m(X)+∫dΦX(Y−X)dσ+O(∥Y−X∥K2), the required first-order expansion on Cr.

2.1F1F2F3step 1.1

Write m(Y)−m(X)=Dm(X)[Y−X]+O(∥Y−X∥K2) as in step 1.1. Fréchet differentiability of R at m(X) gives R(m(Y))=R(m(X))+dRm(X)[m(Y)−m(X)]+o(∥m(Y)−m(X)∥H). By [F2] represent dRm(X) by its Riesz vector ∇R(m(X)). The bounded-linear-map commutation in [F1] then gives DGr(X)[H]=⟨∇R(m(X)),Dm(X)[H]⟩H=⟨dΦX(⋅)∗∇R(m(X)),H⟩K. The pointwise gradient is measurable by continuity of dΦ on Qr and has K-norm at most NrAr.

3.1F3F5step 2.1

For X,Y∈Cr, [F3] and [F5] give ∥m(X)−m(Y)∥H≤Ar∥X−Y∥K. Add and subtract dΦX∗∇R(m(Y)) in the gradient difference. The operator norm bounds yield ∥∇Gr(X)−∇Gr(Y)∥K≤ArLr∥m(X)−m(Y)∥+NrBr∥X−Y∥K≤(LrAr2+NrBr)∥X−Y∥K. Every term is finite by [F1] and [F3].

4.1F3F6step 3.1∎

Integrating the gradient along Xθ and using step 3.1 gives Gr(Y)≥Gr(X)+⟨∇Gr(X),Y−X⟩K−LrAr2+NrBr2∥Y−X∥K2. The pointwise λV-semiconvex inequality [F6], integrated against σ, gives the same inequality for X↦∫V(X)dσ with coefficient λV. Adding the two inequalities and restricting to the convex set Cr proves the claimed semiconvexity of Er.

Depends on

Used by

Dependency tree · two levels

42 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