pith. sign in

arxiv: 2606.26133 · v2 · pith:A7J2SA5Znew · submitted 2026-06-18 · 🧮 math.GM

Fa\`a di Bruno is Taylor Composition

Heinrich Hartmann This is my paper

Pith reviewed 2026-06-29 04:56 UTC · model grok-4.3

classification 🧮 math.GM
keywords Faà di Bruno formulaTaylor polynomialsBanach spacesPeano remaindercomposition of mapshigher-order derivativesproduct rule
0
0 comments X

The pith

The Faà di Bruno formulas arise from composing reduced Taylor polynomials of maps between Banach spaces.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper establishes that for C^k maps between Banach spaces, the reduced Taylor polynomial of the composition equals the projection of the composition of the individual reduced Taylor polynomials. This identity is proved using an elementary estimate on the Peano remainder term, avoiding any use of partitions or combinatorial counting. Expanding the identity recovers the classical Faà di Bruno formulas, while polarization and coefficient extraction yield the multivariate and multi-index versions. The approach separates the functional properties of Taylor approximation from the bookkeeping involved in extracting explicit formulas. As a result, it also provides a general higher-order product rule.

Core claim

For C^k maps ϕ: E → F and ψ: F → G between Banach spaces, the reduced Taylor polynomial satisfies T^k_*(ψ ∘ ϕ; x) = π_≤k ( T^k_*(ψ; ϕ(x)) ∘ T^k_*(ϕ; x) ). The proof relies on an elementary estimate of the Peano remainder and does not invoke partitions or combinatorial enumeration. Expanding this composition identity recovers the classical Faà di Bruno formulas.

What carries the argument

The reduced Taylor polynomial T^k_* obtained by removing the constant term, composed and then projected onto degrees ≤ k via π_≤k.

If this is right

  • Expanding the composition identity recovers the classical Faà di Bruno formulas.
  • Polarization of the identity gives the multivariate partition formula.
  • Coefficient extraction from the identity gives the multi-index formula.
  • The same approach yields a general higher-order product rule for C^k maps.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • This perspective might allow deriving similar composition rules for other approximation schemes that admit a Peano-type remainder.
  • Applications could extend to infinite-dimensional settings where explicit combinatorics become intractable.
  • The separation of functorial composition from combinatorial extraction suggests analogous treatments for other differential operators or jet spaces.

Load-bearing premise

The maps are C^k between Banach spaces so that the Peano remainder admits an elementary estimate that directly produces the composition identity.

What would settle it

A pair of C^k maps between Banach spaces for which the composition of their reduced Taylor polynomials, after projection, fails to equal the reduced Taylor polynomial of the composition.

read the original abstract

We approach Fa\`a di Bruno as a composition theorem for Taylor polynomials. For $C^k$ maps $\phi: E \to F$ and $\psi: F \to G$ between Banach spaces, let $T^k_\ast(\phi; x)$ denote the reduced Taylor polynomial of $\phi$ at $x$, obtained by removing the constant term. We show that $$T^k_\ast(\psi \circ \phi; x) = \pi_{\le k}\bigl(T^k_\ast(\psi; \phi(x)) \circ T^k_\ast(\phi; x)\bigr).$$ The proof is an elementary estimate of the Peano remainder and does not use partitions or combinatorial enumeration. Expanding this composition identity recovers the classical Fa\`a di Bruno formulas. Polarization gives the multivariate partition formula (L\'evy 2006), while coefficient extraction gives the multi-index formula (Constantine and Savits 1996). Our approach separates the functorial nature of Taylor approximation from the combinatorial bookkeeping of polarization and coefficient extraction. As an application, we give a general higher-order product rule.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The manuscript claims that for C^k maps ϕ: E → F and ψ: F → G between Banach spaces, the reduced Taylor polynomial satisfies T^k_*(ψ ∘ ϕ; x) = π_≤k (T^k_*(ψ; ϕ(x)) ∘ T^k_*(ϕ; x)). The proof proceeds by an elementary estimate on the Peano remainder term and does not invoke partitions or combinatorial enumeration. Expanding the identity recovers the classical Faà di Bruno formulas (via polarization for the multivariate partition form and coefficient extraction for the multi-index form), and an application to a general higher-order product rule is given.

Significance. If the central identity holds, the work cleanly separates the functorial composition property of Taylor approximation from the subsequent combinatorial bookkeeping required for explicit Faà di Bruno expansions. The elementary Peano-based argument in Banach spaces, together with the explicit recovery of known formulas from the single identity, is a strength that could streamline derivations of higher-order chain and product rules.

minor comments (2)
  1. The definition of the reduced Taylor polynomial T^k_* (removal of the constant term) is used throughout but is not restated in the main text; a brief reminder in §2 would aid readability.
  2. The application to the higher-order product rule is stated without an explicit statement of the resulting formula; adding the expanded form would make the claim concrete.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the positive summary, significance assessment, and recommendation of minor revision. No specific major comments appear in the report.

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained

full rationale

The paper derives the reduced Taylor polynomial composition identity directly from the definition of T^k_* and an elementary Peano remainder estimate using only continuity of multilinear maps, the triangle inequality, and the o(\|h\|^k) property for C^k maps between Banach spaces. No load-bearing step reduces to a self-citation, fitted parameter, or self-definition; the cited works (Lévy 2006, Constantine-Savits 1996) are used only for recovering known expansions after the identity is established. The argument is independent of the target combinatorial formulas and does not import uniqueness or ansatzes via prior author work.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The paper relies on standard results from calculus in Banach spaces without introducing new free parameters or entities.

axioms (1)
  • standard math Taylor theorem with Peano remainder holds for C^k maps between Banach spaces.
    Foundation for defining reduced Taylor polynomials and the composition estimate.

pith-pipeline@v0.9.1-grok · 5719 in / 1255 out tokens · 33970 ms · 2026-06-29T04:56:41.878668+00:00 · methodology

Review history (2 revisions) →

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

7 extracted references · 4 canonical work pages · 1 internal anchor

  1. [1]

    Constantine and Thomas H

    Gregory M. Constantine and Thomas H. Savits. A multivariate Fa \`a di Bruno formula with applications. Transactions of the American Mathematical Society , 348(2):503--520, 1996. URL https://www.ams.org/journals/tran/1996-348-02/S0002-9947-96-01501-2/

    1996

  2. [2]

    Fa \`a di Bruno

    F. Fa \`a di Bruno. Sullo sviluppo delle funzioni. Annali di Scienze Matematiche e Fisiche , 6:479--480, 1855

  3. [3]

    Complex Analysis on Infinite Dimensional Spaces

    Se\'an Dineen. Complex Analysis on Infinite Dimensional Spaces . Springer Monographs in Mathematics. Springer, London, 1999. URL https://doi.org/10.1007/978-1-4471-0869-6

    work page doi:10.1007/978-1-4471-0869-6 1999

  4. [4]

    A short proof of the generalized Fa \`a di Bruno's formula

    Luis Hern \'a ndez Encinas and Juan Mu \ n oz Masqu \'e . A short proof of the generalized Fa \`a di Bruno's formula. Applied Mathematics Letters , 16(7):975--979, 2003. URL https://doi.org/10.1016/S0893-9659(03)90087-4

    work page doi:10.1016/s0893-9659(03)90087-4 2003

  5. [5]

    Real and Functional Analysis , volume 142 of Graduate Texts in Mathematics

    Serge Lang. Real and Functional Analysis , volume 142 of Graduate Texts in Mathematics . Springer, New York, 3rd edition, 1993. URL https://link.springer.com/book/10.1007/978-1-4612-0897-6

    work page doi:10.1007/978-1-4612-0897-6 1993

  6. [6]

    Why do partitions occur in Faa di Bruno's chain rule for higher derivatives?

    Eliahu Levy. Why do partitions occur in Faa di Bruno's chain rule for higher derivatives?, 2006. arXiv preprint. URL https://arxiv.org/abs/math/0602183

    work page internal anchor Pith review Pith/arXiv arXiv 2006

  7. [7]

    Ideals of Differentiable Functions

    Bernard Malgrange. Ideals of Differentiable Functions . Oxford University Press, Oxford, 1966. Tata Institute of Fundamental Research Studies in Mathematics. URL https://archive.org/details/idealsofdifferen0000malg

    1966