Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-generatedPipeline-generatedjudge pass (gpt-6-luna)
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.

Suzuki recursive cancellation of error terms

Statement

Let H1,…,Hm be fixed finite-dimensional self-adjoint matrices, m≥1, and let U(h)=e−ih∑jHj. The recursive formulas S2k of Finite higher-order Suzuki product formula have the same Taylor coefficients as U(h) through degree 2k at h=0. They are symmetric: S2k(−h)=S2k(h)−1 for all real h.

Facts & Assumptions

Given: Finite-dimensional self-adjoint terms H1,…,Hm, m≥1, and the recursive formulas S2k.

[L1]

In this proof, R(h)=O(ha) means there are constants C,δ>0 with ∥R(h)∥≤C∣h∣a whenever ∣h∣<δ.

[L2]

Repeatedly differentiating UK′(h)=−iKUK(h) from [F3] gives UK(n)(h)=(−iK)nUK(h) for every n≥0. The product rule gives continuous derivatives of every order for each finite formula word, so Taylor expansions below hold with operator-norm remainders to every stated finite order.

[F1]

Symmetric second-order product formula gives the palindromic base product S2(h).

[F2]

Finite higher-order Suzuki product formula defines pj=(4−41/(2j−1))−1 and the five-copy recursion with coefficients pj,pj,1−4pj,pj,pj.

[F3]

Unitary and differential identities for finite matrix dynamics gives the unitary, differentiability, and time-composition identities for each finite self-adjoint term.

[F4]

Finite Hermitian matrix dynamics defines UK(h) by the finite spectral functional calculus.

[F5]

Term-list Hamiltonian access permits signed exact time codes built from rational numbers and the positive roots used in the Suzuki coefficients.

[F6]

Existence and uniqueness of n-th roots: a unique a1/n≥0 with (a1/n)n=a gives the unique nonnegative real q-th root of 4 for every integer q≥1.

[F7]

Monotonicity of x↦xn and of n↦an states that x↦xq is increasing on the nonnegative reals and that 4q>4 for q>1.

Proof

1.1givenF1F3F4L1L2algebrabase

Put Aj=−iHj and A=∑jAj. The base word S2(h) is palindromic by [F1], so [F3] gives S2(−h)=S2(h)−1; the same identity holds for U(h) by [F3] and [F4]. Its derivative at zero is A, because the two half-time occurrences of every outer Aj sum to one full occurrence, while the middle term occurs once. Also U(0)=S2(0)=I. By [L2], E(h)=S2(h)−U(h)=Ch2+O(h3) for some matrix C. The inverse identities imply E(−h)=−S2(h)−1E(h)U(h)−1; comparing degree-two terms gives C=−C, hence C=0. Thus E(h)=O(h3), proving the base order-two claim as well as the symmetry base case.

1.2ihF2F3F5F6F7L1L2algebra

Fix j≥2 and assume as the induction hypothesis [ih] that S2j−2(−h)=S2j−2(h)−1 and that S2j−2 agrees with U through degree 2j−2. Put q=2j−1, p=pj, and c=1−4p. By [L2] and Taylor's theorem, S2j−2(h)−U(h)=Ehq+O(hq+1). By [F6], the unique nonnegative root ρq with ρqq=4 exists; it is positive because zero has zero q-th power. Since q≥3, [F7] gives ρq<4: otherwise ρqq≥4q>4, contradicting ρqq=4. Thus p=(4−ρq)−1>1/4 and c=1−4p=−ρqp<0. The five scaled copies in [F2] have leading error coefficients pqE,pqE,cqE,pqE,pqE. Their other factors equal I+O(h), so multiplying an error term by those factors changes it only by O(hq+1). The ideal factors U(ph)2U(ch)U(ph)2 equal U((4p+c)h)=U(h) by [F3]. The coefficient c is an expression in the rational and positive-root tokens of [F5], so the signed call has a finite exact code. Hence the coefficient of hq in S2j(h)−U(h) is (4pq+cq)E. Since c=−ρqp and ρqq=4, cq=−4pq, so this coefficient vanishes and the difference is O(hq+1)=O(h2j).

2.1step 1.1step 1.2F2F3L1L2algebradischarge-induction∎

Let A(h)=S2j−2(ph) and B(h)=S2j−2(ch). The recursive word is A(h)A(h)B(h)A(h)A(h). The induction hypothesis in step 1.2 gives inverse symmetry for A and B; reversing the five factors shows S2j(−h)=S2j(h)−1. Also U(−h)=U(h)−1. By step 1.2 and [L2], write S2j(h)−U(h)=Dh2j+O(h2j+1). The inverse identity gives Dh2j=−Dh2j+O(h2j+1), hence D=0 and the difference is O(h2j+1). Therefore S2j agrees with U through degree 2j and has inverse symmetry. Together with the base case in step 1.1, induction proves both claims for every finite k.

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