Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedverified 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.

SOLIT for a Dirichlet second-antiderivative model

Example

Assume Countable Choice.

Let X=Y=L2((0,1);R) with its canonical real Hilbert inner product. For f∈L2(0,1) define T by the Green kernel G(x,t)=min⁡(x,t)(1−max⁡(x,t)), so (Tf)(x)=∫01G(x,t)f(t) dt. We use the Dirichlet solution class of continuous functions u∈C([0,1]) satisfying u(0)=u(1)=0 and u′′=−f in distributions on (0,1); the Green formula specifies its unique member. Take the truth f†(x)=x1[0,1/2](x)+(1−x)1[1/2,1](x) and exact data g†(x)=−x(4x2−3)241[0,1/2](x)+(x−1)(4x2−8x+1)241[1/2,1](x). In the normalized Dirichlet sine basis ej(x)=2sin⁡(πjx), Tej=(πj)−2ej, so the eigenvalues of T∗T are λj=(πj)−4. The positive-noise observation is the weak white-noise experiment Yf†(h)=⟨Tf†,h⟩+σZ(h), with known σ>0. Use the ordered Tikhonov filter qα(λ)=(λ+α)−1 and a geometric-variance candidate sequence. This example makes no simulation or minimax-rate claim.

Facts & Assumptions

Given: The real Hilbert space L2((0,1);R), the Green-kernel operator and truth in the Example, and the Fourier basis conventions on the period-two extension of (0,1).

[F1]

The one-dimensional torus and its normalized Haar integral: The one-dimensional torus is the quotient R/Z.

[A1]

The Axiom of Countable Choice (ACω): Countable Choice is assumed for the fixed countable singular-system and Fourier-basis coordinates.

[F2]

The trigonometric system is complete in L2 of the torus: The characters (e2πikx)k∈Z form an orthonormal basis of complex L2 on the circle.

[F3]

Gaussian sequence inverse model: For positive noise and a fixed complete singular system, the normalized observations have independent coordinates Zj=θj+σsj−1ξj with ξj∼N(0,1).

[F4]

Ordered spectral filters, source indices, and variance grids: An ordered filter is nonnegative, satisfies 0≤αqα(t)≤Cq′ and 0≤tqα(t)≤1, and increases pointwise as α decreases.

[F5]

SOLIT parameter choice on a geometric-variance grid: The algorithm forms the filtered sequence estimates and accepts an index when all finer-index differences lie below their pairwise threshold.

[F6]

Risk decomposition and monotone bias for ordered spectral filters: Each filtered estimate is a measurable square-integrable Hilbert-valued random element, with the stated bias–variance decomposition.

[F7]

L2 with the integral pairing is a Hilbert space: Real L2(0,1) with the integral pairing is a complete real Hilbert space.

[F8]

Holder's inequality for integrals, including the endpoint cases: On the finite interval (0,1), Cauchy–Schwarz gives ∥f∥1≤∥f∥2 and makes tf(t) and (1−t)f(t) integrable.

[F9]

The indefinite integral of an L1 function is absolutely continuous: The indefinite integral of an L1 function on a compact interval is absolutely continuous.

[F10]

The indefinite integral of an L1 function is differentiable almost everywhere: An indefinite Lebesgue integral of an L1 function has derivative equal to its integrand almost everywhere.

[F11]

Fubini's theorem for L^1 functions on a sigma-finite product: Absolutely integrable functions on the product of the two finite intervals may be integrated in either order.

[F12]

A distribution with zero derivatives on a connected open set is constant: A distribution on the connected interval (0,1) with zero derivative is constant; applying this twice shows that a distribution with zero second derivative is affine.

Verification

1.1givenA1F1F2F7constructalgebra

The functions ej(x)=2sin⁡(πjx) are orthonormal on (0,1) by the product-to-sum identities and direct integration. If h∈L2(0,1) is orthogonal to all of them, its odd extension to (−1,1), continued periodically with period 2, has zero constant and cosine coefficients by oddness and zero sine coefficients by the assumed orthogonality. Rescaling to the circle in [F1], every Fourier coefficient of this extension vanishes; completeness in [F2] therefore makes the extension, and hence h, zero almost everywhere. Thus (ej) is a complete orthonormal basis, and [F7] supplies the real Hilbert structure used below.

1.2givenF8F9F10F11F12constructalgebra

For f∈L2(0,1), [F8] gives f∈L1(0,1). Since 0≤G(x,t)≤1/4, ∣Tf(x)∣≤∥f∥1/4≤∥f∥2/4 for every x, so the integral formula defines a bounded linear operator from L2(0,1) to itself. The kernel formula also gives (Tf)(x)=(1−x)∫0xtf(t) dt+x∫x1(1−t)f(t) dt. The two indefinite integrals are absolutely continuous by [F9], and [F10] gives their derivatives almost everywhere. They show that Tf is continuous, has zero endpoint values, and has first derivative almost everywhere equal to the absolutely continuous function g(x)=−∫0xtf(t) dt+∫x1(1−t)f(t) dt, whose derivative is g′(x)=−xf(x)−(1−x)f(x)=−f(x) almost everywhere. To verify the claimed distributional equation directly, take any ϕ∈Cc∞(0,1). The function (x,t)↦G(x,t)f(t)ϕ′′(x) is integrable on (0,1)2, so [F11] permits reversing the integrals; splitting at x=t and integrating the smooth test function twice gives ∫01(Tf)(x)ϕ′′(x) dx=∫01f(t)(∫01G(x,t)ϕ′′(x) dx)dt=−∫01f(t)ϕ(t) dt. Thus (Tf)′′=−f in distributions. If two continuous Dirichlet solutions exist, their difference h has h′′=0 in distributions. Applying [F12] to h′ makes h′ constant, and applying it to h−cx makes h affine; continuity identifies the distribution with its pointwise affine representative. The two zero endpoint values force h=0.

1.3F4algebra

For every λ≥0, the Tikhonov filter is nonnegative and satisfies αqα(λ)=α/(λ+α)≤1 and λqα(λ)=λ/(λ+α)≤1. If α~<α, then λ+α~<λ+α, so qα(λ)≤qα~(λ). Thus the Tikhonov family is an ordered filter with Cq′=1.

2.1F2step 1.1step 1.2algebra

Since −ej′′=(πj)2ej and ej(0)=ej(1)=0, uniqueness of the Dirichlet solution from step 1.2 gives Tej=(πj)−2ej. Completeness from step 1.1 therefore diagonalizes T and T∗T, with singular values sj=(πj)−2 and eigenvalues λj=(πj)−4. All singular values are positive, so T is injective. The truncations TNf=∑j=1N(πj)−2⟨f,ej⟩ej have finite rank and satisfy ∥T−TN∥=sup⁡j>N(πj)−2→0, so T is compact. Also ∑jsj2=π−4∑jj−4<∞ by comparison with ∫1∞x−4 dx, so T is Hilbert–Schmidt.

3.1F4step 2.1algebra

For the Tikhonov filter, put V(α):=∑j≥1λj(λj+α)−2. On every compact interval [a,b]⊂(0,∞) its summands are continuous and bounded above by λj/a2, a summable sequence by step 2.1, so V is continuous there. Each summand strictly decreases with α. Also V(α)≤α−2∑jλj→0 as α→∞. For every fixed j, V(α)≥λj(λj+α)−2→1/λj as α↓0; since λj→0, these lower bounds show V(α)→∞. Given c>0 and θ>1, continuity and strict decrease give a unique αm>0 with V(αm)=cθm for each m∈N0. Thus αm decreases to zero and vm=σ2V(αm) has consecutive ratio θ, so [F4] holds.

4.1givenF3F4F5F6step 1.2step 1.3step 2.1step 3.1algebra∎

Direct integration of the two pieces of f† gives ⟨f†,ej⟩=22sin⁡(πj/2)/(π2j2). On the first half, g†(x)=−x3/6+x/8, so g†′′(x)=−x; on the second half, g†(x)=x3/6−x2/2+3x/8−1/24, so g†′′(x)=x−1. The two values at x=1/2 both equal 1/24, and both first derivatives there equal zero; the endpoint values are zero. Hence −g†′′=f† weakly with Dirichlet boundary values, so uniqueness from step 1.2 gives Tf†=g†. The sequence model in [F3] and the filter conditions in [F4] therefore supply an admissible white-noise input to the finite selector in [F5], whose estimates are well-defined by [F6].

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

110 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