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.

Optimal finite truncation gives an exponential local splitting defect

Statement

For analytic splitting data of Analytic splitting data with uniform holomorphic neighbourhood, and the exact symmetric splitting map Ψh, put m=2d, C0=max⁡{16,128d2}, C1=1024m2, C2=16eC0C1, a=ρ/(C2M) and c=alog⁡(2)/2>0. Here e=exp⁡(1) and log⁡ is the inverse of the real exponential on (0,∞) (The real exponential function and the number e by a power series, The natural logarithm as the inverse of the exponential function); positivity of c follows from strict increase of exp⁡ (The exponential function is strictly increasing). For 0<h≤a/3, set N=⌊a/h⌋≥2 and

Hh=H~+∑j=2Nhj−1Hj,X[N](h)=∑j=1Nhj−1Xj,

using the normalized primitives of 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 time-h flow φHhh exists for initial data in D(ρ/8), for sufficiently small h depending only on the displayed data. There is C<∞, independent of h,N, such that

∥Ψh(Z)−φHhh(Z)∥≤CMh e−c/h(Z∈D(ρ/8)).

The same result holds for the splitting with A,B interchanged. The series defining Hh is finite.

Facts & Assumptions

Given: The stated splitting data, constants and normalized coefficients, with D(r) the distance domains.

[F1]

Bounds for the truncated logarithm: ∣LN(h)zi/h∣≤8M/3 and ∣Xj∣≤(8M/3)(C0Mj/ρ)j−1 gives the component bounds ∣(Xj)i∣≤(8M/3)rN−(j−1) on D(ρ/4) for j≤N, with rN=ρ/(C0MN).

[F2]

The binomial family of the splitting pullback is multiplicative and bracket-preserving, and its logarithm is a derivation identifies the coefficient logarithm with vector fields; Symmetry of the splitting map forces Xj=0 for every even j, so the first possible modified-energy correction is of order h2 proves exp⁡L(h)=Ψh∗ coefficient-wise. The primitive lemma identifies X[N]=XHh.

Proof

1.1givenF1F3algebra

Uniform field and flow radius. Fix N and let u be a complex parameter with ∣u∣≤RN=rN/C1. By [F1], summing a geometric series gives ∥X[N](u)∥≤m(8M/3)/(1−C1−1)≤4mM=:B on D(ρ/4). At each Z∈D(ρ/8) the polydisc of radius s=ρ/(16m) lies in D(ρ/4). The flow radius s/(8mB)=ρ/(512m2M) is at least RN since N≥2 and C1=1024m2. Picard iteration is also holomorphic in u (each iterate is a holomorphic parameter integral and the contraction is uniform); hence the time-u map of the field X[N](u) is holomorphic in u for ∣u∣<RN. Its displacement is at most B∣u∣. The splitting displacement is at most 2M∣u∣. All estimates hold uniformly on the initial-data domain.

2.1givenF2F3step 1.1algebra

Finite coefficient matching. In degree at most N, uX[N](u) agrees with L(u) as operators by [F2]. Terms in the exponential of order above N cannot change these degrees because both operators start in degree one. The time-u pullback of a fixed field X[N](u) has Taylor coefficients ∑k≥0uk(X[N](u))k/k!: differentiating f(φt(Z)) repeatedly in t gives Xkf and the holomorphic Taylor expansion supplies the coefficients. Therefore the two analytic coordinate maps agree through degree N. This argument uses finite jets and makes no assertion that the infinite formal logarithm converges.

3.1givenF3step 1.1step 2.1algebra

Cauchy tail. For each coordinate the difference EN(u,Z) of the two maps divided by u extends holomorphically at zero, has its first N coefficients zero, and is bounded by 2M+B on ∣u∣<RN. Cauchy estimates on smaller circles, followed by taking their radii to RN, give ∣EN(h,Z)∣≤(2M+B)(h/RN)N/(1−h/RN) for 0<h<RN. The actual map difference is hEN(h,Z); multiplying its coordinate bound by m gives the Euclidean bound.

4.1step 3.1F4algebra∎

Optimal integer choice. For N=⌊a/h⌋, h/RN=C1C0MNh/ρ≤C1C0/C2=1/(16e)<1/2 by [F4]. Also N≥a/(2h) when h≤a/3. The logarithm definition and the exponential addition law give 2−N=exp⁡(−Nlog⁡2); therefore Nlog⁡2≥c/h implies 2−N≤exp⁡(−c/h) by monotonicity of exp⁡. Thus (h/RN)N≤2−N≤e−c/h. The denominator in step 3.1 is at least 1/2, yielding the asserted defect. Interchanging A,B leaves all bounds and formal arguments unchanged.

Depends on

Dependency tree · 2 levels

Sources