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.

Polynomial singular decay with power and logarithmic source balls

Example

Assume Countable Choice. Put I=N∖{0}={1,2,…}. On real ℓ2(I), let ej be the coordinate vectors and define Kax=(j−axj)j∈I for a>0. For ν,q,ρ>0, the power source ball Xν,ρ(Ka):={∣Ka∣νw:∥w∥2≤ρ} has coordinates xj=j−aνwj, while the logarithmic source ball Xlog⁡,q,ρ(Ka):={ψq(∣Ka∣)w:∥w∥2≤ρ}, where ψq(0)=0 and ψq(t)=(1+log⁡(1/t))−q for 0<t≤1, has coordinates xj=(1+alog⁡j)−qwj. The operator is compact and injective with ∥Ka∥=1. For the power ball the centered modulus has the bound in the conditional-modulus theorem, with equality at δj=ρj−a(ν+1); this does not assert equality for every δ.

Facts & Assumptions

Given: Countable Choice, I=N∖{0}, real ℓ2(I), coordinate vectors ej for j∈I, a,ν,q,ρ>0, the diagonal map Ka, and the power/logarithmic source-ball conventions.

[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 positive square root, acting by λ on each positive eigenspace and by zero on the kernel; 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 it is bounded on the compact spectrum.

[F7]

Conditional modulus on a power source ball: The centered power-source modulus is at most δν/(ν+1)ρ1/(ν+1) and attains this value at the radii ρsjν+1.

Verification

1.1givenF6F8algebra

For 0<t≤1, 1/t≥1, so [F8] gives log⁡(1/t)≥log⁡1=0. Thus 1+log⁡(1/t)≥1; since q>0, the positive power of this base is at least 1, and its reciprocal ψq(t) lies in (0,1]. Together with ψq(0)=0, this verifies that the logarithmic index is bounded and is admissible under [F6].

1.2givenA1F1F2F3algebra

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). For x=(xj)∈ℓ2(I), ∥Kax∥22=∑j∈Ij−2a∣xj∣2≤∥x∥22, so Ka is a well-defined bounded linear map with ∥Ka∥≤1; Kae1=e1 gives ∥Ka∥≥1. For x,y∈ℓ2(I), [F2] makes ∑j∈Ij−axjyj absolutely convergent, and the coordinate inner product gives ⟨Kax,y⟩=∑j∈Ij−axjyj=⟨x,Kay⟩. Uniqueness of the adjoint in [F3] yields Ka∗=Ka, and ⟨Kax,x⟩=∑j∈Ij−a∣xj∣2≥0, so Ka is positive.

2.1givenA1step 1.2F1F2F4F8algebrachoose

For N≥1 define (Ka,Nx)j=j−axj for j≤N and 0 for j>N. The coordinate estimate from step 1.2 gives ∥Ka,Nx∥2≤∥x∥2, so Ka,N is bounded; since each j−a>0 for j≤N, its range is exactly span⁡{e1,…,eN}, so [F4] makes it compact. For every x, ∥(Ka−Ka,N)x∥22=∑j>Nj−2a∣xj∣2≤(N+1)−2a∥x∥22, with equality at x=eN+1; therefore ∥Ka−Ka,N∥=(N+1)−a. Given ε>0, [F8] supplies a threshold N with 1/j<ε1/a for all j≥N+1; monotonicity of t↦ta gives (N+1)−a<ε. Thus Ka,N→Ka in norm, and [F4] makes Ka compact. Each diagonal coefficient is positive, so Kax=0 forces every xj=0 and Ka is injective.

3.1givenA1step 1.2step 2.1F1F5F6algebra

Since Ka is compact, self-adjoint and positive by steps 1.2–2.1, Ka is the unique positive square root of Ka∗Ka=Ka2; [F5] therefore gives ∣Ka∣=Ka. Each ej is an eigenvector of ∣Ka∣ with eigenvalue j−a. Applying the compact spectral multiplier [F5] coordinatewise yields (∣Ka∣νw)j=j−aνwj and (ψq(∣Ka∣)w)j=ψq(j−a)wj=(1+alog⁡j)−qwj, proving the stated power and logarithmic coordinates.

4.1givenstep 3.1F1F7constructalgebra∎

For each j≥1 take w(j)=ρej and x(j)=∣Ka∣νw(j)=ρj−aνej. Then ∥Kax(j)∥2=ρj−a(ν+1)=δj and ∥x(j)∥2=ρj−aν=δjν/(ν+1)ρ1/(ν+1). This feasible source-ball element attains the universal upper bound from [F7], so equality holds at δj.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

139 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