Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

Finiteness, superlinearity of the Lagrangian and localisation of Hopf--Lax near-minimisers

Statement

Let H:Rn→R be convex and superlinear with Legendre transform L, and let u0:Rn→R be bounded and continuous. Then: (1) L is real-valued on Rn, convex, continuous, and superlinear; (2) for every x∈Rn and t>0 the infimum defining Qtu0(x) is attained, and for every δ>0 there is a finite radius ρ=ρ(x,t,δ,∥u0∥∞) such that every near-minimiser y with u0(y)+tL(x−yt)≤Qtu0(x)+δ satisfies ∣y−x∣≤ρ; (3) consequently Qtu0 is real-valued for every x and every t≥0. No choice principle is used.

Facts & Assumptions

Given: A convex superlinear H:Rn→R with lim⁡∣p∣→∞H(p)/∣p∣=+∞, its Legendre transform L, a bounded continuous u0:Rn→R, and the operators Qt of The Hopf--Lax operator and the Hopf--Lax formula.

[F1]

For t>0, Qtu0(x)=inf⁡y∈Rn{u0(y)+tL((x−y)/t)}, and Q0u0=u0 (The Hopf--Lax operator and the Hopf--Lax formula).

[F2]

L(v)=sup⁡p∈Rn(p⋅v−H(p)) for every v∈Rn, the supremum being the least upper bound in R‾ of the set of real numbers p⋅v−H(p) (The Legendre transform of a finite-valued convex Hamiltonian).

[F3]

Every convex function on an open convex set is continuous on it; in particular any finite convex function on Rn is continuous (A convex function on an open convex set is continuous).

[F4]

A nonempty subset of Rn is compact exactly when it is closed and bounded, and every continuous real-valued function on such a set attains a maximum and a minimum (For a nonempty subset of Rn with n≥1, compactness, closedness and boundedness, pseudocompactness, and attainment of extrema by every continuous real-valued function are equivalent).

Proof

technique · coercivity of the Lagrangian confines near-minimisers to a compact ball, where continuity gives attainment
1.1F2F3F4algebra

Properties of L. Fix v∈Rn. Superlinearity of H gives R>0 with H(p)≥2∣v∣ ∣p∣ for ∣p∣≥R, so p⋅v−H(p)≤−∣v∣ ∣p∣≤0 there; on the closed ball B‾(0,R), which is closed and bounded and hence compact by [F4], the continuous function p↦p⋅v−H(p) (continuity of H is [F3]) attains a maximum Mv<∞ by [F4]. Hence p⋅v−H(p)≤max⁡{Mv,0}<∞ for every p, while L(v)≥−H(0) because p=0 is admissible; by the least-upper-bound property of [F2], L(v) is a real number. Convexity of L: for fixed p the map v↦p⋅v−H(p) is affine, and a pointwise supremum of affine functions is convex; L is real-valued, so it is finite and convex on the open convex set Rn and therefore continuous by [F3]. Superlinearity: fix a>0; for v≠0 the admissible test point p:=av/∣v∣ gives L(v)≥a∣v∣−H(av/∣v∣)≥a∣v∣−max⁡∣q∣≤aH(q), where the maximum is finite by [F3] and [F4]; dividing by ∣v∣ and letting ∣v∣→∞ gives lim inf⁡∣v∣→∞L(v)/∣v∣≥a, and since a>0 was arbitrary, L(v)/∣v∣→+∞.

2.1step 1.1F1F2F3F4algebra

Attainment and localisation. Fix x, t>0 and δ>0, and put φ(y):=u0(y)+tL((x−y)/t), so that Qtu0(x)=inf⁡φ by [F1]. The competitor y=x gives Qtu0(x)≤φ(x)=u0(x)+tL(0)≤∥u0∥∞+tL(0)=:A<∞, where L(0)∈R. Also every term is at least inf⁡u0−tH(0)>−∞ by [F2], so Qtu0(x)∈R. Let y satisfy φ(y)≤Qtu0(x)+δ; then tL(x−yt)≤A+δ−inf⁡u0≤2∥u0∥∞+tL(0)+δ=:C. Superlinearity of L from step 1.1 gives R>0 such that L(w)>C/t whenever ∣w∣≥R. If ∣x−y∣/t≥R, then tL((x−y)/t)>C, contradicting the preceding bound. Hence ∣y−x∣<tR, so every δ-near-minimiser lies in the closed ball B‾(x,ρ) with ρ:=tR<∞; the radius depends only on t,δ,∥u0∥∞ and the fixed H (and may harmlessly be viewed as a function of x as in the statement). For attainment, let S:={y∈Rn:φ(y)≤Qtu0(x)+1}. By the definition of the finite infimum, S is nonempty. It is closed by continuity of φ and bounded by the localisation just proved with δ=1, so [F4] makes it compact. The continuous function φ attains a minimum on S at some y∗. This minimum equals the global infimum: it is at least Qtu0(x), and for every 0<ε<1 the infimum property gives y with φ(y)<Qtu0(x)+ε, which lies in S, so the minimum is at most Qtu0(x)+ε. Thus φ(y∗)=Qtu0(x) and the infimum is attained, without selecting a sequence.

3.1step 1.1step 2.1F1

Real-valuedness of Qtu0. For t>0 each term satisfies u0(y)+tL((x−y)/t)≥inf⁡Rnu0−tH(0)>−∞ by the estimate L≥−H(0) of step 1.1, and the value at y=x is finite; hence Qtu0(x)∈R by [F1]. For t=0 this is Q0u0=u0, real-valued by hypothesis.

4.1step 1.1step 2.1step 3.1∎

Conclusion. Part (1) is step 1.1, part (2) is step 2.1, and part (3) is step 3.1.

Remarks

  • Dependence of the radius. The radius produced depends on x, t, δ and ∥u0∥∞ only through the quantifier-free bounds of step 2.1; it is uniform in x on compact x-sets because the estimates are translation invariant. No compactness of the ambient space and no subsequence selection is used, hence no choice principle.

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