Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passaudited 2026-09-01
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.

A bounded operator that vanishes on a subspace factors uniquely through the normed quotient

Statement

Let X and Y be normed spaces over the same scalar field, let M≤X be a closed linear subspace, let q:X→X/M be the quotient map, and let T:X→Y be a bounded linear operator with M⊆ker⁡T. Then there is a unique bounded linear operator T‾:X/M→Y such that

T‾∘q=T,

and moreover ∥T‾∥=∥T∥.

Facts & Assumptions

Given: A closed linear subspace M≤X, the quotient map q:X→X/M, and a bounded linear operator T:X→Y with M⊆ker⁡T.

[L1]

The algebraic quotient universal property gives a unique linear map T‾:X/M→Y with T‾(qx)=Tx (Universal property of the quotient vector space).

[L2]

The quotient norm is ∥x+M∥X/M=inf⁡m∈M∥x+m∥ (The quotient seminorm (|x+M|{X/M}=\inf{m\in M}|x+m|=\operatorname{dist}(x,M))).

[L4]

The quotient map sends the open unit ball of X onto a set containing the open unit ball of X/M (The quotient map sends every open ball onto a set containing the corresponding quotient ball).

Proof

technique · direct
1.1L1

By [L1], there is a unique linear map T‾:X/M→Y with T‾(qx)=Tx for every x∈X. This proves representative independence before any norm estimate.

2.1step 1.1L2L3

Let ξ=x+M and let m∈M. Since Tm=0, T‾(ξ)=Tx=T(x+m). If C is a bound for T from [L3], then ∥T‾(ξ)∥≤C∥x+m∥ for every m∈M. Taking the infimum over m and using [L2] gives ∥T‾(ξ)∥≤C∥ξ∥X/M. Hence T‾ is bounded and ∥T‾∥≤∥T∥.

3.1step 2.1L2L3

For every x∈X, ∥q(x)∥X/M≤∥x∥ because the infimum in [L2] can be evaluated at m=0. Therefore ∥Tx∥=∥T‾(qx)∥≤∥T‾∥ ∥x∥ by step 2.1. Taking the supremum over ∥x∥≤1 gives ∥T∥≤∥T‾∥.

4.1step 2.1step 3.1L4

Step 2.1 gave ∥T‾∥≤∥T∥, and step 3.1 gave the reverse inequality, so ∥T‾∥=∥T∥. The unit-ball content of [L4] is the same geometric reason that no larger quotient bound is needed.

5.1step 1.1step 4.1∎

The linear map in step 1.1 is therefore the unique bounded factor of T through the normed quotient, and it has the same operator norm.

Depends on

Used by

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