Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-13
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.

Annihilators are weak and weak star closed

Statement

For subsets M⊆X, N⊆X∗ of a real or complex normed dual pair, M⊥ is a weak-star closed linear subspace and ⊥N is a weakly closed linear subspace, in ZF. For linear subspaces, (⊥N)⊥=N‾w∗. Under HB (The real dominated-extension principle as an additional hypothesis over ZF), also ⊥(M⊥)=M‾∥⋅∥=M‾w for linear M.

Facts & Assumptions

[F1]

Annihilators mean vanishing on every member of the specified subset (Annihilator notation and the preannihilator).

[F2]

Bounded primal functionals and dual evaluations are respectively weakly and weak-star continuous (Basic weak neighborhoods, Basic weak star neighborhoods).

[F3]

The weak-star double-annihilator identity for linear N is the first identity in Double annihilators give norm and weak-star closures. Only this identity is used here.

[F4]

Under HB, each exterior point of a nonempty closed convex set is strictly separated by a bounded scalar-linear functional's real part (Relative geometric Hahn–Banach with the exact open, closed, and compact hypotheses).

Proof

Given: the stated subsets; assume linearity of M,N for the identities and HB only for the primal identity.

1.1givenF1F2

By F1, M⊥ is the intersection over m∈M of the kernels of f↦f(m), and ⊥N is the intersection over f∈N of ker⁡f. Each kernel is a linear subspace and closed in the corresponding topology by F2 and closedness of {0}⊆K. Intersections preserve both properties; empty intersections give the whole ambient spaces.

2.1step 1.1F3F1

For linear N, F3 yields (⊥N)⊥=N‾w∗ with no primal norming used. For linear M, every functional vanishing on M also vanishes on its norm closure, by norm continuity. Thus M‾∥⋅∥⊆⊥(M⊥). Step 1.1 also implies M‾w⊆⊥(M⊥).

3.1step 2.1F4F2algebra

Assume HB and fix x∉K=M‾∥⋅∥. The set K is a nonempty closed linear subspace: addition and scalar multiplication preserve closure by their norm estimates. By F4 there is f∈X∗ whose real part is bounded above on K and strictly larger at x. Since K is a real linear subspace, scaling forces Re⁡f=0 on K. In the complex case ik∈K forces Im⁡f(k)=0 too. Hence f∈M⊥ and f(x)≠0, excluding x from ⊥(M⊥). The open set {y:∣f(y)∣>∣f(x)∣/2} also excludes x from M‾w. Norm closure is contained in weak closure because weak-open sets are norm open; all three sets therefore coincide. □

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

21 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