Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-09-23 (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.

Bounded below is equivalent to surjectivity of the transpose

Statement

Let K=R or C. Assume the Axiom of Choice. If T:X→Y is bounded linear between Banach spaces, then (∃c>0 ∀x∈X:∥Tx∥≥c∥x∥)⟺T∗:Y∗→X∗ is onto.

Facts & Assumptions

Given: The Axiom of Choice and 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.

[F1]

From Banach closed-range theorem, with its stated hypotheses: Let K=R or C. Assume AC 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)⊥.

[A1]

The Axiom of Choice is used exactly for the closed-range implication [F1] in step 1.2; it also implies the DC premise of [F4].

[F2]

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.

[F3]

From Membership in the transpose range by an operator estimate, with its stated hypotheses: 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.

[F4]

From Under Dependent Choice, a bounded operator between Banach spaces is bounded below exactly when it is injective with closed range, with its stated hypotheses: Assume the Axiom of Dependent Choice (def-dependent-choice). Let X and Y be Banach spaces over the same scalar field, and let T:X→Y be a bounded linear operator. Then T is bounded below if and only if it is injective and has closed range.

Proof

1.1F3

If T is bounded below with constant c>0, every f∈X∗ satisfies ∣f(x)∣≤∥f∥∥x∥≤(∥f∥/c)∥Tx∥. Domination gives f∈ran⁡T∗, proving surjectivity.

1.2F1F2F4A1

If T∗ is onto, its range X∗ is closed. Under [A1], closed range duality [F1] makes ran⁡T closed. Also ker⁡T=⊥X∗={0}: the elementary identity applied to the identity operator on X gives the last equality. Thus T is injective with closed range, and the Banach bounded-below criterion [F4] applies under the resulting DC premise.

2.1step 1.1step 1.2∎

When X=0, the lower bound holds for any positive c and T∗ maps onto X∗=0. The preceding arguments cover this case without choosing a unit vector or dividing by its norm.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

25 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