Recovering the Length of a Path from its Signature
Abstract
We prove the length conjecture of J. Chang, T. Lyons and H. Ni for paths of bounded variation for arbitrary real Banach spaces and any reasonable tensor (algebra) norms. More precisely, we establish the missing lower bound and in this way show that the length of a tree-reduced path is recovered from the asymptotic behaviour of its normalised signature. The main technical argument uses the norm duality and shuffle algebra to express natural powers of polygonal length approximations as combinations of linear functionals acting on restricted signatures, which are then glued by suitable integrations into a linear functional of controlled growth acting on the full signature. In particular, the full proof combines tools of classical analysis and functional analysis, such as localisation by continuous cutoff functions, Stone-Weierstrass approximation of continuous functions by signature polynomials, the Hahn-Banach theorem and a support detection lemma for compactly supported real signed Borel measures.
Related
- Total Path Length in Power-Weight Recursive Trees: Martingale Limits and Global Fluctuations
- Recovering curves from isogeny classes of Prym varieties
- Recovering Dirichlet coefficients from even samples
- Recovering a structure from its tree of tuples
- Recovering a Riemannian manifold from minimal surface areas
BibTeX
@misc{medwed2026recovering,
title = {{Recovering the Length of a Path from its Signature}},
author = {Felix Medwed},
howpublished = {arXiv},
year = {2026},
month = nov,
doi = {10.48550/arxiv.2611.08030},
eprint = {2611.08030},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2611.08030},
}
RIS
TY - UNPB
TI - Recovering the Length of a Path from its Signature
AU - Felix Medwed
PY - 2026
DA - 2026/11/05
PB - arXiv
DO - 10.48550/arxiv.2611.08030
UR - https://arxiv.org/abs/2611.08030
AB - We prove the length conjecture of J. Chang, T. Lyons and H. Ni for paths of bounded variation for arbitrary real Banach spaces and any reasonable tensor (algebra) norms. More precisely, we establish the missing lower bound and in this way show that the length of a tree-reduced path is recovered from the asymptotic behaviour of its normalised signature. The main technical argument uses the norm duality and shuffle algebra to express natural powers of polygonal length approximations as combinations of linear functionals acting on restricted signatures, which are then glued by suitable integrations into a linear functional of controlled growth acting on the full signature. In particular, the full proof combines tools of classical analysis and functional analysis, such as localisation by continuous cutoff functions, Stone-Weierstrass approximation of continuous functions by signature polynomials, the Hahn-Banach theorem and a support detection lemma for compactly supported real signed Borel measures.
ER -