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.
The Baire Principles of Functional Analysis
1 · Prerequisites
- Approximation and Compactness in C(K)
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Subspaces, Products, and Quotients
- Suprema and Infima
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Vector Spaces, Linear Subspaces, Span and Direct Sums
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
Uniform boundedness principle
Statement
Assume DC. Let be a Banach space, a normed space, and let be a family of bounded linear operators (A bounded linear operator between normed spaces). If for every , then , where the norm is The operator norm as the least bound and as the unit-sphere or unit-ball supremum.
Facts & Assumptions
Given: DC, as in the statement, and pointwise boundedness.
Proof
Put . Each is closed (an intersection of inverse images of closed balls), and pointwise boundedness gives .
By Under Dependent Choice, a nonempty complete metric space is not a countable union of closed sets with empty interior, some contains a ball .
For , both and lie in that ball, so for every .
Rescaling a nonzero to yields ; the same is clear for . Thus for every .
Baire dichotomy for a pointwise-defined family of bounded linear operators
Statement
Assume DC. Let be Banach, normed, and (A bounded linear operator between normed spaces). Either (The operator norm as the least bound and as the unit-sphere or unit-ball supremum), or
is a dense subset of .
Facts & Assumptions
Given: DC and as in the statement.
Proof
Let . These sets are closed, and .
If some has nonempty interior, the translation-and-rescaling argument of Uniform boundedness principle gives a common operator-norm bound.
Otherwise every is closed with empty interior. Its complement is open dense, so is and dense by Under Dependent Choice, a nonempty complete metric space is not a countable union of closed sets with empty interior.
The two alternatives exhaust the cases from step 2.1, proving the dichotomy.
A pointwise limit of bounded operators is bounded with the liminf norm bound
Statement
Assume DC. Let be Banach, normed, and bounded linear (A bounded linear operator between normed spaces). If in for every , then is bounded linear and
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 with pointwise convergence as in the statement.
Proof
Passing and to limits shows that is linear.
For each , continuity of the norm gives , so is bounded.
If , the asserted bound is immediate. Otherwise select a subsequence whose norms tend to the finite liminf. The preceding inequality along that subsequence gives for every , hence the asserted norm bound.
A nonzero bounded linear operator is large on one of two nearby points
Statement
Let be nonzero and bounded (A bounded linear operator between normed spaces), let , and let . There is a such that
where 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 , , and .
Proof
The unit-ball definition of the operator norm supplies with and .
Put . Then both and lie in , and .
The triangle inequality applied to gives
Choosing the corresponding one of proves the claim.
Sokal's gliding-hump proof of uniform boundedness
Statement
Assume and DC. If is Banach, is normed, and a family of bounded linear maps is pointwise bounded, then .
Facts & Assumptions
Given: The stated choice principles, , and pointwise boundedness.
Proof
Suppose the norms are unbounded. Countable choice selects with for . Set .
Recursively, apply A nonzero bounded linear operator is large on one of two nearby points with centre and radius to choose with and . DC licenses these dependent choices.
The sequence is Cauchy, since its tails are bounded by a tail of ; completeness gives . Moreover .
Hence which contradicts pointwise boundedness at .
The closure of a bounded image contains a ball
Statement
Assume DC. If is a surjective bounded linear map between Banach spaces, then for some ,
Facts & Assumptions
Given: DC and a surjective bounded linear map with Banach.
Proof
Surjectivity gives . Baire applied to gives , , and with inside this closure.
Subtracting two points in this ball shows .
Scaling by gives , as required.
Successive approximation turns a closure-ball inclusion into an actual preimage
Statement
Assume DC. Let be bounded linear, with Banach. If for some , then
Facts & Assumptions
Given: DC and with the displayed closure inclusion.
Proof
Given with , repeatedly use the closure inclusion, after scaling, to choose with and residual of norm . DC licenses this dependent recursive selection.
Boundedness makes continuous by For a linear operator, boundedness, continuity at 0, continuity, and Lipschitz continuity are equivalent, so as the residuals vanish.
Open mapping theorem
Statement
Assume DC. A surjective bounded linear map between Banach spaces is open: it maps every open subset of to an open subset of .
Facts & Assumptions
Given: DC and a surjective bounded linear map between Banach spaces.
Proof
The preceding successive-approximation lemma gives with .
For every and , linearity gives .
Let be open and . Choose with . Then step 2.1 gives . Thus every point of is interior, so is open.
Quantitative lifting form of the open mapping theorem
Statement
Assume DC. For a surjective bounded linear between Banach spaces, some satisfies .
Facts & Assumptions
Given: DC and as in the statement.
Proof
It therefore contains for some , which is exactly the claim.
Bounded inverse theorem
Statement
Assume DC. A bounded bijective linear map between Banach spaces has a bounded linear inverse .
Facts & Assumptions
Given: DC and a bounded bijective linear between Banach spaces.
Proof
If , the point lies in , so its unique preimage has norm . Scaling gives ; this also holds at .
Thus is bounded, and it is linear because is a linear bijection.
The graph of a linear operator with a linear domain
Definition
For normed spaces , a linear subspace (Linear subspace of a vector space) and a linear map , its graph is . Equip with the maximum product norm from The standard product norms on a finite product of normed spaces. The operator is closed when is closed in this norm.
Closed graph theorem
Statement
Assume DC. For Banach spaces and an everywhere-defined linear , 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 , and an everywhere-defined linear map .
Proof
If is bounded, and , continuity gives , so the graph is closed.
Conversely, a closed graph is Banach by A closed subspace of a Banach space is Banach, since is Banach by Finite products of Banach spaces are Banach.
The first projection is a bounded linear bijection; its inverse is bounded by Bounded inverse theorem. Composing that inverse with the second projection makes bounded.
A closable densely defined linear operator
Definition
Let and be normed spaces, and let 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 (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 .
Sequential criterion for closability
Statement
Assume DC. A densely defined linear is closable if and only if every sequence with and has .
Facts & Assumptions
Given: DC and as in the statement.
Proof
If the graph closure is a graph and lies in it, it must equal the graph point ; this proves the sequential condition.
Conversely, if and lie in the graph closure, sequences of graph points converging to them exist by metric closure (using DC to choose approximants). Their differences give a sequence tending to .
The sequential condition gives , so the graph closure has at most one second coordinate over each first coordinate; as a closed linear subspace it is a graph.
A separately continuous bilinear map on Banach spaces is jointly continuous
Statement
Assume DC. If are Banach, normed, and is bilinear and separately continuous, then is jointly continuous.
Facts & Assumptions
Given: DC, Banach , normed , and separately continuous bilinear .
Proof
For each in the unit ball of , is bounded; for fixed , separate continuity makes their values at bounded on that unit ball.
Thus 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.
A one-sided comparison of two complete norms makes them equivalent
Statement
Assume DC. Let be complete norms on one vector space . If for all and some , then and are equivalent norms (Equivalent norms, and the dictionary with equivalent metrics).
Facts & Assumptions
Given: DC, complete norms on , and .
Proof
The identity is a bounded linear bijection by the assumed inequality.
Both spaces are Banach (Banach space), so Bounded inverse theorem makes bounded: for some .
The two inequalities are precisely equivalence of and .
5 · Examples, counterexamples and false statements
None yet.
Sources
- Buhler--Salamon, Functional Analysis, Theorem 2.1
- Teschl, Topics in Real and Functional Analysis, Theorem 4.3
- Buhler--Salamon, Functional Analysis, Theorem 2.5
- Sokal, A Really Simple Elementary Proof of the Uniform Boundedness Theorem, p. 1
- Sokal, A Really Simple Elementary Proof of the Uniform Boundedness Theorem, pp. 1--3
- Buhler--Salamon, Functional Analysis, Lemma 2.9
- Buhler--Salamon, Functional Analysis, Lemma 2.10
- Buhler--Salamon, Functional Analysis, Theorem 2.8
- Buhler--Salamon, Functional Analysis, Corollary 2.11
- Buhler--Salamon, Functional Analysis, Theorem 2.12
- Buhler--Salamon, Functional Analysis, Section 2.2.2
- Buhler--Salamon, Functional Analysis, Theorem 2.20
- Buhler--Salamon, Functional Analysis, Definition 2.25
- Buhler--Salamon, Functional Analysis, Lemma 2.26
- Buhler--Salamon, Functional Analysis, Corollary 2.7
- Teschl, Topics in Real and Functional Analysis, Theorem 4.6