Chow's theorem at level two #
Group-like series are exactly the signatures of piecewise-linear
paths, to second order: over a finite alphabet, every character of the
word shuffle Hopf algebra agrees up to degree two with the signature of
an explicit piecewise-linear path
(exists_piecewiseLinear_eq_of_isGroupLike_levelTwo); conversely every
such signature is group-like (isGroupLike_piecewiseLinearSignature).
The construction is the classical one: a straight segment matches the level-one data, and one rectangle loop per coordinate plane corrects the antisymmetric part of the level-two data — the shuffle identity forces the symmetric part, and loops contribute pure area. Degree two is the order at which the library's rough path analysis operates; the full-depth identification (Chow–Rashevskii) needs the free Lie algebra and remains on the roadmap.
Low-degree expansion of the tensor product #
Rectangle loops #
The rectangle loop in the (i,j)-coordinate plane with area
parameter c: out, up, back, down.
Equations
Instances For
Appending area loops #
Chow's theorem at level two #
Chow's theorem at level two: over a finite alphabet, every
group-like series — every character of the word shuffle Hopf algebra —
agrees up to degree two with the signature of an explicit
piecewise-linear path: a straight segment for the first level, plus one
rectangle loop per coordinate plane for the antisymmetric second-level
part (the symmetric part is forced by the shuffle identity). Together
with isGroupLike_piecewiseLinearSignature, the group-like elements are
exactly the piecewise-linear signatures to second order.