Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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 Legendre transform of a finite-valued convex Hamiltonian

Definition

Let n≥1 and let H:Rn→R be finite-valued. The Legendre transform (convex conjugate) of H is the function L:Rn→R‾ (The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined) defined by L(v):=sup⁡p∈Rn(p⋅v−H(p)),v∈Rn, the supremum being taken in R‾ (Every subset of R‾ has a least upper bound and a greatest lower bound in R‾, agreeing with the real supremum and infimum on nonempty sets bounded in R) and the inner product being the Euclidean one (The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn). The value L(v)=+∞ is possible and is not excluded.

In the biconjugate expressions p⋅v−(+∞) the convention p⋅v−(+∞):=−∞ is adopted, so that the supremum defining the biconjugate L∗(p):=sup⁡v∈Rn(p⋅v−L(v)) is an ordinary supremum of a set in R∪{−∞} when the value +∞ occurs: every v with L(v)=+∞ contributes the value −∞ and can be discarded.

When H is convex (Convex and strictly convex functions on Euclidean convex sets), L is the convex conjugate used in the Hopf--Lax construction. For every finite-valued H the transform L is convex and lower semicontinuous, being the pointwise supremum of the affine functions v↦p⋅v−H(p); no superlinearity, differentiability, strict convexity, coercivity or smoothness of H is assumed at this point. The notation H∗ is used interchangeably with L.

Remarks

  • Why the convention is recorded. The supremum over v∈Rn in the biconjugate runs over all of Rn even when L takes the value +∞; the convention makes each such term −∞, so those points neither enlarge nor obstruct the supremum, and L∗(p)=sup⁡{p⋅v−L(v):v∈Rn, L(v)<∞}. This is the convention under which the biconjugacy lemma A finite-valued convex Hamiltonian equals its biconjugate is stated, and it is fixed here once for every later use.
  • Scope. The transform is defined for every finite-valued H; convexity, lower semicontinuity and the affine-supremum representation are consequences of the definition, not hypotheses. The later Hopf--Lax regime adds superlinearity of H, which is a separate hypothesis and is what makes L real-valued; no choice principle occurs here.

Depends on

Used by

Dependency tree · two levels

29 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