Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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 truncated binomial family Ths,N, the truncated logarithm LN(h), its coefficient fields Xj and the truncations X[N]

Definition

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), let C0=C0(d) be the constant of The difference operator Δh=Ψh∗−id loses a controlled domain margin and is bounded by CdM∣h∣/b, and fix the notation D(r), b=ρ/(8N), rN=ρ/(C0MN) and Dk=D(ρ/2−2bk) for 0≤k≤N of that lemma. Throughout, N≥2 is an integer, ∣h∣≤rN, and all functions are read on the domain DN unless stated otherwise.

Binomial coefficients. For s∈C and k∈N define

(sk):=∏i=0k−1(s−i)k!,

the empty product being 1, and k! the factorial of The factorial n! and the falling factorial nk‾, defined by recursion in N embedded in C; thus (s0)=1, (sk) is a polynomial in s of degree k with rational coefficients, (mk) agrees with the number of k-element subsets of an m-element set for integers m≥0 (and equals 0 when k>m), and

dds(sk)∣s=0=(−1)k+1k(k≥1),dds(s0)∣s=0=0.

Difference operator and pullbacks. For f holomorphic on D0 put Δhf:=f∘Ψh−f, a holomorphic function on D1 by The difference operator Δh=Ψh∗−id loses a controlled domain margin and is bounded by CdM∣h∣/b; for 0≤k≤N let Δhkf be the k-fold iterate, holomorphic on Dk, with Δh0f:=f. For m∈N let Ψhm be the partial m-fold composite of Ψh, defined only where every intermediate composition exists (so Ψh0=id).

Truncated binomial family. For s∈C, f holomorphic on D0 and Z∈DN define

Ths,Nf:=∑k=0N(sk) Δhkf,

a finite sum of functions each holomorphic on Dk⊇DN: it is a holomorphic function on DN, and for fixed h and f the map s↦Ths,Nf is a polynomial of degree at most N with values in the holomorphic functions on DN.

Truncated logarithm and coefficient fields. The truncated logarithm is

LN(h)f:=∑k=1N(−1)k+1k Δhkf=Ths,Nf∣s=0 differentiated in s,

that is, LN(h)f=dds(Ths,Nf)∣s=0; it is holomorphic on DN. For 1≤j≤N and each coordinate function zi (i=1,…,2d), the function h↦(LN(h)zi)(Z) is holomorphic on {∣h∣≤rN} and vanishes at h=0 (each Δhkzi is O(hk)), so the quotient (LN(h)zi)(Z)/h has a removable singularity at h=0 and a well-defined Taylor coefficient of hj−1; define the j-th coefficient field Xj:DN→C2d by

(Xj)i(Z):=[hj−1](LN(h)zi)(Z)h(Z∈DN, i=1,…,2d),

the coefficient being extracted by Cauchy's formula in the one variable h (Calculus of holomorphic maps: chain rule, Wirtinger derivatives, coefficient extraction in one variable, and locally uniform limits clause 3). Finally the truncation of the modified field at order N is

X[N](h):=∑j=1Nhj−1Xj,

a holomorphic map DN→C2d for every ∣h∣≤rN.

Remarks

Depends on

Dependency tree · 2 levels

Sources