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 , the truncated logarithm , its coefficient fields and the truncations
Definition
Let , let be analytic splitting data (Analytic splitting data with uniform holomorphic neighbourhood, and the exact symmetric splitting map ), let be the constant of The difference operator loses a controlled domain margin and is bounded by , and fix the notation , , and for of that lemma. Throughout, is an integer, , and all functions are read on the domain unless stated otherwise.
Binomial coefficients. For and define
the empty product being , and the factorial of The factorial and the falling factorial , defined by recursion in embedded in ; thus , is a polynomial in of degree with rational coefficients, agrees with the number of -element subsets of an -element set for integers (and equals when ), and
Difference operator and pullbacks. For holomorphic on put , a holomorphic function on by The difference operator loses a controlled domain margin and is bounded by ; for let be the -fold iterate, holomorphic on , with . For let be the partial -fold composite of , defined only where every intermediate composition exists (so ).
Truncated binomial family. For , holomorphic on and define
a finite sum of functions each holomorphic on : it is a holomorphic function on , and for fixed and the map is a polynomial of degree at most with values in the holomorphic functions on .
Truncated logarithm and coefficient fields. The truncated logarithm is
that is, ; it is holomorphic on . For and each coordinate function (), the function is holomorphic on and vanishes at (each is ), so the quotient has a removable singularity at and a well-defined Taylor coefficient of ; define the -th coefficient field by
the coefficient being extracted by Cauchy's formula in the one variable (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 is
a holomorphic map for every .
Remarks
- The definitions are coordinate-wise and choice-free; the coefficient extraction in is the only analytic operation, and it is justified by the one-variable holomorphy in supplied by The difference operator loses a controlled domain margin and is bounded by and Hamiltonian flows and the exact splitting map preserve the complexified canonical form and the Poisson bracket.
- The following facts are not part of the definition and are proved on this page: for integers one has on (The binomial family of the splitting pullback is multiplicative and bracket-preserving, and its logarithm is a derivation); the fields are independent of the truncation order in the sense that the coefficient of in coincides with that in on for (Bounds for the truncated logarithm: and ); each is a holomorphic vector field and a symplectic one (Each coefficient field of the modified logarithm is a holomorphic symplectic field with a global holomorphic primitive on the star-shaped domain, and ); and .
Depends on
Analytic splitting data with uniform holomorphic neighbourhood, and the exact symmetric splitting map
The difference operator loses a controlled domain margin and is bounded by
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
Complex phase domains, holomorphic maps on , and the complexified canonical form and bracket
The factorial and the falling factorial , defined by recursion in
The chain rule for total derivatives:
The total (Fréchet) derivative as the linear first-order approximation with remainder
Directional derivatives and partial derivatives of a map
Rectangular matrix multiplication and the identity matrix , including zero-sized shapes
Dependency tree · 2 levels
Sources
- E. Hairer, Geometric Numerical Integration (TU Munchen 2010), Lecture 3 'Backward error analysis', Section 1: the formal modified equation as the logarithm of the one-step map, printed pages 1-3
- J. Lebl, Tasty Bits of Several Complex Variables, Chapter 1, Section 1.2: power series and coefficient extraction in one variable, printed pages 18-23