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.
Factorized and composite linear inversion
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- 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 linear inverse maps and the Picard criterion
- 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
- Deterministic source classes and optimal recovery
- 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 Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Numerical Inverse Problems and Regularization Error
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Properties of the Integral and the Working FTC
- 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
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Simple Field Extensions and the Construction of the Complex Numbers
- Spectral regularization and parameter choice
- 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 Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Logarithm and General Powers
- The Riemann Integral: Definition and Integrability
- 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
Composite double regularization
Definition
Let be real or complex Hilbert spaces over one scalar field, let and be compact linear maps, and set . For spectral regularization families for and for , and a parameter rule , define for . The order is fixed by the factorization: first regularize , then ; no general identity is part of this definition.
Definition references
Composite operator diagram
The upper row is the forward map: applying and then gives . The lower row shows the estimator's domains and codomains: data in first pass through to , then through to . Read that row from right to left; the diagram omits the parameter rule's dependence on and .
For noisy data , the lower row is . The diagram records these domains and orders only; no proof about convergence or pseudoinverses relies on it.
Conditional convergence of double-discrepancy composite inversion
Statement
Assume Countable Choice. Let be real or complex Hilbert spaces over one scalar field. Let compact linear maps and have a common singular system indexed by a finite or countable set : , , and are orthonormal bases of , , and , and , , , and with . Put . Let , , , with , and ; set . The common system gives the compatible minimum-norm factorization on this exact datum: and . For , let and . Assume finite constants satisfy , , and for every ; and, for each , for finite , where and . Fix and . Let be decreasing sequences with successive ratios in for one fixed . For noisy data with , choose first indices (when they exist) such that for every , and for every . For any sequence for which both selected indices exist for all sufficiently small , there are constants independent of and such that, for all sufficiently small , In particular, for fixed this two-stage reconstruction converges to . The statement is conditional on existence of both stopping indices and makes no claim that for arbitrary factorizations.
Statement references
Facts & Assumptions
Given: Countable Choice; compact real or complex Hilbert maps and with the common positive singular system in the Statement; ; , , ; the compatible minimum-norm factorization; spectral filters with the stated residual, norm, and qualification bounds; the two geometric first-crossing rules; and noisy data for a sequence .
The Axiom of Countable Choice (): Every sequence of nonempty sets admits a choice function selecting one member from each set.
Composite double regularization: The forward map is and the reconstruction applies first, then .
Compact linear inverse model between Hilbert spaces: A compact Hilbert inverse model has a compact linear forward map and exact data for a truth .
Power source ball: , where ; source elements lie in and are minimum-norm representatives.
Hilbert-space Moore–Penrose inverse: The inverse domain is , and on exact range data it returns the unique minimum-norm solution.
Singular value decomposition for compact operators: A compact Hilbert operator has a positive singular system with orthonormal right and left singular families and the corresponding operator expansion.
The Hilbert-space adjoint of a bounded operator: The adjoint is characterized by .
Compact spectral filters, source conditions, and qualification: For a filter family, the residual multiplier is and qualification bounds positive spectral powers times the absolute residual.
Spectral interpolation for power source balls: If , then .
Proof
Because and are compact, hence bounded, is compact: the image under of any bounded sequence is bounded, and compactness of gives a subsequence whose images under converge. Put and . The adjoint identity [F6] and the singular-vector equations show and : each kernel vector is orthogonal to the indicated family, and conversely a vector orthogonal to the family is orthogonal to the full range of the adjoint, hence is killed by the operator. Since is injective on (its coefficients there are the positive ), ; hence is a basis of . By [F1], . The adjoint identity [F6] gives , so [F5] yields , , and . The vectors span , since the range of is generated by and . Compact spectral calculus and [F3] therefore give and . The source element is perpendicular to , so [F4] gives . Thus lies in and lies in ; since and , the minimum-norm property [F4] gives and . Finally, satisfies and .
Let . On each , has multiplier , whose absolute value is at most because has that same multiplier on . Thus with . Also . The difference between the exact and noisy first residuals is , of norm at most ; the stopping inequality therefore gives . Applying [F8] to proves .
Put . On the common singular system, has multiplier . The bounds on and bound the two factors by ; on the product with is zero. Therefore with and . The same coefficient formula, now on , gives . The exact composite residual decomposes as . These four terms have norms at most , respectively, by the noise bound, the two stopping rules, and the composite operator bound. Since , it follows that . Applying [F8] to proves .
Replace by for ; the qualification bounds remain valid and these constants are positive. Define . Its common-system multiplier on is . Since , qualification at , , and give . On arbitrary noise coordinates, and , so . Let denote the first index of . If , the preceding noisy discrepancy is greater than ; subtracting the noise bound gives . The exact-data bound just proved then yields , and gives the same lower bound with factor . Hence . If , then is fixed. The common system and give , so for all sufficiently small . Thus , and after enlarging .
Let denote the first index of . If , the preceding noisy residual is greater than . Its difference from the exact-data residual is , of norm at most , so . Expanding in the common basis and applying the qualification bound at gives . Thus , and gives the same lower bound for with the extra factor . Consequently , where is independent of . If , then is fixed. Since , we have for all sufficiently small , and hence . Combining this noise bound with step 2.1 and the triangle inequality gives .
The exact/noisy decomposition is . By linearity, , and these terms are bounded by steps 2.1 and 3.1. Combining those estimates with the exact composite bias from step 2.2 and the outer norm bound from step 2.3 gives the two terms in the Statement, with constants independent of and . Since , both powers of are positive, so the error tends to zero for fixed .
Optimal rate for composite double discrepancy
Open problem
Assume Countable Choice. Let be real or complex Hilbert spaces over one scalar field. Let compact linear maps and have a common singular system indexed by a finite or countable set : , , and are orthonormal bases of , , and , and , , , and with . Put . Let , , , with , where , and . The common system makes and the minimum-norm solutions at their respective stages. For , let and . Assume finite constants satisfy , , and for every ; and, for every , assume a finite constant satisfies for every , where and . Fix and . Let and be decreasing positive sequences with successive ratios in for one fixed . For noisy data with , choose the first indices , when they exist, such that for every , and for every . For fixed factors, filters, parameter sequences and radius , define as the supremum of over all and all satisfying these source, noise, nonzero-data, and stopping-index conditions. Determine the sharp asymptotic order of as whenever this admissible set is nonempty. In particular, is the exponent in the upper bound optimal for fixed , or can it be improved uniformly over this composite class?
Open problem references
Status
As of 2026-10-21, the arXiv record lists v1 only. In §4, Brandt and Horn explicitly leave open whether their a-priori convergence speed is optimal. They separately call the double-discrepancy principle's finite-qualification result suboptimal and state its rate, but do not pose the DDP exponent's sharpness as that explicit open question or give a matching lower bound in Theorem 6. This item retains the DDP sharpness question as its own formulation rather than attributing it to the authors. Under the common singular system, source conditions, finite filter qualification, and both residual rules, the local theorem supplies a conditional two-term upper bound; the source's displayed radius exponent is inconsistent with its proof. Targeted searches for the exact arXiv identifier, title, and composite double-discrepancy optimality found no later resolution as of this date. No lower bound matching the two-stage rate is asserted here.
Remarks
This formulation asks about the deterministic worst-case rate of the specified two-stage residual-selection rule; it is not a claim about optimality among all reconstruction procedures.
4 · Examples, counterexamples and false statements
None yet.
Sources
- Christina Brandt and Patrick Horn, Regularisation and Parameter Choice Rules for Composite Linear Inverse Problems, §2.1 and Theorem 1
- Christian Clason, Regularization of Inverse Problems, full lecture notes
- Christina Brandt and Patrick Horn, Regularisation and Parameter Choice Rules for Composite Linear Inverse Problems, Theorem 6 and proof
- Christian Clason, Regularization of Inverse Problems, full lecture notes, Theorem 5.11
- Christina Brandt and Patrick Horn, Regularisation and Parameter Choice Rules for Composite Linear Inverse Problems, v1