Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge 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.

A logarithmic endpoint rate with explicit effective noise and tolerance control

Statement

Fix p,ν,a,C∗,C>0 and let ψ be a continuous nondecreasing concave source index with ψ(0)=0. Suppose its conjugate H(q)=sup⁡t≥0(ψ(t)−qt) satisfies H(q)≤C(log⁡q)−ν for all sufficiently large q. Let δ↓0 be a nominal parameter, and put Lδ=log⁡(1/δ). Suppose nonnegative errors satisfy Sδ+aαδeδ≤dδ+αδψ(C∗Sδ),αδ≍δp,dδ=O(δpLδ−ν). Then eδ=O(Lδ−ν),Sδ=O(δpLδ−ν). For the joint objective estimate with p≥1 and actual data noise εδ=∥yδ−y∥, the hypothesis on dδ is supplied by 2εδp+ηδ=O(δpLδ−ν). This condition explicitly strengthens the usual nominal bound εδ≤δ, ηδ=O(δp) at the endpoint. If eδ=12∥uδ−u†∥2, the norm rate is O(Lδ−ν/2).

The universal assertion that α≍δ2 yields a vanishing norm error for every deterministic noise family bounded by δ is false, even for an exact quadratic Tikhonov minimizer and a truth satisfying every nonnegative variational source inequality: on real ℓ2, take Kej=j−1ej, x†=0, yδj=δjej, δj=1/j, αj=δj2, and objective ∥Kx−yδj∥2+αj2∥x∥2. Its unique minimizer is 2ej/3. This counterexample refutes the universal abstract endpoint assertion; it makes no assertion that these data arise from an EIT conductivity map.

Facts & Assumptions

Given: The scalar comparison, conjugate bound, nominal endpoint parameter, and effective noise hypothesis in the Statement.

[F1]

A conjugate bound for residual and Bregman errors gives eδ≤a−1(dδ/αδ+H(1/(C∗αδ))) and Sδ≤2(dδ+αδH(1/(2C∗αδ))).

Proof

1.1F1givenalgebra

Put dδ+:=max⁡{dδ,0}. The scalar inequality remains true with dδ+ on its right, and dδ+=O(δpLδ−ν). Since αδ≍δp, one has log⁡(1/(cαδ))∼pLδ for either fixed c=C∗ or c=2C∗. Thus both conjugate terms in [F1] are O(Lδ−ν), while dδ+/αδ=O(Lδ−ν). Substitution into [F1] proves both error estimates. If the joint approximate-minimum comparison is made with actual noise εδ and p≥1, its comparison term is dδ=2εδp+ηδ; this follows by replacing the noise upper bound by its actual value in the triangle-power comparison. The explicitly stated effective noise hypothesis therefore suffices. The quadratic norm rate follows by taking square roots.

2.1step 1.1givenalgebra∎

For the asserted counterexample, complete squares coordinatewise in ∥Kx−yδj∥2+(αj/2)∥x∥2. Every coordinate i≠j has unique minimizer zero. The jth coordinate has unique minimizer j−1δjj−2+αj/2=2/3. All quadratic coefficients are positive and the penalty is strictly positive definite, so this point is the unique global minimizer on ℓ2. Its norm error is 2/3 for every j. At truth zero the regularizer subgradient is zero, so the variational source left side is zero and any nonnegative source index satisfies the inequality. Also ∥yδj−Kx†∥=δj, so the ordinary deterministic noise bound holds exactly. This proves the false universal endpoint assertion fails and explains the need for an explicit additional noise condition in step 1.1.

Depends on

Used by

Dependency tree · one level

1 result within one dependency step 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