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

Banach closed-range theorem

Statement

Let K=R or C. Assume the Axiom of Choice and let T:X→Y be bounded linear between Banach spaces. The following are equivalent: ran⁡T is norm closed; ran⁡T∗ is norm closed; and there is C>0 such that dist⁡(x,ker⁡T)≤C∥Tx∥ for all x∈X. In that case ran⁡T=⊥(ker⁡T∗),ran⁡T∗=(ker⁡T)⊥.

Facts & Assumptions

Given: 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]

The stated Axiom of Choice is the direct premise for the AC-qualified range, annihilator, and dual-quotient suppliers below (The Axiom of Choice).

[F0]

The Axiom of Choice implies Dependent Choice, so the DC-qualified suppliers below apply (AC implies DC implies countable choice).

[F1]

From Closed range is equivalent to a quotient estimate, with its stated hypotheses: Let K=R or C. Assume DC. For a bounded linear map T:X→Y between Banach spaces, ran⁡T is norm closed⟺∃C>0 ∀x∈X: dist⁡(x,ker⁡T)≤C∥Tx∥.

[F2]

From Membership in the transpose range by an operator estimate, under the stated Axiom of Choice: Let K=R or C. Let T:X→Y be bounded linear between normed spaces and f∈X∗. Then f∈ran⁡T∗⟺∃C≥0 ∀x∈X: ∣f(x)∣≤C∥Tx∥. For any such C, a representing g∈Y∗ can be chosen with ∥g∥≤C.

[F3]

From Surjectivity is equivalent to a lower bound for the transpose, with its stated hypotheses: Let K=R or C. Assume the Axiom of Choice. For a bounded linear T:X→Y between Banach spaces, T is onto⟺∃C>0 ∀g∈Y∗: ∥g∥≤C∥T∗g∥.

[F4]

From Elementary kernel and range annihilator identities, under the stated Axiom of Choice: 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.

[F5]

From The dual of a closed subspace is a dual quotient, under the stated Axiom of Choice: Let K=R or C. Let X be normed and M≤X closed. Restriction R:X∗→M∗ induces a linear isometric bijection R~:X∗/M⊥⟶M∗,f+M⊥⟼f∣M. Also ∥R∥≤1; its norm is 1 when M≠{0} and 0 when M={0}.

[F6]

From Distance to an annihilator is the restriction norm, under the stated Axiom of Choice: Let K=R or C. If M is a closed linear subspace of a normed X and f∈X∗, then dist⁡(f,M⊥)=∥f∣M∥.

[F7]

From Annihilators and preannihilators are norm closed, with its stated hypotheses: Let K=R or C. For any normed X and arbitrary M⊆X, N⊆X∗, both M⊥⊆X∗ and ⊥N⊆X are norm-closed linear subspaces. Moreover N‾∥⋅∥⊆(⊥N)⊥.

[F8]

From The transpose is bounded with the same norm, with its stated hypotheses: Let K=R or C. For a bounded linear T:X→Y between normed spaces, T∗:Y∗→X∗ is bounded linear and ∥T∗∥=∥T∥.

[F9]

From If (Y) is Banach then (\mathcal B(X,Y)) is Banach, with its stated hypotheses: Let X and Y be normed spaces over the same scalar field. If Y is Banach, then B(X,Y) is Banach for the operator norm.

[F10]

From A closed subspace of a Banach space is Banach, with its stated hypotheses: Let V be a Banach space and let W⊆V be a closed linear subspace, equipped with the restricted norm. Then W is a Banach space.

Proof

1.1F1

The quotient-estimate lemma equates closedness of ran⁡T with the stated estimate. Suppose these hold, and write N=ker⁡T. If f∈N⊥, then for every n∈N, ∣f(x)∣=∣f(x+n)∣≤∥f∥∥x+n∥; infimizing gives ∣f(x)∣≤C∥f∥∥Tx∥.

1.2F1F8F9

For the reverse implication, assume ran⁡T∗ is norm closed. Both duals are Banach because the scalar field is Banach, and T∗ is bounded. The quotient-estimate lemma applied to T∗:Y∗→X∗ therefore supplies C>0 with dist⁡(g,ker⁡T∗)≤C∥T∗g∥.

1.3F4F10

Let Y0=ran⁡T‾≤Y; it is Banach as a closed subspace. The bounded map S:X→Y0, Sx=Tx, has dense range. The elementary identity and continuity give Y0⊥=ker⁡T∗.

2.1F2F4F7step 1.1

Domination yields f∈ran⁡T∗. Conversely every T∗g vanishes on N by evaluation. Thus ran⁡T∗=N⊥, which is norm closed.

2.2F5F6step 1.2step 1.3

For any h∈Y0∗, the restriction quotient isometry supplies an extension g∈Y∗ with g∣Y0=h. The distance formula gives ∥h∥=dist⁡(g,Y0⊥). Direct evaluation gives S∗h=T∗g, so step 1.2 implies ∥h∥≤C∥S∗h∥.

3.1F3F4step 2.1step 2.2

The separately proved surjectivity criterion makes S onto Y0. Hence ran⁡T=Y0 is norm closed, proving the reverse implication. The elementary primal closure identity now yields ran⁡T=⊥ker⁡T∗; step 2.1 supplies the dual identity.

4.1F4step 1.1step 3.1∎

If T=0, its two ranges are zero and the primal estimate is dist⁡(x,X)=0. Both identities reduce to the same zero spaces by the elementary identities. The quotient and restriction steps allow Y0=0, so no nonzero-range assumption has entered either implication.

Depends on

Used by

Dependency tree · two levels

36 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