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.
Vanishing-noise convergence to an -minimum-norm exact solution
Statement
Assume the ultrafilter lemma, dependent choice, and HB. Let be real Hilbert spaces, let be nonempty and weakly closed in the coarsest topology making every bounded real-linear functional continuous, and let satisfy: whenever , , and , one has and ; weak convergence means convergence under every bounded real-linear functional. Fix and suppose is nonempty. Let , , , , and , and let satisfy . There exists a sequence of global minimizers of on ; every such sequence has a subsequence , and every such weak limit is an -minimum-norm solution of on . No uniqueness or full-sequence convergence is asserted.
Statement references
Weakly closed domains and sequential graph closure
The nonlinear Tikhonov functional
The reference-point minimum-norm exact solution condition
Existence for every positive parameter and datum
Existence of a reference-point minimum-norm solution
Christian Clason, Regularization of Inverse Problems, Theorem 10.3
Facts & Assumptions
Given: The ultrafilter lemma, DC, and HB; a weakly closed forward map between real Hilbert spaces; ; a nonempty exact solution set for ; and sequences satisfying the stated noise and parameter conditions.
The ultrafilter lemma extends every filter to an ultrafilter (The ultrafilter extension principle (UL/BPI)).
DC supplies a sequence following an everywhere-extendible relation (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain).
HB is the real dominated-extension principle (The real dominated-extension principle as an additional hypothesis over ZF).
DC implies countable choice, the principle that every countable family of nonempty sets admits a choice function (Dependent choice implies countable choice, The Axiom of Countable Choice ()).
Under countable choice, real Hilbert spaces are reflexive (Hilbert spaces are reflexive by Riesz representation).
Under the ultrafilter lemma, DC, and HB, bounded sequences in real reflexive Banach spaces have weakly convergent subsequences (A bounded sequence in a reflexive Banach space has a weakly convergent subsequence).
The exact solution set contains an -minimum-norm solution under these hypotheses (Existence of an -minimum-norm exact solution).
For each and , the Tikhonov functional has a global minimizer under these hypotheses (Existence of a global nonlinear Tikhonov minimizer).
Under HB, weak convergence implies lower semicontinuity of the norm (Weak convergence implies lower semicontinuity of the norm).
A sequentially weak-to-weak closed graph maps weak limits to and (Weakly closed nonlinear forward maps on Hilbert spaces).
An -minimum-norm solution is an exact solution with least distance to among all exact solutions in (-minimum-norm solutions on weakly closed domains).
Proof
Given: The assumptions above.
By [F4], choose an -minimum-norm exact solution and put . For each , [F5] makes the set of global minimizers of nonempty; by [F1] and the assumed DC, choose one from each set.
Minimality, [F8], exactness of , and give . Consequently , so is bounded, and .
By [F2] and [F3], a subsequence satisfies . The triangle inequality and step 2.1 give . Thus strongly, hence weakly. Applying [F7] gives and .
By [F6], . The bound in step 2.1 gives , so . Since is an exact solution and minimizes distance among exact solutions by [F9], ; equality follows, so is an -minimum-norm exact solution. The same reasoning applies to any weakly convergent subsequence.
Remarks
The fixed-positive- stability theorem concerns minimizers of one limiting functional. This vanishing-noise theorem has the separate assumptions of exact solvability, , and . It identifies weak cluster points as minimum-norm exact solutions but does not assert a unique limit.
Depends on
- Weakly closed nonlinear forward maps on Hilbert spaces
- The nonlinear Tikhonov functional
- $x_0$-minimum-norm solutions on weakly closed domains
- Existence of a global nonlinear Tikhonov minimizer
- Existence of an $x_0$-minimum-norm exact solution
- Weak convergence of nets and sequences
- A bounded sequence in a reflexive Banach space has a weakly convergent subsequence
- Hilbert spaces are reflexive by Riesz representation
- Weak convergence implies lower semicontinuity of the norm
- The ultrafilter extension principle (UL/BPI)
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The real dominated-extension principle as an additional hypothesis over ZF
- Dependent choice implies countable choice
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
55 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Christian Clason, Regularization of Inverse Problems, Theorem 10.3 (standard reference, not scraped)
- Benedikt Wirth, Inverse Problems, Theorem 87 (standard reference, not scraped)