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.
Rooted-tree series and the inverse of u exp(-u)
Statement
Let and . These series converge absolutely for . On that disk they satisfy , , and . Consequently . For real , is the unique satisfying .
Facts & Assumptions
Given: Formal series are multiplied by coefficient convolution, and the Lagrange–Bürmann formula applies to the unique formal solution of over a field containing .
Lagrange–Bürmann inversion extracts coefficients of a compositional inverse and of functions of it: if and , then for every .
Formal differentiation is linear and satisfies product, power, quotient, chain, and coefficient-recovery laws: formal differentiation obeys the product rule and the chain rule for admissible compositions with summable differentiated families; composition with a series of zero constant coefficient is locally finite.
A formal power series is a unit exactly when its constant coefficient is a unit: a formal power series with nonzero constant coefficient over a field is invertible.
For every real , : .
Convergent power series differentiate term by term inside their radius: for real coefficients and real arguments, if a power series and its formal derivative series converge absolutely at every smaller radius, the sum differentiates termwise inside the radius.
Proof
Apply [F1] with and . It gives , and the defining equation for the compositional inverse gives as a formal identity.
Differentiate formally using [F2]. Since , the series is a unit by [F3], and rearrangement yields . Therefore , so .
For , the ratio is by [F4]. The coefficients of are , so their ratios have the same limit; the derivative-series ratios are and , respectively. For every , all four series are therefore bounded in their tails on by convergent geometric series. In particular, [F5] gives termwise differentiation for real arguments.
For either coefficient sequence or , fix complex and real with . For complex , the identity bounds the difference-quotient tail after degree by , uniformly in . The derivative-series tail has the same bound, tending to zero by step 3.1. The finite polynomial head differentiates for complex increments, so taking its limit and then letting proves complex termwise differentiation. Products may be regrouped absolutely, and the expansion of is absolutely dominated by . Thus the formal identities in steps 1.1 and 2.1 give , , and for the sums. The middle identity rules out , and hence gives .
For real , the coefficients of are nonnegative, so . If , continuity and give with , but step 4.1 implies , a contradiction. Thus . Since is strictly increasing on , step 4.1 identifies with its unique inverse-branch value.
Depends on
- Lagrange–Bürmann inversion extracts coefficients of a compositional inverse and of functions of it
- Formal differentiation is linear and satisfies product, power, quotient, chain, and coefficient-recovery laws
- A formal power series is a unit exactly when its constant coefficient is a unit
- For every real $x$, $(1+x/n)^n\to\exp x$
- Convergent power series differentiate term by term inside their radius
Used by
Dependency tree · two levels
21 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Philippe Laurençot, Weak compactness techniques and coagulation equations, §§1 and 3.3 (standard reference, not scraped)