Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck pass
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 Xj=0 for every even j, so the first possible modified-energy correction is of order h2

Statement

Let d≥1, let (U,Uρ,A~,B~,M,K,δ,Ψh) be analytic splitting data (Analytic splitting data with uniform holomorphic neighbourhood, and the exact symmetric splitting map Ψh), and use the notation of The truncated binomial family Ths,N, the truncated logarithm LN(h), its coefficient fields Xj and the truncations X[N] and Each coefficient field Xj of the modified logarithm is a holomorphic symplectic field with a global holomorphic primitive Hj on the star-shaped domain, and X1=XA~+B~: the coefficient fields Xj (j≥1, with Xj acting on holomorphic functions as the coefficient operator Dj=[hj]L(h), and Xj=Dj in the notation of that lemma) and the normalized primitives Hj with dHj=ιXjωC, Hj(0)=0, on the domains Dj.

  1. Reversibility. For the local flow germs at h=0, and their mutually reverse continuation branches wherever defined, Ψ−h=Ψh−1.
  2. Parity. Xj=0 for every even j≥2.
  3. Modified energy. Consequently H2=0. For N≥2 define the finite complex modified Hamiltonian on DN by Hh:=H~+∑j=2Nhj−1Hj. Then Hh=H~+∑j=3Nhj−1Hj on DN, so the first possible correction is of order h2. For real h, on the real part of DN, Hh restricts to the corresponding real function with baseline H=A+B.

Facts & Assumptions

Given: The analytic splitting data and the objects named in the Statement; for every holomorphic f on D0 the two families Thsf:=∑k≥0(sk)Δhkf,L(h)f:=∑k≥1(−1)k+1kΔhkf, read as formal power series in h whose h-degree-j coefficients are finite sums (because Δh=O(h)); the concrete truncations Ths,N, LN(h) of The truncated binomial family Ths,N, the truncated logarithm LN(h), its coefficient fields Xj and the truncations X[N] agree with them through order N.

[L2]

Integer case: for every integer m≥0, Thmf=f∘Ψhm as formal series in h (the sum is finite at each h-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 ≥m). Consequently Thmf is well defined for all m≥0 and all holomorphic f on D0.

[L3]

Formal identities in one element. Let A be an element of the ring of formal series in h with operator coefficients, with A=O(h). Define exp⁡(A):=∑m≥0Am/m! and log⁡(1+U):=∑k≥1(−1)k+1Uk/k, both well defined coefficient-wise because A=O(h) and U=O(h). Then: (i) exp⁡(A)exp⁡(−A)=1 and exp⁡(−A)exp⁡(A)=1, because all powers of A commute and the identity holds in the commutative Q-algebra Q[A]; (ii) log⁡(exp⁡(A))=A, because both sides are universal rational-coefficient expressions in the single element A and the identity holds in the commutative ring Q⟦x⟧ (differentiate t↦log⁡(exp⁡(tx)) and use (log⁡)′(1+u)=(1+u)−1 coefficient-wise); (iii) hence exp⁡ is injective on {A:A=O(h)}: if exp⁡(A)=exp⁡(B) then A=log⁡(exp⁡(A))=log⁡(exp⁡(B))=B.

[L4]

Formal binomial group law. For Bs(x)=∑k≥0(sk)xk, the falling-factorial recurrence gives (1+x)∂xBs=sBs and Bs(0)=1. Comparing coefficients determines the series uniquely. Thus BsBt satisfies the same equation as Bs+t and the same constant term, so BsBt=Bs+t. Differentiate in t at zero: ∂sBs=Bs∑k≥1(−1)k+1xk/k, by the derivative formula for (tk) at zero. Substituting the single operator x=Δh=O(h) makes all sums finite at any fixed h-degree and gives ∂sThs=L(h)Ths, with Th0=id (The factorial n! and the falling factorial nk‾, defined by recursion in N, The binomial family of the splitting pullback is multiplicative and bracket-preserving, and its logarithm is a derivation).

[L5]

Uniqueness of formal solutions: if s↦F(s) and s↦G(s) are families whose h-degree-j coefficients are polynomials in s with F′(s)=L(h)F(s), G′(s)=L(h)G(s) and F(0)=G(0), then F=G: comparing coefficients of sn determines each coefficient recursively from the preceding one, since L(h) acts coefficient-wise in h.

Proof

technique · direct; identify $\Psi_{-h}$ with the inverse, use the formal exponential of the logarithm to compare $L(h)$ and $L(-h)$, and differentiate in the binomial parameter
1.1givenL1algebra

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 h in their common domain, Ψh−1=(φA~h/2∘φB~h∘φA~h/2)−1=φA~−h/2∘φB~−h∘φA~−h/2=Ψ−h by [L1]. This is clause 1.

1.2givenL2L4L5algebra

The exponential of the logarithm. By [L4] the family s↦Thsf solves the formal initial value problem of [L5] with initial value f; the family s↦log⁡-exponential exp⁡(sL(h))f solves the same problem, because ddsexp⁡(sL(h))=∑m≥1L(h)msm−1/(m−1)!=L(h)exp⁡(sL(h)) by commutation of L(h) with sL(h). By [L5], Thsf=exp⁡(sL(h))f as formal series in s; taking s=1 and using [L2] with m=1, Ψh∗f=f∘Ψh=Th1f=exp⁡(L(h))f.

2.1givenstep 1.2L2L3

Parity of the logarithm. Fix an integer m≥0. By clause 1 and [L2], T−hmf=f∘(Ψ−h)m=f∘(Ψh−1)m; by step 1.2 applied to the data at step −h this equals exp⁡(mL(−h))f. The same expression, read with the data at step h, equals (Ψh∗)−mf=exp⁡(L(h))−mf=exp⁡(−mL(h))f by [L3]. Hence exp⁡(mL(−h))f=exp⁡(m(−L(h)))f as formal series in h, for every integer m≥0. At fixed h-degree both sides are polynomials in m (all defining operations are polynomial at each degree), so the equality at all m≥0 extends to all complex m; taking m=1 gives exp⁡(L(−h))f=exp⁡(−L(h))f for every holomorphic f on D0, and injectivity of exp⁡ from [L3] gives L(−h)=−L(h).

3.1givenstep 2.1L6algebra

Vanishing of the even coefficients. Write L(h)=∑j≥0hjDj (so D0=0). Then L(−h)=∑j(−1)jhjDj and −L(h)=∑j−hjDj; comparing h-degree-j coefficients in the identity of step 2.1 gives (−1)jDj=−Dj, hence Dj=0 for even j. Since Xj acts as Dj by [L6], Xj=0 for every even j≥2. This is clause 2.

4.1givenstep 3.1L6∎

Modified energy. For j=2, X2=0 gives ιX2ωC=0, so dH2=0; since D2 is connected and H2(0)=0, H2=0 by [L6]. The definition of Hh in clause 3 therefore gives Hh=H~+∑j=3Nhj−1Hj on DN, and, for real h, its restriction to the real part of DN is real-valued: the baseline H~ and each normalized primitive Hj are real there by the primitive supplier. On U the baseline is H=A+B. No nonzero H3 is asserted; for example, an exact one-part splitting can have every correction zero. This is clause 3.

Remarks

Depends on

Dependency tree · 2 levels

Sources