Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedprecheck passverified 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.

Exponential singular decay, logarithmic balls, and spectral gaps

Example

Assume Countable Choice. Put I=N∖{0}={1,2,…}. On real ℓ2(I), let ej be the coordinate vectors and define Kγx=(exp⁡(−γj)xj)j∈I, where γ1=0, γj is strictly increasing, and γj→∞. For ν,q,ρ>0, the power source ball Xν,ρ(Kγ):={∣Kγ∣νw:∥w∥2≤ρ} has coordinates xj=exp⁡(−νγj)wj, and the logarithmic source ball Xlog⁡,q,ρ(Kγ):={ψq(∣Kγ∣)w:∥w∥2≤ρ}, where ψq(0)=0 and ψq(t)=(1+log⁡(1/t))−q for 0<t≤1, has coordinates xj=(1+γj)−qwj. The operator is compact and injective with ∥Kγ∥=1. The choice γj=j−1 gives ordinary exponential decay; γj=j(j−1)/2 gives gaps with sj+1/sj=exp⁡(−j). For this latter choice, write sj=exp⁡(−γj) and δj⋆=ρ(sjsj+1)(ν+1)/2. Then εKγ(Xν,ρ(Kγ),δj⋆)/((δj⋆)ν/(ν+1)ρ1/(ν+1))→0, so no matching constant lower bound holds at every sufficiently small δ.

Facts & Assumptions

Given: Countable Choice, I=N∖{0}, real ℓ2(I), coordinate vectors ej for j∈I, a strictly increasing family (γj)j∈I with γ1=0 and γj→∞, parameters ν,q,ρ>0, and the diagonal map Kγ.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is the hypothesis of the compact norm-limit theorem, Hilbert adjoint, and compact square-root results used below.

[F1]

Square-summable families on an arbitrary index set and the space ℓ2(I) and The real square-summable sequence space is complete: For any index set I, ℓ2(I,R) has the coordinate inner product, norm squared ∑j∈I∣xj∣2, and unit coordinate vectors ej. The real space ℓ2(N,R) is complete.

[F2]
[F3]

The Hilbert-space adjoint of a bounded operator, Hilbert-adjoint identities, and Self-adjoint, positive, unitary and normal operators: Every bounded operator on a Hilbert space has a unique adjoint satisfying ⟨Tx,y⟩=⟨x,T∗y⟩; self-adjointness is T∗=T, and positivity is ⟨Tx,x⟩≥0 for every x.

[F4]

Bounded finite rank operators are compact and Norm limit of compact operators is compact: Bounded finite-rank maps are compact, and a norm limit of compact maps into a Banach space is compact under Countable Choice.

[F5]

Positive square root of a compact positive operator and Compact spectral filters, source conditions, and qualification: A compact self-adjoint positive operator has a unique compact self-adjoint positive square root. This root acts on an eigenvector of eigenvalue λ by λ; compact spectral multipliers act eigenvalue by eigenvalue.

[F6]

Spectral-index source balls for compact operators and Power source ball: The source ball is the image of the radius-ρ vector ball under its spectral index multiplier; the power index is tν, and the logarithmic candidate defines a source ball once bounded on the compact spectrum.

[F7]

Centered conditional modulus of continuity and Conditional modulus on a power source ball: The centered modulus is the supremum of ∥x∥ over source-ball elements with ∥Kx∥≤δ. For a power source ball it is at most δν/(ν+1)ρ1/(ν+1) and attains this value at the radii ρsjν+1.

[F9]

The exponential tends to +∞ at +∞ and to 0 at −∞: exp⁡(−t)→0 as t→+∞.

Verification

1.1givenA1F6F8algebra

For 0<t≤1, [F8] gives log⁡(1/t)≥0, so 1+log⁡(1/t)≥1; since q>0, (1+log⁡(1/t))q≥1 and ψq(t)≤1. Together with ψq(0)=0, this verifies that the logarithmic index is bounded and admissible under [F6].

1.2givenA1F1F2F3F10algebra

The bijection Ux=(xn+1)n∈N from ℓ2(I,R) to ℓ2(N,R) preserves the coordinate inner product, so [F1] transfers completeness to ℓ2(I,R). Since γj≥0, strict increase of the exponential [F10] gives 0<exp⁡(−γj)≤1. Thus for x=(xj)∈ℓ2(I), ∥Kγx∥22=∑j∈Iexp⁡(−2γj)∣xj∣2≤∥x∥22, so Kγ is bounded with ∥Kγ∥≤1; Kγe1=e1 gives ∥Kγ∥=1. For x,y∈ℓ2(I), [F2] makes ∑j∈Iexp⁡(−γj)xjyj absolutely convergent, and the coordinate inner product gives ⟨Kγx,y⟩=∑j∈Iexp⁡(−γj)xjyj=⟨x,Kγy⟩. By uniqueness in [F3], Kγ∗=Kγ; moreover ⟨Kγx,x⟩=∑j∈Iexp⁡(−γj)∣xj∣2≥0, so Kγ is positive.

2.1givenA1step 1.2F1F2F4F8F9F10algebra

Since γj→∞, [F9] gives sj=exp⁡(−γj)→0. For N≥1, truncate Kγ by (Kγ,Nx)j=sjxj for j≤N and 0 for j>N. By step 1.2, Kγ,N is bounded; since each sj>0 for j≤N, its range is exactly span⁡{e1,…,eN}, so [F4] makes it compact. Since sj decreases to 0, ∥Kγ−Kγ,N∥=sup⁡j>Nsj=sN+1→0; [F4] then makes Kγ compact, and positivity of each sj makes it injective. The choices γj=j−1 and γj=j(j−1)/2 are strictly increasing from 0 to infinity; for the second, γj≥j−1 for j≥2 and [F8] makes the natural numbers cofinal. Its gaps are γj+1−γj=j, so [F10] gives sj+1/sj=exp⁡(−γj+1)/exp⁡(−γj)=exp⁡(−j)→0 by [F8]–[F9].

3.1givenA1step 1.2step 2.1F1F5F6F8algebra

By steps 1.2 and 2.1, Kγ is compact, self-adjoint, and positive, and Kγ∗Kγ=Kγ2. Thus Kγ is itself a compact positive square root of Kγ∗Kγ, so uniqueness in [F5] gives ∣Kγ∣=Kγ. Hence each coordinate vector has singular value sj=exp⁡(−γj); [F5] gives (∣Kγ∣νw)j=exp⁡(−νγj)wj and (ψq(∣Kγ∣)w)j=(1+log⁡(1/sj))−qwj=(1+γj)−qwj.

4.1givenA1step 3.1F1F7constructalgebra

For each j, take w(j)=ρej and x(j)=∣Kγ∣νw(j)=ρsjνej by step 3.1. Then ∥Kγx(j)∥2=ρsjν+1 and ∥x(j)∥2=ρsjν=(ρsjν+1)ν/(ν+1)ρ1/(ν+1), so [F7] gives equality at that noise radius.

5.1givenstep 2.1step 3.1F1F6F7F8F9F10algebra∎

Take γj=j(j−1)/2, write rj=sj+1/sj=exp⁡(−j), and set δj⋆=ρ(sjsj+1)(ν+1)/2. For any x=∣Kγ∣νw with ∥w∥2≤ρ and ∥Kγx∥2≤δj⋆, step 3.1 gives xk=skνwk and (Kγx)k=skν+1wk. Since sk≥sj for k≤j, ∑k≤j∣xk∣2≤sj−2∑k≤j∣(Kγx)k∣2≤(δj⋆)2/sj2; since sk≤sj+1 for k>j, ∑k>j∣xk∣2≤sj+12ν∑k>j∣wk∣2≤ρ2sj+12ν. Thus ∥x∥22≤(δj⋆)2/sj2+ρ2sj+12ν. With Mj=(δj⋆)ν/(ν+1)ρ1/(ν+1)=ρ(sjsj+1)ν/2, this gives ∥x∥22/Mj2≤rj+rjν. By [F8], rjν=exp⁡(−νj)→0 by [F9], since ν>0 and the natural numbers are cofinal; likewise rj=exp⁡(−j)→0. Taking the supremum over such feasible x using [F7] gives εKγ(Xν,ρ(Kγ),δj⋆)/Mj≤rj+rjν→0. By step 2.1, γj→∞; [F8] and the real-power definition give δj⋆=ρexp⁡(−ν+12(γj+γj+1))→0 by [F9]. Therefore, for every c>0 and δ0>0, some j has δj⋆<δ0 and εKγ(Xν,ρ(Kγ),δj⋆)<cMj, ruling out a positive constant lower bound by the power scale at every sufficiently small noise radius.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

146 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