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.

Proper, coercive and weakly lower semicontinuous extended-real functionals

Definition

Setting. Let X be a real normed space (in particular, a Banach space as in Banach space) and let A⊆X be a nonempty subset, the admissible set. An extended-real functional on A is a map I:A→(−∞,+∞]; its effective domain is dom⁡I={u∈A:I(u)<+∞}. Properness. I is proper if dom⁡I≠∅, equivalently if inf⁡AI<+∞; a point of dom⁡I is a finite competitor. Coercivity. I is coercive on A if for every M∈R there is R≥0 such that I(u)>M whenever u∈A and ∥u∥≥R; equivalently (the form used below) every sublevel set {u∈A:I(u)≤Λ}, Λ∈R, is bounded. Weak lower semicontinuity. I is weakly sequentially lower semicontinuous at u∈A if I(u)≤lim inf⁡jI(uj) for every sequence (uj)j∈N⊆A with uj⇀u (Weak convergence of nets and sequences), and weakly sequentially lower semicontinuous on A if this holds at every u∈A. Analogously I is sequentially lower semicontinuous on A if I(u)≤lim inf⁡jI(uj) whenever uj→u in norm; all infima and limits inferior are taken in R‾=[−∞,+∞], using the complete extended order of 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. For an extended-real sequence (aj), set lim inf⁡jaj:=sup⁡Ninf⁡j≥Naj; this extends the tail formula of Limit superior and limit inferior of a real sequence as inf⁡nsup⁡k≥nxk and sup⁡ninf⁡k≥nxk in R‾ to sequences that may contain +∞ (The extended real line R‾=R∪{−∞,+∞}, its order, and the arithmetic that is left undefined). In particular, the infimum or limit inferior may equal −∞. Convention. Only the values on A enter these notions, and I is identified with its restriction to A; a point of X∖A is inadmissible, not a point where I equals +∞.

Remarks

  • The two forms of coercivity agree. If I is coercive in the divergence form and Λ∈R, applying the definition with M=Λ gives R≥0 with I(u)>Λ whenever u∈A and ∥u∥≥R, so the sublevel set {u∈A:I(u)≤Λ} is contained in the bounded set {u∈X:∥u∥<R}. Conversely, suppose every sublevel set is bounded and let M∈R be given; the sublevel set S={u∈A:I(u)≤M} is bounded, so there is R≥0 with ∥u∥≤R for all u∈S, and every u∈A with ∥u∥≥R+1 lies outside S, that is, I(u)>M (a value in (−∞,+∞] fails I(u)≤M exactly when it exceeds M). This is the sense in which the equivalence is asserted.

  • Properness and a finite infimum. If u∈dom⁡I then inf⁡AI≤I(u)<+∞, and conversely if inf⁡AI<+∞ then not every value of I on the nonempty set A is +∞, so some u∈A satisfies I(u)<+∞, that is, u∈dom⁡I.

  • 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 A is assumed by these definitions.

Depends on

Used by

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