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.
Bakushinskii veto for discontinuous pseudoinverses
Statement
Assume Countable Choice. Let be a compact linear operator between real or complex Hilbert spaces over one scalar field, with Hilbert-space Moore–Penrose inverse . Suppose is discontinuous on with its norm inherited from . Let be maps such that for every as , and let be a deterministic noise-level-free rule. For each exact datum and , set . If as for every , then is continuous on Thus, when is discontinuous, no such noise-level-free rule yields worst-case convergence over each exact datum's full admissible error balls. The limit is required separately for each exact datum, not uniformly over . This veto does not exclude convergence on restricted solution or error classes, stochastic noise models, or finite-dimensional problems.
Statement references
Facts & Assumptions
Given: Countable Choice, a compact linear map between real or complex Hilbert spaces over one scalar field, its Moore–Penrose inverse discontinuous on , a family that converges pointwise to on this domain, a noise-level-free rule , and the convergence condition for each .
The Axiom of Countable Choice (): For every family of nonempty sets indexed by , there is a function with domain such that for every .
Compact linear inverse model between Hilbert spaces: The compact inverse model has real or complex Hilbert parameter and data spaces over one scalar field and a compact linear forward map .
Hilbert-space Moore–Penrose inverse: The inverse has domain and maps to the unique minimum-norm solution of .
Noise-level-free parameter-choice rule: For the fixed operator and reconstruction family, is a function of the observed datum alone; its value does not take the exact datum or noise bound as input.
Proof
Fix and put . By [F3], this vector is independent of . Since itself satisfies for every , the supremum defining gives for every . Letting proves .
Fix and . By the assumed limit choose such that . For any with , step 1.1 applied to gives , while belongs to the ball in . Hence . This is continuity of at the arbitrary point in its subspace domain, contradicting the hypothesis.
Depends on
Used by
Dependency tree · two levels
18 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: Lecture Notes, Theorem 4.8 (standard reference, not scraped)
- Ferdia Sherry, Inverse Problems: Lecture Notes 2024, Theorem 3.12 (standard reference, not scraped)