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

Jacobi–Anger Chebyshev truncation

Statement

With Jk,Tk defined in Hamiltonian-simulation polynomial target, for every real τ and integer d≥0, sup⁡∣x∣≤1∣exp⁡(−iτx)−(J0(τ)+2∑k=1d(−i)kJk(τ)Tk(x))∣≤2∑k>d∣Jk(τ)∣≤2(∣τ∣/2)d+1(d+1)!(1−∣τ∣/(2(d+2))) whenever ∣τ∣/(2(d+2))<1. In the OP4 simulator, ρ=ϵ2/10000 and the factorial-tail stopping test therefore certifies truncation error at most ρ/8; rounding each coefficient to error at most ρ/(32(d+1)) keeps the combined polynomial error below ρ. For the nontrivial simulation regime ∣τ∣>ϵ, an integer d passing OP4's test exists with d=O(∣τ∣+ln⁡(1/ϵ)ln⁡(e+ln⁡(1/ϵ)/∣τ∣)). For ∣τ∣≤ϵ, the constant polynomial 1 approximates the target within ϵ; the wrapper algorithm uses the exact identity circuit in that branch.

Facts & Assumptions

Given: Real τ, the coefficient series and Chebyshev recurrence in Hamiltonian-simulation polynomial target, and rational 0<ϵ<1.

[F1]

Hamiltonian-simulation polynomial target: Jk(τ)=∑j≥0(−1)j(τ/2)2j+k/(j!(j+k)!), T0=1,T1=x,Tk+1=2xTk−Tk−1, and fτ(x)=e−iτx.

[F2]

The complex exponential by its power series: ez=∑n≥0zn/n!.

[F3]

The complex exponential series converges absolutely for every complex argument: the exponential series converges absolutely at every complex argument.

[F5]

The complex exponential is entire and its complex derivative is itself: the complex exponential is differentiable with derivative equal to itself.

[F6]

exp⁡(z+w)=exp⁡z exp⁡w, and the complex exponential extends the real exponential: the complex exponential satisfies exp⁡(z+w)=exp⁡(z)exp⁡(w) for all complex z,w.

[F7]

Qubitized Hamiltonian simulator: OP4 sets ρ=ϵ2/10000, starts the degree loop at d=max⁡(1,⌈∣τ∣⌉), accepts a factorial-tail bound at most ρ/8, and rounds d+1 coefficients within ρ/(32(d+1)) each.

[F8]

Small-time-aware qubitized simulator: if α∣t∣≤ϵ, the wrapper returns the exact identity circuit.

Proof

Given: As in Facts & Assumptions.

1.1F1algebrainduction

The Chebyshev recurrence and cos⁡((k+1)θ)+cos⁡((k−1)θ)=2cos⁡θcos⁡(kθ) show by induction that Tk(cos⁡θ)=cos⁡(kθ) for all k≥0. Every x∈[−1,1] is cos⁡θ for some real θ, so ∣Tk(x)∣≤1.

1.2F1F2F3F4algebra

If τ≠0, the ratio of consecutive absolute terms in the defining series of Jk(τ) is ∣τ∣2/[4(j+1)(j+k+1)], which tends to zero, so the series converges absolutely; for τ=0 the series is immediate. For the integral Ik,j=∫01uj−1/2(1−u)k−1/2 du, splitting 1=u+(1−u) and integrating the derivative of uj+1/2(1−u)k+1/2 gives Ik,j+1/Ik,j=(j+1/2)/(j+k+1). Iterating yields Ik,j/Ik,0=(2j)!k!/[4jj!(j+k)!]. Expanding eiτt uniformly on [−1,1], substituting u=t2, and using this moment ratio gives Jk(τ)=(τ/2)kk!Ik,0∫−11eiτt(1−t2)k−1/2 dt. The weight is nonnegative and its normalized integral is one; [F4] therefore gives ∣Jk(τ)∣≤(∣τ∣/2)k/k!.

1.3F1F7givenalgebra

Put L=ln⁡(1/ϵ)>0, τ0=∣τ∣>ϵ, and S=τ0+L/ln⁡(e+L/τ0). If τ0≥1/4, then S≥1/4. If τ0<1/4, put u=1/τ0>4, so L>ln⁡u. The function g(y)=y/ln⁡(e+uy) is increasing for y>0, since its derivative has numerator ln⁡(e+uy)−uy/(e+uy)>0; the first term exceeds 1 and the second is below 1. Also ln⁡u≤u/2 for u≥4 (the difference has positive derivative and is positive at 4), and e≤u2/2, so e+uln⁡u≤u2. Therefore S≥g(L)>g(ln⁡u)≥1/2. In all cases S≥1/4. Set m=⌈64S⌉; then m≥16, m≥64τ0, and d=m−1≥max⁡(1,⌈τ0⌉), so this is an eligible candidate in the OP4 loop starting rule [F7]. The real parameter τ is defined in [F1].

2.1F1F2F3F4F6step 1.1algebra

For x=cos⁡θ, [F6] writes e−iτx as the product of the absolutely convergent exponential series for e−iτeiθ/2 and e−iτe−iθ/2. Absolute convergence permits grouping terms by the exponent difference k; for each k≥0 the coefficient of eikθ is (−i)kJk(τ), and the coefficient of e−ikθ is the same. Pairing these terms and using [F1] gives e−iτx=J0(τ)+2∑k≥1(−i)kJk(τ)Tk(x). By [F1], [F3], [F4], and [F6], the defining product is absolutely and uniformly convergent in θ on bounded intervals, so the regrouping is valid.

3.1F1step 1.1step 1.2step 2.1algebra

Subtracting the degree-d partial sum in step 2.1, applying the triangle inequality, and using ∣Tk(x)∣≤1 from step 1.1 gives error at most 2∑k>d∣Jk(τ)∣. With m=d+1, the ratio of consecutive factorial majorants (∣τ∣/2)k/k! for k≥m is at most u=∣τ∣/(2(m+1))<1. The geometric-series bound from step 1.2 now yields the stated factorial tail.

4.1F1F7step 3.1algebra

By [F7], each of the d+1 OP4 coefficient errors is at most ρ/(32(d+1)). Since a nonconstant Chebyshev term has coefficient multiplier 2, their total uniform contribution is at most (1+2d)ρ/(32(d+1))<ρ/16; adding the tail ρ/8 from step 3.1 gives a combined error <ρ. The coefficients and multiplier 2 are those of the expansion in [F1].

4.2F1F7givenstep 3.1algebra

Let r=L/τ0. If r≥1, then m≥64τ0(1+r/ln⁡(e+r)). Since ln⁡y≤y for y≥1 and r/(e+r)≥1/(e+1), we have r/ln⁡(e+r)≥e+r/(e+1). Thus 2m/(eτ0)≥[128/(e(e+1))]e+r>e+r, because e<3 gives 128/(e(e+1))>128/12>1; hence ln⁡(2m/(eτ0))≥12ln⁡(e+r). If r<1, m≥64τ0 gives 2m/(eτ0)≥128/e, hence ln⁡(2m/(eτ0))>1, since e<3 implies 128/e>42>e. For r≥1, these bounds give mln⁡(2m/(eτ0))≥32τ0(ln⁡(e+r)+r)≥32(L+τ0), because ln⁡(e+r)>1. For r<1, they give mln⁡(2m/(eτ0))>64τ0>32(L+τ0), because L<τ0. Also um=τ0/[2(m+1)]≤1/128, so 2/(1−um)≤256/127<4, and the factorial tail expression is bounded by the estimate of step 3.1. The real τ is defined in [F1]. ln⁡(m!)=∑j=1mln⁡j≥∫1mln⁡x dx≥mln⁡m−m, so m!≥(m/e)m. The factorial-tail test at d=m−1 is consequently at most 2(τ0/2)mm!(1−um)≤4exp⁡ ⁣(−mln⁡2meτ0)≤4e−32(L+τ0)≤e−2L/80000=ρ/8. The last inequality holds because L+τ0>1: for 0<ϵ<1, the function ln⁡(1/ϵ)−(1−ϵ) is positive (its derivative is (ϵ−1)/ϵ<0 as ϵ increases to 1, and its value at 1 is zero), and τ0>ϵ. Hence 30(L+τ0)>30>ln⁡(320000); the numerical comparison follows from e>2, which gives e30>230>320000. Since m≤64S+1≤68S using S≥1/4, the passing degree d=m−1 is O(S). The factorial tail is the estimate of step 3.1 and the OP4 threshold is [F7].

5.1F4F5F8givenalgebra∎

If τ0≤ϵ, the derivative fact [F5] and ∣e−isx∣=1 from [F4] give e−iτx−1=∫0τ−ixe−isx ds,∣e−iτx−1∣≤∣τx∣≤ϵ for every x∈[−1,1]. Thus the wrapper [F8] has the stated small-time error, including τ=0.

Depends on

Used by

Dependency tree · two levels

46 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