Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedprecheck passjudge pass (gpt-5.6-terra)audited 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.

For a linear operator, boundedness, continuity at 0, continuity, and Lipschitz continuity are equivalent

Statement

Let X and Y be normed spaces over the same scalar field, and let T:X→Y be linear. Then the following are equivalent:

  1. T is bounded.
  2. T is continuous at 0.
  3. T is continuous on X.
  4. T is Lipschitz.

Facts & Assumptions

Given: Normed spaces X and Y, a linear map T:X→Y, a real ε>0, and a vector x0∈X.

[L1]

A bounded linear operator has a constant C≥0 with ∥Tx∥≤C∥x∥ for every x∈X (A bounded linear operator between normed spaces).

[L3]

Continuity at a point in a metric space is the ε-δ condition of Continuity of a map between metric spaces, at a point and globally, in the ε-δ form.

Proof

technique · direct
1.1L1L2

Assume T is bounded, with constant C from [L1]. Then ∥Tx−Ty∥=∥T(x−y)∥≤C∥x−y∥ for all x,y∈X, so T is Lipschitz.

1.2L3

If T is continuous on X, then in particular it is continuous at 0, so (3)⇒(2).

1.3L3choose

Assume T is continuous at 0. Applying [L3] with ε=1 gives δ>0 such that ∥u∥<δ implies ∥Tu∥<1.

2.1step 1.1L2

Step 1.1 proves (1)⇒(4), and [L2] gives (4)⇒(3).

2.2step 1.3L1algebra

Let x∈X with x≠0 and put u:=δ2∥x∥x. Then ∥u∥=δ/2<δ, so ∥Tu∥<1 by step 1.3. By linearity, Tu=δ2∥x∥Tx, hence ∥Tx∥<2δ∥x∥. The same inequality is trivial at x=0, so T is bounded.

3.1step 2.1step 1.2step 2.2∎

Thus (2)⇒(1). Combining steps 2.1, 1.2, and 2.2 gives all four equivalences.

Depends on

Used by

Dependency tree · two levels

22 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