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.
Joint and frozen-Newton objectives for range-invariant relaxations
Definition
Let be real Banach spaces, let be a closed linear subspace of , and let contain and a nonempty set . Fix , a map , a bounded linear map , and a map such that for every . Assume that is a bijection from onto a set , and that for every admitted below. Here is the identity on and is a bounded linear projection with , , and . Let be a proper convex regularizer, let be a nonnegative penalty, and let satisfy and exactly when . For , set
For , data , and parameters , the joint relaxed objective is
The joint source-condition objective takes . The term ties the relaxed range variable to the physical variable, while penalizes the component outside .
If is Gâteaux differentiable at a current iterate , the frozen-Newton objective with parameters is
Here is the bounded linear Gâteaux derivative used to form the affine range proxy; no minimizer existence or uniqueness is part of either definition.
Depends on
Used by
- A frozen Newton step yields a controlled error inequality Lemma
- The full collared EIT class satisfies the centered range and source interfaces Lemma
- The joint relaxed objective controls Bregman and range errors Lemma
- Frozen Newton rates under differential range invariance Theorem
- Joint regularization rates under differential range invariance Theorem
Dependency tree · two levels
7 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.