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.

Logarithmic source indices and their admissible parameter scales

Statement

Fix C,ν>0 and 0<t0<e−(ν+1). Define ψ(0)=0, ψ(t)=C[log⁡(1/t)]−ν for 0<t≤t0, and ψ(t)=ψ(t0) for t>t0. Then ψ is continuous, nondecreasing and concave, and H(q):=sup⁡t≥0(ψ(t)−qt)∼C(log⁡q)−ν(q→∞). For each fixed c>0, one consequently has H(cq)/H(q)→1. For p>0, fixed D,a,C∗>0 and nonnegative errors satisfying Sδ+aαeδ≤Dδp+αψ(C∗Sδ), the balanced choice α≍δp[log⁡(1/δ)]ν gives eδ=O([log⁡(1/δ)]−ν),Sδ=O(δp). For a pure-power choice α≍δk with 0<k<p, the same error rate follows, with residual bound Sδ=O(δk[log⁡(1/δ)]−ν). No assertion for k=p is made. If eδ=12∥uδ−u†∥2, the corresponding norm rate has exponent ν/2.

Facts & Assumptions

Given: The constants, index, scalar inequality and parameter choices in the Statement.

[F1]

A conjugate bound for residual and Bregman errors: the scalar inequality implies eδ≤a−1(Dδp/α+H(1/(C∗α))) and Sδ≤2(Dδp+αH(1/(2C∗α))).

Proof

1.1givenalgebra

On (0,t0) write L=log⁡(1/t). Direct differentiation gives ψ′(t)=Cνt−1L−ν−1>0 and ψ′′(t)=Cνt−2L−ν−2(ν+1−L)<0. At t0 the derivative drops from a positive value to zero; above it the function is constant. Thus the derivative is nonincreasing on each smooth piece and has a downward jump, giving concavity on (0,∞); taking limits at zero extends the chord inequalities there. Continuity and monotonicity are immediate from the formula. In particular H is finite because 0≤ψ≤ψ(t0), and H≥0 by testing t=0.

2.1step 1.1givenalgebra

Put Q=log⁡q and take q sufficiently large. For 0<t≤q−1Qν+1, one has log⁡(1/t)≥Q−(ν+1)log⁡Q, so ψ(t)−qt≤C[Q−(ν+1)log⁡Q]−ν. For t>q−1Qν+1, one has qt>Qν+1>ψ(t0), so the expression is negative. This bounds H(q) above by CQ−ν(1+o(1)). Testing t=q−1Q−ν−1 gives ψ(t)−qt=C[Q+(ν+1)log⁡Q]−ν−Q−ν−1=CQ−ν(1+o(1)), proving the matching lower bound. Replacing q by cq changes Q by the fixed constant log⁡c, hence H(cq)/H(q)→1.

3.1F1step 2.1givenalgebra

For the balanced scale, log⁡(1/α)∼plog⁡(1/δ), so step 2.1 gives both conjugate values in [F1] of order [log⁡(1/δ)]−ν. Moreover δp/α has this same order, and αH(1/(2C∗α))=O(δp). Substitution in [F1] proves the balanced error and residual bounds.

4.1F1step 2.1givenalgebra∎

If α≍δk with 0<k<p, step 2.1 again gives the two conjugate values of order [log⁡(1/δ)]−ν. Since δp−k[log⁡(1/δ)]ν→0 (put x=log⁡(1/δ) and compare the exponential e(p−k)x with its power-series term of integer degree greater than ν), δp/α is bounded by the desired logarithmic order. Also δp=O(δk[log⁡(1/δ)]−ν). Apply [F1] for the two asserted bounds. Finally, eδ=12∥uδ−u†∥2 gives the norm conclusion by taking square roots.

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