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.

The difference operator Δh=Ψh∗−id loses a controlled domain margin and is bounded by CdM∣h∣/b

Statement

Let d≥1 and let (U,Uρ,A~,B~,M,K,δ,Ψh) be analytic splitting data as in Analytic splitting data with uniform holomorphic neighbourhood, and the exact symmetric splitting map Ψh, with complexified form and bracket as in Complex phase domains, holomorphic maps on Cm, and the complexified canonical form and bracket. For r>0 put D(r):={ζ∈C2d:dist⁡(ζ,U‾)<r}.

There is a constant C0=C0(d)≥1 such that for every integer N≥2, with

b:=ρ8N,rN:=ρC0MN,q:=CdM∣h∣b,

the following holds for every complex h with 0<∣h∣≤rN. Write Dk:=D(ρ/2−2bk) for 0≤k≤N; then D0=D(ρ/2), DN=D(ρ/4)⊇K, and DN⊆Dk⊆D0 for k≤N. Define the difference operator

Δhf:=f∘Ψh−f

for functions f holomorphic on Dk−1, where the composition is read on Dk. Then:

  1. Domain control. For every k=1,…,N the map Ψh is holomorphic on Dk, maps Dk into Dk−1, and satisfies ∥Ψh(Z)−Z∥≤2M∣h∣≤b for all Z∈Dk.
  2. Single-step bound. If f is holomorphic on Dk−1 with ∣f∣≤F there, then Δhf is holomorphic on Dk and ∣Δhf(Z)∣≤CdM∣h∣b F(Z∈Dk), with Cd:=4d2.
  3. Iterates. Taking C0:=max⁡{16, 128d2} one has q≤1/4 for ∣h∣≤rN, and for every f holomorphic on D0 and every 1≤k≤N, the iterate Δhkf is holomorphic on Dk and ∣Δhkf(Z)∣≤qk ∣f∣D0(Z∈Dk).

Facts & Assumptions

Given: The analytic splitting data; N≥2, b=ρ/(8N), the domains Dk; the constant Cd of clause 2 (to be produced in the proof).

[F1]

Geometric facts about the distance domains (Complex phase domains, holomorphic maps on Cm, and the complexified canonical form and bracket): dist⁡(⋅,U‾) is 1-Lipschitz, so ζ∈D(r) implies B(ζ,t)⊆D(r+t) for every t>0, and D(r)⊆D(r′) for r≤r′. Every Z∈K⊆U has dist⁡(Z,U‾)=0, so K⊆DN.

[F2]

Flow displacement: by The flow of a bounded holomorphic field on a polydisc: existence in complex time, displacement bound, holomorphy, and the composition law clause 1, each of the three flows in Ψh=φA~h/2∘φB~h∘φA~h/2 displaces its argument by at most M times the modulus of its time parameter, provided the argument lies in the appropriate polydisc of radius s with ∣t∣≤s/(8⋅2d⋅M); consequently, on the domains used below, ∥Ψh(Z)−Z∥≤(1/2+1+1/2)M∣h∣=2M∣h∣. The composition is holomorphic by Hamiltonian flows and the exact splitting map preserve the complexified canonical form and the Poisson bracket and Calculus of holomorphic maps: chain rule, Wirtinger derivatives, coefficient extraction in one variable, and locally uniform limits clause 1.

[F3]

Cauchy derivative estimates on a polydisc (Iterated Cauchy formula, power-series expansion and Cauchy estimates for functions continuous and separately holomorphic on a polydisc clause 3): if g is continuous and separately holomorphic on Δρ(a), then for 0<sk<ρk, ∣∂zkg(a)∣≤M(s)/sk with M(s):=sup⁡Γs(a)∣g∣; a function holomorphic on an open set is continuous and separately holomorphic there.

[F4]

The mean value estimate on a segment: if g is totally differentiable on the segment [Z,ξ] and ∣∂zkg∣≤A on it for every k, then ∣g(ξ)−g(Z)∣≤∑kA∣ξk−Zk∣≤2d A∥ξ−Z∥; this follows by applying the one-variable mean value estimate to the real coordinate functions along the segment (The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a), The total (Fréchet) derivative Df(a) as the linear first-order approximation with o(∥h∥2) remainder, Directional derivatives and partial derivatives of a map U⊆Rm→Rn).

[F5]

Holomorphy of the pullback and of differences: f∘Ψh is holomorphic on Dk by the chain rule of Calculus of holomorphic maps: chain rule, Wirtinger derivatives, coefficient extraction in one variable, and locally uniform limits clause 1, so Δhf is holomorphic there (Complex phase domains, holomorphic maps on Cm, and the complexified canonical form and bracket).

Proof

technique · direct; verify the margin bookkeeping, bound the increment by Cauchy estimates on slices of the segment, and iterate
1.1givenF1F2algebra

Margin bookkeeping. Fix N≥2, k≤N and Z∈Dk. Since C0≥128d2, ∣h∣≤rN implies both 2M∣h∣≤b and ∣h∣≤ρ/(64d2dM). Construct the three factors sequentially using polydiscs of radius s=ρ/(42d) centred at their initial points. The first centre is Z. The first flow exists by [F2] and displaces it by at most M∣h∣/2; the second centre is therefore within that distance of Z. Inductively, the second flow displaces its own initial point by at most M∣h∣, and the last by at most M∣h∣/2. Thus every intermediate centre and every point along a subflow, with its time parameter running along the segment from zero to that factor's time, lies within the accumulated bound 2M∣h∣≤b of Z. At each centre the polydisc has Euclidean radius ρ/4, so its distance to U‾ is less than ρ/2+b+ρ/4≤13ρ/16<ρ; it lies in Uρ. The flow lemma permits each subtime because s/(8⋅2dM)=ρ/(64d2dM). This induction establishes existence and the intermediate bounds without using cancellation in the final displacement. Set ξ=Ψh(Z); the triangle inequality gives ∥ξ−Z∥≤2M∣h∣≤b. By [F1], dist⁡(ξ,U‾)<ρ/2−2bk+b=ρ/2−2b(k−1)−b, so ξ∈Dk−1. The same strict bound holds along the straight segment [Z,ξ], since every such point is within b of Z. Consequently the polydisc of radius b/2d about each point of that segment, including its distinguished boundary, lies in Dk−1. Composition holomorphy follows from [F2]. This proves clause 1 with the stated constants and margins.

2.1givenstep 1.1F3F4F5algebra

Single-step bound. Let f be holomorphic on Dk−1 with ∣f∣≤F. For Z∈Dk, ξ=Ψh(Z) and ζ on the segment, [F3] applied at ζ with the polyradius (b/2d)1, whose distinguished boundary lies in Dk−1 by step 1.1, gives ∣∂zkf(ζ)∣≤2d F/b for every k. Hence by [F4], ∣f(ξ)−f(Z)∣≤2d⋅2d⋅Fb⋅∥ξ−Z∥≤2d Fb⋅2M∣h∣, and Δhf is holomorphic on Dk by [F5]. This is clause 2 with Cd:=4d2, which depends only on d.

3.1givenstep 1.1step 2.1algebra

Iteration. By induction on k: suppose Δhk−1f is holomorphic on Dk−1 with ∣Δhk−1f∣≤qk−1∣f∣D0 (true for k=1), then step 1.1 shows Ψh(Dk)⊆Dk−1, so Δhkf=Δh(Δhk−1f) is defined and holomorphic on Dk by clause 2, with bound q⋅qk−1∣f∣D0=qk∣f∣D0.

4.1givenstep 3.1algebra

The factor q. With C0≥16 the constraint ∣h∣≤rN implies 2M∣h∣≤ρ/(8N)=b and, with the constant Cd=4d2 of step 2.1, q=4d2M∣h∣b≤4d2MρC0MN⋅8Nρ=32d2C0≤14, because C0≥128d2=32Cd. This proves clause 3 with q≤1/4.

5.1step 1.1step 2.1step 3.1step 4.1∎

Conclusion. Clause 1 is step 1.1, clause 2 is step 2.1, clause 3 is steps 3.1 and 4.1; all constants depend only on d, M, ρ.

Remarks

  • The loss of margin is exactly 2b=ρ/(4N) per application: N applications consume ρ/4 of the available ρ/2, and the surviving domain D(ρ/4) still contains K. The choices b=ρ/(8N) and rN=ρ/(C0MN) are conventions fixed once and for all on this page; every later item refers to them.
  • The constant q≤1/4 is not used beyond the geometric summations; optimising it is irrelevant. No choice principle is used.

Depends on

Dependency tree · 2 levels

Sources