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

The direct method on a weakly closed constraint set

Statement

Assume the ultrafilter lemma, DC and HB (The ultrafilter extension principle (UL/BPI), The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain, The real dominated-extension principle as an additional hypothesis over ZF). Let X be a real reflexive Banach space (Reflexivity is surjectivity of the canonical map), let A⊆X be nonempty and weakly sequentially closed (Weak convergence of nets and sequences), and let I:X→(−∞,+∞] be proper, coercive on A and weakly sequentially lower semicontinuous on A (Proper, coercive and weakly lower semicontinuous extended-real functionals). Then I attains its infimum on A: there is u0∈A with I(u0)=inf⁡AI. In particular, if C⊆X is nonempty, convex and norm closed, and the restriction I∣C is proper, coercive on C and weakly sequentially lower semicontinuous on C, then C is weakly sequentially closed and the conclusion holds for A=C.

Facts & Assumptions

Given: The ultrafilter lemma, DC and HB; a real reflexive Banach space X; a nonempty weakly sequentially closed set A⊆X; and a proper functional I:X→(−∞,+∞] that is coercive and weakly sequentially lower semicontinuous on A. For the second assertion, a nonempty convex norm-closed set C⊆X such that I∣C is proper, coercive and weakly sequentially lower semicontinuous on C.

[F1]

The direct method in a reflexive Banach space: under the ultrafilter lemma, DC and HB, for every real reflexive Banach space X, every nonempty weakly sequentially closed A⊆X and every proper coercive weakly sequentially lower semicontinuous I:X→(−∞,+∞], there is u0∈A with I(u0)=inf⁡AI. In particular, a convex norm-closed set C may be used as the admissible set when I∣C is proper, coercive and weakly sequentially lower semicontinuous on C.

[F2]

Norm closed convex iff weakly closed: under the assumed HB, every convex norm-closed subset of a normed space is weakly closed and therefore weakly sequentially closed, so every weakly convergent sequence in it has its limit in the set.

Proof

technique · direct

Given: The hypotheses of the statement, including a real reflexive Banach space X and a nonempty weakly sequentially closed A⊆X, with I proper, coercive on A and weakly sequentially lower semicontinuous on A.

1.1givenA1F1

All hypotheses of [F1] are met: X is a real reflexive Banach space, A is nonempty and weakly sequentially closed, and I is proper, coercive on A and weakly sequentially lower semicontinuous on A; the ultrafilter lemma, DC and HB are assumed [A1]. Hence there is u0∈A with I(u0)=inf⁡AI.

1.2F1F2

For the second assertion let C⊆X be nonempty, convex and norm closed, and assume I∣C is proper, coercive on C and weakly sequentially lower semicontinuous on C. Then C is weakly sequentially closed by [F2], and all hypotheses of [F1] hold with A=C; hence there is u0∈C with I(u0)=inf⁡CI.

2.1step 1.1step 1.2A1∎

Step 1.1 proves the first assertion and step 1.2 the "in particular" clause; no convexity or smoothness of a general admissible set A is claimed beyond what is stated, and the three hypotheses of the statement are used only through [F1].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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