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.
Symmetry of the splitting map forces for every even , so the first possible modified-energy correction is of order
Statement
Let , let be analytic splitting data (Analytic splitting data with uniform holomorphic neighbourhood, and the exact symmetric splitting map ), and use the notation of The truncated binomial family , the truncated logarithm , its coefficient fields and the truncations and Each coefficient field of the modified logarithm is a holomorphic symplectic field with a global holomorphic primitive on the star-shaped domain, and : the coefficient fields (, with acting on holomorphic functions as the coefficient operator , and in the notation of that lemma) and the normalized primitives with , , on the domains .
- Reversibility. For the local flow germs at , and their mutually reverse continuation branches wherever defined, .
- Parity. for every even .
- Modified energy. Consequently . For define the finite complex modified Hamiltonian on by Then on , so the first possible correction is of order . For real , on the real part of , restricts to the corresponding real function with baseline .
Facts & Assumptions
Given: The analytic splitting data and the objects named in the Statement; for every holomorphic on the two families read as formal power series in whose -degree- coefficients are finite sums (because ); the concrete truncations , of The truncated binomial family , the truncated logarithm , its coefficient fields and the truncations agree with them through order .
Inverse and composition laws: , and where the inverses exist (The flow of a bounded holomorphic field on a polydisc: existence in complex time, displacement bound, holomorphy, and the composition law clause 3, Calculus of holomorphic maps: chain rule, Wirtinger derivatives, coefficient extraction in one variable, and locally uniform limits).
Integer case: for every integer , as formal series in (the sum is finite at each -degree and equals the finite binomial sum of The binomial family of the splitting pullback is multiplicative and bracket-preserving, and its logarithm is a derivation clause 1 for any truncation order ). Consequently is well defined for all and all holomorphic on .
Formal identities in one element. Let be an element of the ring of formal series in with operator coefficients, with . Define and , both well defined coefficient-wise because and . Then: (i) and , because all powers of commute and the identity holds in the commutative -algebra ; (ii) , because both sides are universal rational-coefficient expressions in the single element and the identity holds in the commutative ring (differentiate and use coefficient-wise); (iii) hence is injective on : if then .
Formal binomial group law. For , the falling-factorial recurrence gives and . Comparing coefficients determines the series uniquely. Thus satisfies the same equation as and the same constant term, so . Differentiate in at zero: , by the derivative formula for at zero. Substituting the single operator makes all sums finite at any fixed -degree and gives , with (The factorial and the falling factorial , defined by recursion in , The binomial family of the splitting pullback is multiplicative and bracket-preserving, and its logarithm is a derivation).
Uniqueness of formal solutions: if and are families whose -degree- coefficients are polynomials in with , and , then : comparing coefficients of determines each coefficient recursively from the preceding one, since acts coefficient-wise in .
Primitives and domains (Each coefficient field of the modified logarithm is a holomorphic symplectic field with a global holomorphic primitive on the star-shaped domain, and ): , , connected with ; and as operators on holomorphic functions, with the bounds of Bounds for the truncated logarithm: and .
Proof
Reversibility. Use the local flow germs, or continue each inverse factor along the reverse of the branch of its forward factor, as required by [L1]. For in their common domain, by [L1]. This is clause 1.
The exponential of the logarithm. By [L4] the family solves the formal initial value problem of [L5] with initial value ; the family -exponential solves the same problem, because by commutation of with . By [L5], as formal series in ; taking and using [L2] with ,
Parity of the logarithm. Fix an integer . By clause 1 and [L2], ; by step 1.2 applied to the data at step this equals . The same expression, read with the data at step , equals by [L3]. Hence as formal series in , for every integer . At fixed -degree both sides are polynomials in (all defining operations are polynomial at each degree), so the equality at all extends to all complex ; taking gives for every holomorphic on , and injectivity of from [L3] gives
Vanishing of the even coefficients. Write (so ). Then and ; comparing -degree- coefficients in the identity of step 2.1 gives , hence for even . Since acts as by [L6], for every even . This is clause 2.
Modified energy. For , gives , so ; since is connected and , by [L6]. The definition of in clause 3 therefore gives on , and, for real , its restriction to the real part of is real-valued: the baseline and each normalized primitive are real there by the primitive supplier. On the baseline is . No nonzero is asserted; for example, an exact one-part splitting can have every correction zero. This is clause 3.
Remarks
- The whole argument is formal in the step variable: only finitely many terms contribute to each -degree, and no convergence of the infinite logarithmic series is used. The concrete truncated functions of The truncated binomial family , the truncated logarithm , its coefficient fields and the truncations have coefficients agreeing with through order , by Bounds for the truncated logarithm: and clause 4.
- Parity is a property of the symmetric Strang-type splitting: it uses and fails for the asymmetric first-order splittings . No such claim is made for them.
Depends on
The truncated binomial family , the truncated logarithm , its coefficient fields and the truncations
The binomial family of the splitting pullback is multiplicative and bracket-preserving, and its logarithm is a derivation
Bounds for the truncated logarithm: and
Each coefficient field of the modified logarithm is a holomorphic symplectic field with a global holomorphic primitive on the star-shaped domain, and
The flow of a bounded holomorphic field on a polydisc: existence in complex time, displacement bound, holomorphy, and the composition law
Hamiltonian flows and the exact splitting map preserve the complexified canonical form and the Poisson bracket
Calculus of holomorphic maps: chain rule, Wirtinger derivatives, coefficient extraction in one variable, and locally uniform limits
Analytic splitting data with uniform holomorphic neighbourhood, and the exact symmetric splitting map
Complex phase domains, holomorphic maps on , and the complexified canonical form and bracket
The factorial and the falling factorial , defined by recursion in
Dependency tree · 2 levels
Sources
- E. Hairer, Geometric Numerical Integration (TU Munchen 2010), Lecture 3 'Backward error analysis', Sections 2-3: for symmetric methods the modified equation contains only even powers of the step size, printed pages 5-7
- E. Hairer, Geometric Numerical Integration (TU Munchen 2010), Lecture 2 'Symplectic integrators', Theorem 7 and Section 4: adjoint methods, symmetric methods and even order, printed pages 7-12