Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)verified 2026-10-22 (gpt-6.1-sol)
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.

Tangential cone control compares derivative and data residuals

Statement

Let X,Y be real Hilbert spaces, let U⊆X be open, and let F:U→Y be Fréchet differentiable at x∈U. Suppose that for some δ>0 with B‾δ(x)⊆U and some 0≤η<1, the local tangential cone condition at x holds on radius δ with constant η. Then for every h∈X with ∥h∥X≤δ,

(1−η) ∥F(x+h)−F(x)∥Y≤∥F′(x)h∥Y≤(1+η) ∥F(x+h)−F(x)∥Y.

Facts & Assumptions

Given: Real Hilbert spaces X,Y, an open set U⊆X, a map F:U→Y Fréchet differentiable at x∈U, a radius δ>0 with B‾δ(x)⊆U, a constant 0≤η<1 for which the local tangential cone condition holds at x, and h∈X with ∥h∥X≤δ.

[F1]

The local tangential cone condition gives ∥F(x+h)−F(x)−F′(x)h∥Y≤η∥F(x+h)−F(x)∥Y for every h with ∥h∥X≤δ (Local tangential cone condition).

[F2]

The induced norm of a real inner-product space satisfies ∥u+v∥≤∥u∥+∥v∥ (The induced length is a norm).

Proof

1.1givenF1F2construct

Put d:=F(x+h)−F(x) and e:=d−F′(x)h. By [F1], ∥e∥Y≤η∥d∥Y. Since F′(x)h=d−e, [F2] gives ∥F′(x)h∥Y≤∥d∥Y+∥e∥Y≤(1+η)∥d∥Y.

2.1F1F2step 1.1algebra∎

Since d=F′(x)h+e, [F2] gives ∥d∥Y≤∥F′(x)h∥Y+∥e∥Y≤∥F′(x)h∥Y+η∥d∥Y by [F1]. Rearranging yields (1−η)∥d∥Y≤∥F′(x)h∥Y; combining this with step 1.1 proves both inequalities.

Depends on

Used by

Dependency tree · two levels

13 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