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.
Bregman distances and variational source rates
1 · Prerequisites
- Banach-Space Differential Calculus and Banach Manifolds
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Convergence: Nets and Filters
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- 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
- 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
- Nonlinear maps and tangential cone control
- Nonlinear Tikhonov existence and stability
- 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
- Simple Field Extensions and the Construction of the Complex Numbers
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Analytic Hahn Banach Theorem
- The Direct Method and Euler--Lagrange Equations
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak and Weak Star Topologies
2 · Logical flowchart
3 · Definitions, theorems and proofs
Banach-space convex subgradients and dual pairings
Definition
Let be a real Banach space and let be its continuous real dual. The dual pairing is evaluation, written for and . Let be a proper convex functional: never takes the value , its effective domain is nonempty, and for and , with for this convex-combination formula. For , its subdifferential is
An element of is a subgradient of at . Set when . The subdifferential may be empty at a point of ; no nonemptiness assertion is part of this definition.
A conjugate bound for residual and Bregman errors
Statement
Let be continuous, nondecreasing, concave, and satisfy . Extend to by for , and define for , assuming the displayed suprema below are finite. For and , if
then
Statement references
Facts & Assumptions
Given: , , satisfy the hypotheses and inequality in the Statement.
The two values and are finite.
Proof
Put . Rearranging the given inequality and dividing by gives . The parenthesized expression is bounded above by the defining supremum , proving the first bound.
Subtracting from the given inequality and using gives . Multiplication by proves the second bound.
Fenchel–Young equality for a Banach regularizer
Statement
Let be a real Banach space, let be proper and convex, and define its Fenchel conjugate by . For every and , the Fenchel–Young inequality and its equality characterization are
Statement references
Facts & Assumptions
Given: , , , , and satisfy the hypotheses and definitions in the Statement.
Banach-space convex subgradients and dual pairings: exactly when for every .
Proof
The supremum defining includes the term at , so . Adding gives the Fenchel–Young inequality.
If , [F1] gives for all ; taking the supremum and then using the term proves equality.
Conversely, if equality holds, every term in the supremum satisfies . Rearrangement gives [F1], hence .
Bregman distances for convex regularizers
Definition
Let be a real Banach space, let be proper and convex, choose , and choose . For , the Bregman distance generated by from the reference point to is
The subgradient inequality makes this quantity nonnegative, and . The definition fixes the orientation: the first argument is the comparison point and the second is the reference point carrying the chosen subgradient.
Definition references
Variational source conditions on a regularizer sublevel
Definition
Let be real Banach spaces, let , let with exact datum , and let be proper and convex with . Fix , an exponent , a continuous nondecreasing concave function with and for , a coefficient , and a level . The variational source condition with these data holds on the named regularizer sublevel when
The condition is an assumption on the selected subgradient and the stated sublevel; it makes no assertion that a subgradient exists at every point or that a regularized minimizer exists.
Variational source conditions yield nonlinear regularization rates
Statement
Let be real Banach spaces, , and . Let be proper and convex, let , set , and choose . Fix , , and a level . Let be continuous, nondecreasing and concave, with and for , and assume the variational source inequality
where . Extend by on negative arguments and write ; assume is finite for sufficiently large and as . For sufficiently small noise levels and data with , define . Suppose tends to zero, , and is an -minimizer, meaning . Set and . Assume that for constants independent of ,
for all sufficiently small . Then for all sufficiently small , and
If, in addition, for a fixed such that for all sufficiently small , then . If also on for constants , then .
In the Hilbert special case, set and suppose are real Hilbert spaces, has the real open-domain interface of a nonlinear forward map, is an -minimum-norm exact solution, , and the source inequality on a regularizer sublevel contained in is
with and . For exact global minimizers of the nonlinear Tikhonov functional with , the theorem gives and . The assertion is conditional on such a global minimizer being supplied; it does not assert existence or cover local numerical minima.
Statement references
Facts & Assumptions
Given: All hypotheses in the Statement hold. Write , , and .
, is an -minimizer of , and , with .
The VSC holds on with the chosen , , and .
, , , and .
For the optional penalty conclusion, for a fixed that bounds for small .
For the optional norm conclusion, on for constants .
For the Hilbert conclusion, , , the displayed -minimum-norm VSC holds with and , and .
Bregman distances for convex regularizers: and is nonnegative.
A conjugate bound for residual and Bregman errors: from , the stated conjugate bounds hold for and .
Nonlinear forward maps between Hilbert spaces: in the Hilbert specialization is a real-Hilbert forward map on an open domain.
x₀-minimum-norm solutions of nonlinear equations: the Hilbert specialization assumes the exact solution globally minimizes distance to over its exact solution set.
The nonlinear Tikhonov functional: for a datum , .
A norm on a real vector space, the induced metric, and the dictionary with the metric axioms: each Banach norm satisfies the triangle inequality.
Real and complex inner-product spaces and their induced length: a real Hilbert norm satisfies .
Proof
Comparing the approximate-minimum inequality with the exact solution gives . Since the data term is nonnegative, by [A1] and [A3]. As and , for sufficiently small .
By [F5]–[F7] the special case uses the open-domain Hilbert map, the stipulated global -minimum-norm exact solution, and the existing quadratic nonlinear Tikhonov functional. Under [A6], define . By [F10] this is a bounded real-linear functional; expansion using [F9] gives , so [F1] gives and [F2] gives . Taking , the stated Hilbert source inequality implies the VSC with .
By [F8], . For , ; for , is continuous at zero and has nonnegative second derivative on , hence is convex on , and its defining convexity inequality at the midpoint gives . Taking , yields and thus . Substituting into the comparison inequality from 1.1 gives .
For , the conjugate is , by completing the square. With , , so and when . The scale comparability in [A3] also holds because .
By [F2] and [F3], . Combining this with the objective comparison in step 2.1 gives , where .
Apply [F4] with , , , , , and . It follows that and .
From [A1] and [A3], , , and . Thus and . The triangle inequality gives , so the noisy-data residual is .
For the penalty rate, [F2]–[F3] give , while step 1.1 supplies its upper bound. If [A4] holds for a fixed bounding , then . If [A5] also holds, the Bregman bound in step 5.1 gives .
Applying the Bregman bound from step 5.1 and the exact Bregman identity from step 1.2 gives and , hence the asserted solution error and residual.
4 · Examples, counterexamples and false statements
None yet.
Sources
- Barbara Kaltenbacher, Convergence rates under a range invariance condition with application to electrical impedance tomography, §1, notation and convex analysis tools
- Jonathan M. Borwein and Jon D. Vanderwerff, Convex Functions: Constructions, Characterizations and Counterexamples, §§4.1 and 4.4
- Barbara Kaltenbacher, Convergence rates under a range invariance condition with application to electrical impedance tomography, Lemma 2
- Frederic Weidling, Variational Source Conditions and Conditional Stability Estimates for Inverse Problems in PDEs, Theorem 2.20
- Jonathan M. Borwein and Jon D. Vanderwerff, Convex Functions: Constructions, Characterizations and Counterexamples, Proposition 4.4.1(a)
- Barbara Kaltenbacher, Convergence rates under a range invariance condition with application to electrical impedance tomography, equation (1.25)
- Frederic Weidling, Variational Source Conditions and Conditional Stability Estimates for Inverse Problems in PDEs, Chapter 2
- Christian Clason, Regularization of Inverse Problems, equation (10.17)
- Frederic Weidling, Variational Source Conditions and Conditional Stability Estimates for Inverse Problems in PDEs, equations (2.22) and (2.26)
- Barbara Kaltenbacher, Convergence rates under a range invariance condition with application to electrical impedance tomography, equations (1.28)–(1.31)
- Christian Clason, Regularization of Inverse Problems, Theorem 10.7
- Barbara Kaltenbacher, Convergence rates under a range invariance condition with application to electrical impedance tomography, Lemma 2 and Theorem 3