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.
Compact linear inverse maps and the Picard criterion
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compact Operators and Riesz Schauder Theory
- Compact Self Adjoint Hilbert Schmidt and Trace Class Operators
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complex Subspace Realification
- Complexification, Realification and Real Structures
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convergence: Nets and Filters
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces Adjoint Operators and Annihilators
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Dimensional Normed Spaces and Riesz Lemma
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Inverse maps, identifiability, and stability
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Metric Spaces
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Polynomial Rings, the Division Algorithm and Roots
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- 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
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Analytic Hahn Banach Theorem
- The Complex Exponential and Euler's Formula
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Logical flowchart
3 · Definitions, theorems and proofs
Hilbert-space Moore–Penrose inverse
Definition
Assume the Axiom of Countable Choice. Let and be real or complex Hilbert spaces over the same scalar field, and let be a bounded linear operator. Write for its range, for its kernel, and for the orthogonal complement of a subspace . The kernel is closed, so the restriction is a linear bijection. Define the Hilbert-space Moore–Penrose inverse to have domain and, for the unique decomposition with and , set Thus is the unique minimum-norm solution of , and the orthogonal-range component is mapped to zero. Boundedness of on this domain is not part of the definition.
Definition references
Bounded linear operators and their norm bound
Real and complex Hilbert spaces
Positive-definite inner products and induced norms
Orthogonal decomposition by a closed subspace
Pythagoras for orthogonal vectors
Metric closure and approximation by points of a set
The Axiom of Countable Choice used for orthogonal decomposition
Facts & Assumptions
Given: Countable Choice, real or complex Hilbert spaces , and a bounded linear operator .
A bounded linear operator has a real bound such that for every (A bounded linear operator between normed spaces).
For a subspace , consists of vectors orthogonal to every element of , and (Orthogonality and the orthogonal complement).
Every closed subspace of a Hilbert space splits the space uniquely as (Orthogonal decomposition by a closed subspace).
Finite orthogonal sums satisfy Pythagoras (Pythagoras and finite orthogonal sums).
For nonempty in a metric space, exactly when every ball about meets , and is the smallest closed superset (The closure of a nonempty is , equals together with its limit points, and is the smallest closed superset).
The inner-product norm is definite: implies (Real and complex inner-product spaces and their induced length).
Countable Choice is the hypothesis used by [F3] (The Axiom of Countable Choice ()).
Proof
If , then is closed. Otherwise choose a bound from [F1]. For any , [F5] lets us choose, for every , an with . Hence for every , so and by [F6]. Thus , and [F5] implies that is closed.
Fix and choose with . By [F3] and step 1.1, write with and ; then . The restriction is therefore surjective. If and , then , so by [F2]. Thus is bijective.
If is any solution of , then . Since , [F4] gives , with equality only when . So is the unique minimum-norm solution.
For , the decomposition is unique because by [F2], so the definition is single-valued. If , then and the unique minimum-norm preimage of is by step 3.1; hence . For and scalars , the vector lies in and maps under to , so uniqueness in step 2.1 gives . The definition is therefore a well-defined linear operator on the stated domain.
Compact linear inverse model between Hilbert spaces
Definition
Let be real or complex Hilbert spaces over the same scalar field, and let be a compact linear operator. The associated compact linear inverse model has parameter space , data space , forward map , and admissible truth class : for a true parameter , the exact datum is . Given an exact datum , solving this inverse problem means finding a parameter such that . No injectivity, surjectivity, or closed-range assumption is included in the model.
Closed range and boundedness of the Hilbert pseudoinverse
Statement
Assume the Axiom of Countable Choice. Let be the compact linear operator of a real or complex Hilbert-space inverse model, and let be its Hilbert-space Moore–Penrose inverse, with carrying the norm inherited from . Then is bounded on its domain if and only if is closed in ; for compact , these conditions are also equivalent to being finite-dimensional. Here bounded means that some real satisfies for every .
Statement references
Facts & Assumptions
Given: Countable Choice, a compact linear map between real or complex Hilbert spaces, and its Moore–Penrose inverse .
The compact model has Hilbert parameter/data spaces and a compact linear forward map (Compact linear inverse model between Hilbert spaces).
, and on the inverse is the minimum-norm preimage of (Hilbert-space Moore–Penrose inverse).
Under Countable Choice, the compact singular system has a finite positive index set exactly in the finite-dimensional-range case; otherwise its positive singular values are indexed by and form a sequence tending to zero, with orthonormal singular vectors and , (Singular value decomposition for compact operators).
The adjoint identity is (The Hilbert-space adjoint of a bounded operator).
For a finite orthonormal family , (The finite Bessel inequality and best approximation by a finite orthonormal family).
Finite orthogonal sums satisfy Pythagoras (Pythagoras and finite orthogonal sums).
A finite-dimensional subspace of a normed space is closed (A finite-dimensional normed subspace is closed).
A Hilbert space is complete in its induced norm (Hilbert space).
Cauchy–Schwarz makes continuous for fixed (Cauchy–Schwarz: , with equality exactly for dependent pairs).
For every real there is a natural with (For every in a complete ordered field there is a natural with ).
A starting value and a total recursive rule define a unique sequence (The recursion theorem).
Every nonempty subset of has a least element (The well-ordering principle).
Countable Choice is the hypothesis of the compact SVD in [F3] (The Axiom of Countable Choice ()).
Proof
Suppose the positive singular system is finite, with index set . If , the SVD expansion gives , so is closed by [F7] and is bounded on its domain. If , each lies in , while the SVD expansion places every in ; hence the range equals this finite-dimensional span and is closed by [F7]. For , and , so by [F2] and [F3]. Pythagoras and Bessel give ; here is the smallest positive singular value, and the last inequality follows from . Thus finite rank implies closed range and bounded .
Suppose instead that the positive singular index set is . Since , for each pair the set of integers with is nonempty; [F12] gives its least element, so [F11] defines recursively and for every . Set . For , [F6] gives , so is Cauchy and converges to some by [F8]. Each belongs to because , hence . If , then for every and every , orthonormality gives ; by [F9] we may pass to the limit to get . The SVD and adjoint identity [F3]–[F4] then give , so for every . Applying [F5] to any first of these orthonormal vectors gives for every . Taking in [F10] yields an integer with , hence , a contradiction. Thus and the range is not closed.
For each , and by [F2], since . Therefore , so is unbounded when the positive singular system is infinite.
By [F3], every compact has either finite range dimension, covered by step 1.1, or an infinite positive singular system, covered by steps 1.2 and 2.1. Thus is closed exactly in the finite-dimensional case, and in exactly that case is bounded. This proves both stated equivalences.
Picard range and pseudoinverse-domain criterion
Statement
Assume the Axiom of Countable Choice. Let be a compact linear map between real or complex Hilbert spaces, with Hilbert adjoint . Write . If has finite dimension , put , interpreted as empty when ; if is infinite-dimensional, put . Thus indexes exactly the positive singular values in nonincreasing order. Let and be complete orthonormal families in and , respectively, with and . The empty sum is zero, finite uses a finite sum, and infinite uses the norm-convergent series whenever the stated square-summability condition holds. Use inner products linear in the first argument. Define the Picard sum Then:
-
The exact equation is solvable if and only if and .
-
The domain of the Hilbert-space Moore–Penrose inverse is and for every , Thus the orthogonal component in is discarded by ; exact range membership additionally requires that component to be zero.
Statement references
Singular-system diagram
For a fixed positive singular index , the diagram records the domain/codomain action on its one-dimensional singular directions:
The two composites agree because . This diagram explains the singular-pair convention; no proof step relies on it.
Facts & Assumptions
Given: Countable Choice, the compact Hilbert-space model , its adjoint , and the positive singular system described in the statement.
The model supplies real or complex Hilbert parameter/data spaces and a compact linear forward map (Compact linear inverse model between Hilbert spaces).
The compact SVD supplies the positive singular values, complete orthonormal right and left singular families, the singular relations, and the operator expansion (Singular value decomposition for compact operators).
Finite Bessel inequality: for every finite orthonormal family (The finite Bessel inequality and best approximation by a finite orthonormal family).
Finite orthogonal sums satisfy Pythagoras (Pythagoras and finite orthogonal sums).
On a complete orthonormal family, the finite Fourier sums converge in norm to each vector in its closed span (Fourier expansion in a Hilbert space).
Every closed subspace of a Hilbert space has an orthogonal decomposition (Orthogonal decomposition by a closed subspace).
Hilbert spaces are complete and Cauchy–Schwarz makes the inner product continuous in either argument (Hilbert space, Cauchy–Schwarz: , with equality exactly for dependent pairs).
For with and , the inverse returns the minimum-norm preimage of and annihilates (Hilbert-space Moore–Penrose inverse).
A compact linear operator is bounded and hence continuous in norm (Compact linear operator).
Countable Choice is the hypothesis in the compact SVD and Hilbert Fourier expansion used here (The Axiom of Countable Choice ()).
Proof
Suppose . Then by [F3]. For each , the adjoint identity and singular relation give . Applying [F5] to finite subsets of the orthonormal family shows . This proves necessity in claim 1.
Now let and . By [F3], . For finite take the finite sum; for infinite let . For , [F6] gives , whose tails tend to zero because . Thus is Cauchy and converges to by [F9]. The complete right singular family places in .
By [F11], applying to the finite sums and passing to the limit gives , where the last equality is [F7] on . The finite- case is the same equality with a finite sum. Since and , [F10] identifies . This proves sufficiency in claim 1 and the formula there.
For arbitrary , apply [F8] to the closed subspace and write with and . Since , . The Fourier coefficients of are , and [F7] expands in the complete left singular family. If , the construction in steps 1.2–2.1 applied to gives and ; hence and [F10] gives the displayed formula.
Conversely, let with and . By [F3], and each , so . Step 1.1 applied to shows ; [F10] gives and the same series formula. Thus the domain is exactly the set where the Picard sum is finite, completing claim 2.
4 · Examples, counterexamples and false statements
None yet.
Sources
- Christian Clason, Regularization of Inverse Problems: Lecture Notes, arXiv:2001.00617v2, Theorem 3.3
- Otmar Scherzer and Leonidas Mindrinos, Inverse Problems: Lecture Notes, University of Vienna, 2015
- Christian Clason, Regularization of Inverse Problems: Lecture Notes, arXiv:2001.00617v2, §3.1
- Christian Clason, Regularization of Inverse Problems: Lecture Notes, arXiv:2001.00617v2, Theorem 3.7
- Otmar Scherzer and Leonidas Mindrinos, Inverse Problems: Lecture Notes, University of Vienna, 2015, Theorem 6.6 (singular-system context)
- Christian Clason, Regularization of Inverse Problems: Lecture Notes, arXiv:2001.00617v2, Theorem 3.10
- Otmar Scherzer and Leonidas Mindrinos, Inverse Problems: Lecture Notes, University of Vienna, 2015, Theorem 6.7
- Vesa Kaarnioja, Inverse Problems: Fourth Lecture, FU Berlin, 8 May 2023