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.
Local tangential cone condition
Definition
Let be real Hilbert spaces, let be open, and let be Fréchet differentiable at . For such that the closed ball
is contained in , the local tangential cone condition at on radius with constant holds if and
Definition references
Remarks
This is the one-basepoint local condition: the derivative is fixed at while varies over the ball. Some treatments impose a stronger two-point condition uniformly for every pair of points in a set. The constant restriction is part of this definition. Fréchet differentiability alone does not imply this condition.
Depends on
Used by
- Nonlinear Landweber iteration with discrepancy stopping Algorithm
- A smooth map can fail the tangential cone condition Counterexample
- Exact-data Landweber can stall without a local tangential-cone condition Counterexample
- Differential range invariance for Banach-space maps Definition
- Product-type tangential cone condition Definition
- A smooth map with a local tangential cone neighborhood Example
- Range invariance can hold when the tangential cone condition fails Example
- The initial residual can already meet the discrepancy threshold Example
- Tangential cone control compares derivative and data residuals Lemma
- Local uniqueness of an x₀-minimum-norm solution under TCC Theorem
- Nonlinear Landweber Fejér decrease and discrepancy stopping Theorem
Dependency tree · two levels
21 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, equation (9.6) (standard reference, not scraped)
- Barbara Kaltenbacher, Frank Schöpfer, and Thomas Schuster, Iterative methods for nonlinear ill-posed problems in Banach spaces, §2.3 (standard reference, not scraped)