Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedverified 2026-09-24 (gpt-6-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.

Kernel-range identities and the weak-star closure of the transpose range

Statement

Assume the Axiom of Choice. Let K=R or C. If T:X→Y is bounded linear between normed spaces, then (ran⁡T)⊥=ker⁡T∗,(ker⁡T)⊥=ran⁡T∗‾σ(X∗,X). The second closure is weak-star closure, with no norm-closure substitution.

Facts & Assumptions

Given: The Axiom of Choice, The spaces, maps, scalar field, and hypotheses in the statement above. All duals consist of linear functionals over the ambient field; evaluation has no conjugation.

[A1]

AC is used through the preannihilator identity in [F1] at step 1.1, which separates nonzero values of T by continuous functionals.

[F1]

From Elementary kernel and range annihilator identities, with its stated hypotheses: Let K=R or C. For a bounded linear T:X→Y between normed spaces, (ran⁡T)⊥=ker⁡T∗,⊥(ran⁡T∗)=ker⁡T,ran⁡T‾∥⋅∥=⊥(ker⁡T∗). The closure in the last identity is in Y.

[F2]

From The weak-star topology from finite evaluations, with its stated hypotheses: Let K=R or C. For a normed X with continuous dual X∗ from def-dual-space-of-a-normed-space, the weak-star topology σ(X∗,X) is the initial topology of all evaluations f↦f(x) into K with its usual topology. At f0, a neighbourhood basis consists of U(f0;x1,…,xn;ε)={f∈X∗:∣(f−f0)(xj)∣<ε (1≤j≤n)}, where n is finite and ε>0. For n=0 the set is all of X∗. Finite intersections of inverse images of scalar open sets form the initial-topology basis; at the given point, finitely many disks can be refined using their smallest positive radius. Weak-star closure means closure in this topology, not merely sequential closure.

[F3]

From Double annihilators give norm and weak-star closures, with its stated hypotheses: Let K=R or C. For a normed X and a linear subspace N≤X∗, (⊥N)⊥=N‾σ(X∗,X). Consequently N is weak-star closed if and only if N=(⊥N)⊥, and weak-star dense in X∗ if and only if ⊥N={0}. For a linear subspace M≤X, the primal formula is ⊥(M⊥)=M‾∥⋅∥.

Proof

1.1F1

The elementary identities give (ran⁡T)⊥=ker⁡T∗ and ⊥(ran⁡T∗)=ker⁡T. The range of the linear operator T∗ is a linear subspace of X∗.

2.1F2F3step 1.1∎

Apply the bipolar closure theorem to N=ran⁡T∗ in the topology σ(X∗,X). It gives ran⁡T∗‾σ(X∗,X)=(⊥ran⁡T∗)⊥=(ker⁡T)⊥. For T=0 this is {0}‾σ(X∗,X)=X⊥=0, so zero ranges are included.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

12 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