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 be fixed finite-dimensional self-adjoint matrices, , and let . The recursive formulas of Finite higher-order Suzuki product formula have the same Taylor coefficients as through degree at . They are symmetric: for all real .
Facts & Assumptions
Given: Finite-dimensional self-adjoint terms , , and the recursive formulas .
In this proof, means there are constants with whenever .
Repeatedly differentiating from [F3] gives for every . 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.
Symmetric second-order product formula gives the palindromic base product .
Finite higher-order Suzuki product formula defines and the five-copy recursion with coefficients .
Unitary and differential identities for finite matrix dynamics gives the unitary, differentiability, and time-composition identities for each finite self-adjoint term.
Finite Hermitian matrix dynamics defines by the finite spectral functional calculus.
Term-list Hamiltonian access permits signed exact time codes built from rational numbers and the positive roots used in the Suzuki coefficients.
Existence and uniqueness of -th roots: a unique with gives the unique nonnegative real -th root of for every integer .
Monotonicity of and of states that is increasing on the nonnegative reals and that for .
Proof
Put and . The base word is palindromic by [F1], so [F3] gives ; the same identity holds for by [F3] and [F4]. Its derivative at zero is , because the two half-time occurrences of every outer sum to one full occurrence, while the middle term occurs once. Also . By [L2], for some matrix . The inverse identities imply ; comparing degree-two terms gives , hence . Thus , proving the base order-two claim as well as the symmetry base case.
Fix and assume as the induction hypothesis [ih] that and that agrees with through degree . Put , , and . By [L2] and Taylor's theorem, . By [F6], the unique nonnegative root with exists; it is positive because zero has zero -th power. Since , [F7] gives : otherwise , contradicting . Thus and . The five scaled copies in [F2] have leading error coefficients . Their other factors equal , so multiplying an error term by those factors changes it only by . The ideal factors equal by [F3]. The coefficient 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 in is . Since and , , so this coefficient vanishes and the difference is .
Let and . The recursive word is . The induction hypothesis in step 1.2 gives inverse symmetry for and ; reversing the five factors shows . Also . By step 1.2 and [L2], write . The inverse identity gives , hence and the difference is . Therefore agrees with through degree and has inverse symmetry. Together with the base case in step 1.1, induction proves both claims for every finite .
Depends on
- Finite higher-order Suzuki product formula
- Symmetric second-order product formula
- Term-list Hamiltonian access
- Finite Hermitian matrix dynamics
- Unitary and differential identities for finite matrix dynamics
- Existence and uniqueness of $n$-th roots: a unique $a^{1/n} \ge 0$ with $(a^{1/n})^n = a$
- Monotonicity of $x \mapsto x^n$ and of $n \mapsto a^n$
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
- Andrew M. Childs, Lecture Notes on Quantum Algorithms (standard reference, not scraped)
- Ronald de Wolf, Quantum Computing: Lecture Notes (standard reference, not scraped)