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 be coercive on the nonempty set (Proper, coercive and weakly lower semicontinuous extended-real functionals). Then for every the sublevel set is norm bounded; consequently every sequence with is norm bounded. In particular every minimising sequence with is norm bounded.
Facts & Assumptions
Given: A nonempty set in a real Banach space, an extended-real functional that is coercive on , and real numbers .
Coercivity of on is equivalent to the boundedness of every sublevel set , (Proper, coercive and weakly lower semicontinuous extended-real functionals).
The number is the greatest lower bound of the values of on (Greatest lower bound (infimum)). If a sequence in converges to a finite real , then its tail is bounded above by ; if , its tail is bounded above by . A finite initial segment need not be bounded above as a sequence of values when it contains .
Proof
Bounded sublevels. Let . By [F1] the sublevel set is bounded in the norm of ; that is, there is with for every with .
Sequences with finite sup of values are bounded. Let satisfy . Then and for every , so the whole sequence lies in the sublevel set , which is bounded by step 1.1; hence is norm bounded.
Minimising sequences with finite infimum. Let be a minimising sequence, , with . By [F2] there are and a real with for every . Step 2.1 shows that the tail is norm bounded. The finite set of initial vectors 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
- Gerald Teschl, Partial Differential Equations: From Classical to Modern (2026 author manuscript; complete 392-page archived text) (standard reference, not scraped)
- Viktor Grigoryan, Math 246B Partial Differential Equations, UCSB 2011 (complete 31-page course notes) (standard reference, not scraped)