Alphabeta Math
Pipeline-generated
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.

14 results · all verified · 12 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 2 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

The Baire Principles of Functional Analysis

1 · Prerequisites

2 · Summary

The Baire theorem turns pointwise information into uniform bounds, then supplies the open-mapping and closed-graph principles. Completeness of the domain and the precise closure-to-image lifting step are kept explicit.

3 · Logical flowchart

4 · Definitions, theorems and proofs

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Uniform boundedness principle

Statement

Assume DC. Let X be a Banach space, Y a normed space, and let F be a family of bounded linear operators XY (A bounded linear operator between normed spaces). If supTFTx< for every xX, then supTFT<, where the norm is The operator norm as the least bound and as the unit-sphere or unit-ball supremum.

Facts & Assumptions

Given: DC, X,Y,F as in the statement, and pointwise boundedness.

Proof

technique · direct
1.1

Put En={x:supTFTxn}. Each En is closed (an intersection of inverse images of closed balls), and pointwise boundedness gives X=n1En.

given
3.1

For h<r, both x0 and x0+h lie in that ball, so ThT(x0+h)+Tx02N for every T.

step 2.1
4.1

Rescaling a nonzero x to h=rx/(2x) yields Tx4Nx/r; the same is clear for x=0. Thus T4N/r for every T.

step 3.1algebra
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Baire dichotomy for a pointwise-defined family of bounded linear operators

Statement

Assume DC. Let X be Banach, Y normed, and FB(X,Y) (A bounded linear operator between normed spaces). Either supTFT< (The operator norm as the least bound and as the unit-sphere or unit-ball supremum), or

S:={xX:supTFTx=}

is a dense Gδ subset of X.

Facts & Assumptions

Given: DC and X,Y,F as in the statement.

Proof

technique · direct
1.1

Let En={x:supTTxn}. These sets are closed, and XS=nEn.

given
2.1

If some En has nonempty interior, the translation-and-rescaling argument of Uniform boundedness principle gives a common operator-norm bound.

step 1.1
2.2

Otherwise every En is closed with empty interior. Its complement is open dense, so S=n(XEn) is Gδ and dense by Under Dependent Choice, a nonempty complete metric space is not a countable union of closed sets with empty interior.

step 1.1
3.1

The two alternatives exhaust the cases from step 2.1, proving the dichotomy.

step 2.1step 2.2
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-07Open item page →

A pointwise limit of bounded operators is bounded with the liminf norm bound

Statement

Assume DC. Let X be Banach, Y normed, and Tn:XY bounded linear (A bounded linear operator between normed spaces). If TnxTx in Y for every xX, then T is bounded linear and

Tlim infnTn,

with the operator norm of The operator norm as the least bound and as the unit-sphere or unit-ball supremum.

Facts & Assumptions

Given: DC and X,Y,(Tn),T with pointwise convergence as in the statement.

Proof

technique · direct
1.1

Pointwise convergence makes (Tnx)n bounded for each x. Thus Uniform boundedness principle gives M:=supnTn<.

given
2.1

Passing Tn(x+y)=Tnx+Tny and Tn(λx)=λTnx to limits shows that T is linear.

step 1.1
2.2

For each x, continuity of the norm gives Tx=limnTnxMx, so T is bounded.

step 1.1
3.1

If lim infnTn=, the asserted bound is immediate. Otherwise select a subsequence whose norms tend to the finite liminf. The preceding inequality along that subsequence gives Tx(lim infnTn)x for every x, hence the asserted norm bound.

step 2.2
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

A nonzero bounded linear operator is large on one of two nearby points

Statement

Let T:XY be nonzero and bounded (A bounded linear operator between normed spaces), let xX, and let r>0. There is a yB(x,r) such that

Ty>2r3T,

where T is The operator norm as the least bound and as the unit-sphere or unit-ball supremum.

Facts & Assumptions

Given: A nonzero bounded linear operator T, xX, and r>0.

Proof

technique · direct
1.1

The unit-ball definition of the operator norm supplies z with z1 and Tz>8T/9.

givenchoose
2.1

Put w=(3r/4)z. Then both x+w and xw lie in B(x,r), and Tw>2rT/3.

step 1.1algebra
3.1

The triangle inequality applied to T(x+w)T(xw)=2Tw gives max{T(x+w),T(xw)}Tw>2r3T.

step 2.1algebra
4.1

Choosing the corresponding one of x+w,xw proves the claim.

step 2.1step 3.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Sokal's gliding-hump proof of uniform boundedness

Statement

Assume ACω and DC. If X is Banach, Y is normed, and a family F of bounded linear maps XY is pointwise bounded, then supTFT<.

Facts & Assumptions

Given: The stated choice principles, X,Y,F, and pointwise boundedness.

Proof

technique · constructive
1.1

Suppose the norms are unbounded. Countable choice selects TnF with Tn4n for n1. Set x0=0.

givenconstruct
2.1

Recursively, apply A nonzero bounded linear operator is large on one of two nearby points with centre xn1 and radius 3n to choose xn with xnxn1<3n and Tnxn>(2/3)3nTn. DC licenses these dependent choices.

step 1.1construct
3.1

The sequence (xn) is Cauchy, since its tails are bounded by a tail of n13n; completeness gives xnxX. Moreover xxnk>n3k=3n/2.

step 2.1
4.1

Hence TnxTnxnTnxxn>163nTn16(4/3)n, which contradicts pointwise boundedness at x.

step 1.1step 2.1step 3.1algebradischarge-construct
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The closure of a bounded image contains a ball

Statement

Assume DC. If T:XY is a surjective bounded linear map between Banach spaces, then for some r>0,

BY(0,r)T(BX(0,1)).

Facts & Assumptions

Given: DC and a surjective bounded linear map T:XY with X,Y Banach.

Proof

technique · direct
1.1

Surjectivity gives Y=n1T(BX(0,n)). Baire applied to Y gives n, y0, and ρ>0 with B(y0,ρ) inside this closure.

given
2.1

Subtracting two points in this ball shows B(0,ρ)T(B(0,2n)).

step 1.1algebra
3.1

Scaling by 2n gives B(0,ρ/(2n))T(B(0,1)), as required.

step 2.1algebra
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Successive approximation turns a closure-ball inclusion into an actual preimage

Statement

Assume DC. Let T:XY be bounded linear, with X Banach. If BY(0,r)T(BX(0,1)) for some r>0, then

BY(0,r/2)T(BX(0,1)).

Facts & Assumptions

Given: DC and T,X,Y,r with the displayed closure inclusion.

Proof

technique · constructive
1.1

Given y with y<r/2, repeatedly use the closure inclusion, after scaling, to choose xn with xn<2n1 and residual yTknxk of norm <r2n2. DC licenses this dependent recursive selection.

givenconstruct
2.1

The series nxn converges in X by Series criterion for Banach spaces, and its sum x has x<1.

step 1.1
3.1

Boundedness makes T continuous by For a linear operator, boundedness, continuity at 0, continuity, and Lipschitz continuity are equivalent, so Tx=limnTknxk=y as the residuals vanish.

step 1.1step 2.1discharge-construct
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passaudited 2026-09-07Open item page →

Open mapping theorem

Statement

Assume DC. A surjective bounded linear map T:XY between Banach spaces is open: it maps every open subset of X to an open subset of Y.

Facts & Assumptions

Given: DC and a surjective bounded linear map T:XY between Banach spaces.

Proof

technique · direct
1.1

The preceding successive-approximation lemma gives ε>0 with BY(0,ε)T(BX(0,1)).

given
2.1

For every xX and a>0, linearity gives BY(Tx,aε)T(BX(x,a)).

step 1.1algebra
3.1

Let UX be open and y=TxT(U). Choose a>0 with BX(x,a)U. Then step 2.1 gives BY(y,aε)T(U). Thus every point of T(U) is interior, so T(U) is open.

step 2.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Quantitative lifting form of the open mapping theorem

Statement

Assume DC. For a surjective bounded linear T:XY between Banach spaces, some c>0 satisfies cBY(0,1)T(BX(0,1)).

Facts & Assumptions

Given: DC and T as in the statement.

Proof

technique · direct
1.1

By Open mapping theorem, T(BX(0,1)) is an open neighbourhood of 0.

given
2.1

It therefore contains BY(0,c) for some c>0, which is exactly the claim.

step 1.1
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Bounded inverse theorem

Statement

Assume DC. A bounded bijective linear map T:XY between Banach spaces has a bounded linear inverse T1:YX.

Facts & Assumptions

Given: DC and a bounded bijective linear T:XY between Banach spaces.

Proof

technique · direct
1.1

By Open mapping theorem, T maps the open unit ball onto a neighbourhood of 0; hence BY(0,c)T(BX(0,1)) for some c>0.

given
2.1

If y0, the point cy/(2y) lies in BY(0,c), so its unique preimage has norm <1. Scaling gives T1y<2c1y; this also holds at 0.

step 1.1algebra
3.1

Thus T1 is bounded, and it is linear because T is a linear bijection.

step 2.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

The graph of a linear operator with a linear domain

Definition

For normed spaces X,Y, a linear subspace DX (Linear subspace of a vector space) and a linear map A:DY, its graph is G(A)={(x,Ax):xD}X×Y. Equip X×Y with the maximum product norm (x,y)max=max{x,y} from The standard product norms on a finite product of normed spaces. The operator is closed when G(A) is closed in this norm.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Closed graph theorem

Statement

Assume DC. For Banach spaces X,Y and an everywhere-defined linear T:XY, T is bounded if and only if its graph (The graph of a linear operator with a linear domain) is closed.

Facts & Assumptions

Given: DC, Banach spaces X,Y, and an everywhere-defined linear map T.

Proof

technique · direct
1.1

If T is bounded, xnx and Txny, continuity gives y=Tx, so the graph is closed.

given
1.2

Conversely, a closed graph is Banach by A closed subspace of a Banach space is Banach, since X×Y is Banach by Finite products of Banach spaces are Banach.

given
2.1

The first projection G(T)X is a bounded linear bijection; its inverse is bounded by Bounded inverse theorem. Composing that inverse with the second projection makes T bounded.

step 1.2
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

A closable densely defined linear operator

Definition

Let X and Y be normed spaces, and let A:D(A)XY be linear with dense linear domain. It is closable when the closure of its graph (The graph of a linear operator with a linear domain) in X×Y (Interior, closure, boundary, limit point, isolated point and dense subset of a metric space) is itself the graph of a linear operator. That operator is the closure A.

TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

Sequential criterion for closability

Statement

Assume DC. A densely defined linear A:D(A)XY is closable if and only if every sequence xnD(A) with xn0 and Axny has y=0.

Facts & Assumptions

Given: DC and A as in the statement.

Proof

technique · direct
1.1

If the graph closure is a graph and (0,y) lies in it, it must equal the graph point (0,0); this proves the sequential condition.

given
1.2

Conversely, if (x,y) and (x,z) lie in the graph closure, sequences of graph points converging to them exist by metric closure (using DC to choose 1/(n+1) approximants). Their differences give a sequence tending to (0,yz).

givenconstruct
2.1

The sequential condition gives yz=0, so the graph closure has at most one second coordinate over each first coordinate; as a closed linear subspace it is a graph.

step 1.2
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

A separately continuous bilinear map on Banach spaces is jointly continuous

Statement

Assume DC. If X,Y are Banach, Z normed, and b:X×YZ is bilinear and separately continuous, then b is jointly continuous.

Facts & Assumptions

Given: DC, Banach X,Y, normed Z, and separately continuous bilinear b.

Proof

technique · direct
1.1

For each y in the unit ball of Y, xb(x,y) is bounded; for fixed x, separate continuity makes their values at x bounded on that unit ball.

given
2.1

Uniform boundedness Uniform boundedness principle gives C with b(x,y)Cxy.

step 1.1
3.1

Thus b is bounded in the sense of A bounded bilinear map between normed spaces, and the boundedness/joint-continuity equivalence For a bilinear map, boundedness is equivalent to joint continuity yields joint continuity.

step 2.1
CorollaryStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-07Open item page →

A one-sided comparison of two complete norms makes them equivalent

Statement

Assume DC. Let p,q be complete norms on one vector space V. If q(v)Cp(v) for all v and some C>0, then p and q are equivalent norms (Equivalent norms, and the dictionary with equivalent metrics).

Facts & Assumptions

Given: DC, complete norms p,q on V, and qCp.

Proof

technique · direct
1.1

The identity I:(V,p)(V,q) is a bounded linear bijection by the assumed inequality.

given
2.1

Both spaces are Banach (Banach space), so Bounded inverse theorem makes I1 bounded: p(v)Cq(v) for some C>0.

step 1.1
3.1

The two inequalities are precisely equivalence of p and q.

step 2.1

5 · Examples, counterexamples and false statements

None yet.

Sources