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.

Coercivity bounds every finite-level sequence

Statement

Let I:A→(−∞,+∞] be coercive on the nonempty set A⊆X (Proper, coercive and weakly lower semicontinuous extended-real functionals). Then for every Λ∈R the sublevel set {u∈A:I(u)≤Λ} is norm bounded; consequently every sequence (uj)⊆A with sup⁡jI(uj)<+∞ is norm bounded. In particular every minimising sequence (uj) with I(uj)→inf⁡AI<+∞ is norm bounded.

Facts & Assumptions

Given: A nonempty set A in a real Banach space, an extended-real functional I:A→(−∞,+∞] that is coercive on A, and real numbers Λ.

[F1]

Coercivity of I on A is equivalent to the boundedness of every sublevel set {u∈A:I(u)≤Λ}, Λ∈R (Proper, coercive and weakly lower semicontinuous extended-real functionals).

[F2]

The number inf⁡AI is the greatest lower bound of the values of I on A (Greatest lower bound (infimum)). If a sequence (aj) in (−∞,+∞] converges to a finite real L, then its tail is bounded above by L+1; if aj→−∞, its tail is bounded above by 0. A finite initial segment need not be bounded above as a sequence of values when it contains +∞.

Proof

technique · direct, by placing the values in a sublevel set and quoting the sublevel form of coercivity
1.1F1given

Bounded sublevels. Let Λ∈R. By [F1] the sublevel set {u∈A:I(u)≤Λ} is bounded in the norm of X; that is, there is R≥0 with ∥u∥≤R for every u∈A with I(u)≤Λ.

2.1step 1.1

Sequences with finite sup of values are bounded. Let (uj)⊆A satisfy sup⁡jI(uj)=:Λ0<+∞. Then Λ0∈R and I(uj)≤Λ0 for every j, so the whole sequence lies in the sublevel set {I≤Λ0}, which is bounded by step 1.1; hence (uj) is norm bounded.

3.1F2step 2.1∎

Minimising sequences with finite infimum. Let (uj)⊆A be a minimising sequence, I(uj)→inf⁡AI, with inf⁡AI<+∞. By [F2] there are N and a real M with I(uj)≤M for every j≥N. Step 2.1 shows that the tail (uj)j≥N is norm bounded. The finite set of initial vectors u1,…,uN−1 is also norm bounded, so the entire sequence is norm bounded, even if some initial functional values equal +∞.

Depends on

Used by

Dependency tree · two levels

9 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