The Graded Cut Identity and the Flow Identity #
This file proves the combinatorial identity underlying the flow property of
the exact B-series: for every ordered forest, the sum of inverse tree
factorials over the coproduct terms whose trunk has k vertices is a
binomial multiple of the inverse forest factorial,
Σ_{cuts, |R^c| = k} 1/(P^c! R^c!) = C(|ω|, k) / ω!,
and consequently the two-variable flow identity
Σ_{cuts} h^{|P^c|}/P^c! · h'^{|R^c|}/R^c! = (h + h')^{|ω|} / ω!,
which expresses that the exact flows compose: B_h ∘ B_{h'} = B_{h+h'}
(Butcher; Hairer-Lubich-Wanner, Geometric Numerical Integration, III.1).
The tree case reduces along the B⁺ recursion of the coproduct via
Nat.add_one_mul_choose_eq, and the forest case is Vandermonde's identity.
The k-graded sum of inverse tree factorials over the coproduct terms
of an ordered forest: cut terms whose trunk has k vertices.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The graded cut identity: the sum of inverse tree factorials over the cut
terms of an ordered forest whose trunk has k vertices equals
C(|ω|, k) / ω! (arXiv:2507.21006 background; Hairer-Lubich-Wanner III.1).
The flow identity for cuts of ordered forests:
Σ_{cuts} h^{|P^c|}/P^c! · h'^{|R^c|}/R^c! = (h + h')^{|ω|} / ω!.
This is the combinatorial content of the composition law of exact flows,
B_h ∘ B_{h'} = B_{h+h'}.