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.
Proper, coercive and weakly lower semicontinuous extended-real functionals
Definition
Setting. Let be a real normed space (in particular, a Banach space as in Banach space) and let be a nonempty subset, the admissible set. An extended-real functional on is a map ; its effective domain is . Properness. is proper if , equivalently if ; a point of is a finite competitor. Coercivity. is coercive on if for every there is such that whenever and ; equivalently (the form used below) every sublevel set , , is bounded. Weak lower semicontinuity. is weakly sequentially lower semicontinuous at if for every sequence with (Weak convergence of nets and sequences), and weakly sequentially lower semicontinuous on if this holds at every . Analogously is sequentially lower semicontinuous on if whenever in norm; all infima and limits inferior are taken in , using the complete extended order of Every subset of has a least upper bound and a greatest lower bound in , agreeing with the real supremum and infimum on nonempty sets bounded in . For an extended-real sequence , set ; this extends the tail formula of Limit superior and limit inferior of a real sequence as and in to sequences that may contain (The extended real line , its order, and the arithmetic that is left undefined). In particular, the infimum or limit inferior may equal . Convention. Only the values on enter these notions, and is identified with its restriction to ; a point of is inadmissible, not a point where equals .
Remarks
-
The two forms of coercivity agree. If is coercive in the divergence form and , applying the definition with gives with whenever and , so the sublevel set is contained in the bounded set . Conversely, suppose every sublevel set is bounded and let be given; the sublevel set is bounded, so there is with for all , and every with lies outside , that is, (a value in fails exactly when it exceeds ). This is the sense in which the equivalence is asserted.
-
Properness and a finite infimum. If then , and conversely if then not every value of on the nonempty set is , so some satisfies , that is, .
-
The sublevel-set form is the one used in the compactness step of the direct method, and the divergence form is the one recorded in the sources ([MA] Definition 2.3, [G] Definition 4.1, [T] Section 13.2). No convexity, continuity or topology on is assumed by these definitions.
Depends on
- Banach space
- Weak topology on a normed space
- Weak convergence of nets and sequences
- The extended real line $\overline{\mathbb{R}} = \mathbb{R} \cup \{-\infty, +\infty\}$, its order, and the arithmetic that is left undefined
- Limit superior and limit inferior of a real sequence as $\inf_n \sup_{k \ge n} x_k$ and $\sup_n \inf_{k \ge n} x_k$ in $\overline{\mathbb{R}}$
- Greatest lower bound (infimum)
- Every subset of $\overline{\mathbb{R}}$ has a least upper bound and a greatest lower bound in $\overline{\mathbb{R}}$, agreeing with the real supremum and infimum on nonempty sets bounded in $\mathbb{R}$
Used by
- Strict convexity gives uniqueness of a minimiser Corollary
- A coercive functional need not attain without weak lower semicontinuity Counterexample
- A minimising sequence need not converge strongly Counterexample
- Convex and strictly convex functionals on a convex subset of a real vector space Definition
- A convex norm-lower-semicontinuous functional is weakly lower semicontinuous Lemma
- Coercivity bounds every finite-level sequence Lemma
- The liminf passage makes the weak limit a minimiser Lemma
- The direct method in a reflexive Banach space Theorem
- The direct method on a weakly closed constraint set Theorem
- The Dirichlet principle for the Poisson equation Theorem
Dependency tree · two levels
23 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)
- Francesco Paolo Maiale (course by Giovanni Alberti), Lecture Notes Calculus of Variations A, University of Pisa (last update 21 August 2019; complete 149-page notes) (standard reference, not scraped)
- Viktor Grigoryan, Math 246B Partial Differential Equations, UCSB 2011 (complete 31-page course notes) (standard reference, not scraped)