Part II

Polylogarithms and Iterated Propagation: Transcendental Weight as Loop Order

Matthew Longhep-th20 pagesHaskell + Lean 4
Abstract

The second rung introduces the graded family of special functions defined on the domain of observable ratios: the classical polylogarithm, the multiple polylogarithms, multiple zeta values, and Chen's iterated path integrals, organized by a weight and depth bigrading. The emergent structural property of this rung is a precise slogan: transcendental weight equals loop order. We prove Chen's path-independence theorem, show that the iterated reduced coproduct of a weight-n polylogarithm terminates at weight-one logarithmic leaves, and give a complete three-form treatment of the five-term relation for the dilogarithm.

1 Introduction

1.1 The governing perspective

The organizing idea of this library is a single sentence, which we ask the reader to keep in view throughout:

A Goncharov-style Lie coalgebra is not merely a formal algebraic object; it is a bookkeeping system for how physical quantities break apart into irreducible informational constituents.

A physical observable — a scattering amplitude, a Feynman integral, a period, an entropy — is treated as the numerical realization of a deeper, pre-numerical, structured object. The question “what is this observable made of?” is then answered not by further computation but by a decomposition law: a coproduct/cobracket that exposes the observable’s primitive, irreducible pieces (cuts, discontinuities, factorization channels). The full library builds this apparatus rung by rung and, in its final synthesis, identifies measurement as the closure of the whole ladder.

This is a modular framework, not a unified one. Each rung is a standalone, defensible development; each composes with its neighbour to add exactly one emergent structural property that the level below cannot express on its own. The ladder is Ikinematicdomains    IIpolylogarithms(this paper)    IIImotives    IVLiecoalgebra    Vregulators    Synthesismeasurement.\underbrace{\text{I}}_{\substack{\text{kinematic}\\\text{domains}}} \;\longrightarrow\; \underbrace{\text{II}}_{\substack{\text{polylogarithms}\\\text{(this paper)}}} \;\longrightarrow\; \underbrace{\text{III}}_{\substack{\text{motives}}} \;\longrightarrow\; \underbrace{\text{IV}}_{\substack{\text{Lie}\\\text{coalgebra}}} \;\longrightarrow\; \underbrace{\text{V}}_{\substack{\text{regulators}}} \;\longrightarrow\; \underbrace{\text{Synthesis}}_{\substack{\text{measurement}}}.

1.2 Where this rung sits

Rung I disciplined the raw arena of observation: a field F\mathbb{F} of kinematic invariants, its multiplicative group F×\mathbb{F}^\times of nonzero scales and ratios, the projective line P1(F)\mathbb{P}^1(\mathbb{F}) with its PGL2(F)\mathrm{PGL}_2(\mathbb{F}) action, the cross-ratio, and the moduli space Confn(P1)=M0,n\mathrm{Conf}_n(\mathbb{P}^1)=M_{0,n}. Its central computation showed that the four-point kinematic configuration space is exactly P1{0,1,}\mathbb{P}^1\setminus\{0,1,\infty\} — precisely the punctured domain on which the classical polylogarithm is single-valued away from its branch points at 0,1,0,1,\infty. Rung I therefore does not merely supply “some field”; it hands over the specific domain on which the functions of this paper live.

Rung II — the present paper — populates that domain with functions. We introduce the classical polylogarithm Lin(x)=k1xk/kn\operatorname{Li}_n(x)=\sum_{k\ge1}x^k/k^n, its multi-variable generalizations, the multiple zeta values, and their common analytic incarnation as Chen iterated path integrals. These carry a weight and a depth grading. The emergent property we name is the slogan

the statement that the algebraic complexity (weight) of the special functions produced by a perturbative computation tracks the physical complexity (loop order, number of propagators) of that computation. (The ladder sometimes calls this “transcendental depth,” meaning the transcendentality level; in this paper we reserve the word depth for the distinct iterated-integral nesting grading of 9, and use weight for the grading that tracks loop order.) This is the first appearance in the ladder of a graded family of transcendental functions whose grading is physically meaningful, and it is the structural precondition for everything that follows: the coproduct of Rung IV lowers weight, the periods of Rung III are the weight-graded transcendental constants, and the regulators of Rung V evaluate weight-two data through the Bloch–Wigner function.

1.3 What we prove

The paper is expository where it must recall Rung I and forward-reference Rungs III–V, but it contains genuine proofs of the results that belong to Rung II proper:

  • 11 (Chen path-independence): iterated integrals of closed logarithmic 11-forms depend only on the based homotopy class of the integration path, so that Lin\operatorname{Li}_n is a well-defined multivalued analytic function on P1{0,1,}\mathbb{P}^1\setminus\{0,1,\infty\}.

  • 13 (termination of the iterated coproduct): the reduced coproduct strictly lowers weight in each tensor factor, so its iteration on a weight-nn polylogarithm terminates after at most n1n-1 steps at weight-one logarithmic leaves. This is the precise fact that licenses the phrase “weight == loop order”: complexity is bounded, finite, and reduces to elementary log\log data.

  • 19 (the five-term relation, three forms): the fundamental functional equation of Li2\operatorname{Li}_2 in Rogers, Bloch–Wigner, and cross-ratio forms, with the equivalences and the descent to a 55-point configuration proved in detail. This is the connective tissue of the whole library.

  • 15 (symbol and shuffle): the symbol of Li2\operatorname{Li}_2 is S(Li2(x))=(1x)x\mathcal{S}(\operatorname{Li}_2(x))=-(1-x)\otimes x, and the shuffle relations express equivalent orderings of iterated propagation.

The accompanying Haskell package numerically certifies the shuffle product, the symbol of the dilogarithm, and all three forms of the five-term relation to machine precision; a Lean 4 file records the structural statements. 16 describes both.

1.4 Standalone-library discipline and epistemic honesty

This library is self-contained: it cites only the external mathematical and physical literature ([sec:refs]), and it makes its interpretive commitments explicit through a three-valued status system, described in 3, that tags every dictionary entry and every claim as standard (S), heuristic (H), or speculative (P). We regard this discipline as part of the formalism, not as decoration: it is what keeps the physical reading of a theorem from being silently promoted above the reliability of the mathematics that supports it.

2 The Mathematics \leftrightarrow Physics Dictionary

Every paper in this library reproduces, verbatim, the following translation table as its opening dictionary. It is the seed from which each rung’s topic-specific refinements are drawn.

Mathematics Physical representation
Field F\mathbb{F} Kinematic/coordinate domain of possible values
Element of F×\mathbb{F}^\times Ratio, cross-ratio, scale, observable parameter
Polylogarithm Lin(x)\operatorname{Li}_n(x) Iterated propagation / layered amplitude contribution
Period Measurable physical number obtained from geometry
Motive Pre-numerical informational object behind the measurement
Lie algebra Infinitesimal symmetry / generator structure
Lie coalgebra Decomposition law of observables
Cobracket δ\delta Factorization channel, cut, boundary, or information split
Weight grading Complexity depth / loop order / transcendental depth
Primitive element Irreducible informational unit
Coproduct Full hierarchical decomposition
Regulator map Passage from motivic object to physical real number
Hodge/de Rham realization Analytic form seen by calculation
Betti realization Topological/path/integration-cycle form
Period pairing Physical observable as pairing of form and cycle

This seed table is reproduced verbatim across the library. One word deserves a caveat local to the present rung: in the “Weight grading” row the phrase “transcendental depth” uses depth in its colloquial sense of transcendentality level (a synonym for weight). Throughout the body of this paper we instead reserve the technical term depth for the iterated-integral nesting grading of 9, and use weight for the grading that tracks loop order.

Four central slogans recur across the whole library: observable=realization(motivic information),coalgebra=grammar of physical decomposition,Physics observes numerical shadows of deeper motivic structures,Physical reality is the realization layer of structured mathematical information.\begin{align*} &\text{observable} = \text{realization}(\text{motivic information}), \\ &\text{coalgebra} = \text{grammar of physical decomposition}, \\ &\text{Physics observes numerical shadows of deeper motivic structures}, \\ &\text{Physical reality is the realization layer of structured mathematical information}. \end{align*}

3 The Epistemic Status System (S / H / P)

Every dictionary entry and every claim below carries one of three labels. These are the library’s core epistemic-honesty device.

Label Meaning Canonical example
S Standard use in mathematics or mathematical physics The Goncharov coproduct on motivic polylogarithms
H Strong heuristic representation-dictionary entry “Weight == loop order”; cobracket as “cut”
P Speculative philosophical ontology Physical reality as motivic-categorical realization

Composite labels S/H and H/P occur where an entry is standard as pure mathematics but heuristic or speculative in its physical reading. We adopt the following rule without exception.

Definition 1 (Status monotonicity). Order the labels by S<H<P\textsf{S}< \textsf{H}< \textsf{P} (increasing speculativeness, equivalently decreasing reliability). If two representation entries or theorems compose, the status of the composite is the maximum of the two under this order: a chain of translations is only as reliable as its weakest link. In particular, a P-labeled step cannot be upgraded to S merely by composing it with otherwise-rigorous results.

We flag the reading “weight == loop order” as S/H: the weight grading and its properties are standard mathematics (S), while its identification with physical loop order is a strong heuristic (H) that is established case-by-case rather than by a universal theorem. We will be explicit about where the boundary lies (14).

4 Master Formulas

The whole library shares the following notation. observable=Real(abstract structure),A=per(Am),Δ(Am)=iAi,1mAi,2m,δ:LGΛ2LG,wt(x)=n  for xLGn,dep(x)=depth,per(Π)=Γω,Π=(X,D,ω,Γ).\begin{align} \text{observable} &= \operatorname{Real}(\text{abstract structure}), \\ \mathcal{A}&= \operatorname{per}(\mathcal{A}^{\mathfrak{m}}), \\ \Delta(\mathcal{A}^{\mathfrak{m}}) &= \textstyle\sum_i \mathcal{A}^{\mathfrak{m}}_{i,1}\otimes \mathcal{A}^{\mathfrak{m}}_{i,2}, \\ \delta &: \mathcal{L}_G\longrightarrow \Lambda^2\mathcal{L}_G, \\ \operatorname{wt}(x) &= n \ \text{ for } x\in\mathcal{L}_G{}_n, \qquad \operatorname{dep}(x)=\text{depth}, \\ \operatorname{per}(\Pi) &= \int_\Gamma \omega, \qquad \Pi=(X,D,\omega,\Gamma). \end{align} Here F\mathbb{F} is a field (typically a number field or a field of kinematic invariants), F×\mathbb{F}^\times its multiplicative group; Am\mathcal{A}^{\mathfrak{m}} is a motivic amplitude object, a pre-numerical element of a Hopf algebra H\mathcal{H} of motivic periods, and per\operatorname{per} the period map sending it to the physical number A\mathcal{A}; LG=LG(F)=n1LG(F)n\mathcal{L}_G=\mathcal{L}_G(\mathbb{F})=\bigoplus_{n\ge1}\mathcal{L}_G(\mathbb{F})_n is the (Goncharov) Lie coalgebra of primitives, graded by weight nn; and δ\delta is the antisymmetrization of the reduced coproduct Δ\Delta' (namely Δ\Delta minus its two trivial terms x1x\otimes1 and 1x1\otimes x), landing in Λ2LG\Lambda^2\mathcal{L}_G rather than LGLG\mathcal{L}_G\otimes\mathcal{L}_G. Rung II is where the weight grading of [eq:master5] first appears and where the functions realized by per\operatorname{per} in [eq:master2] are constructed.

5 Core Objects: Polylogarithms and Iterated Integrals

5.1 The classical polylogarithm

Definition 2 (Classical polylogarithm; status S). For n1n\ge1 the classical polylogarithm is the power series Lin(x)  =  k1xkkn,x<1,\begin{equation} \operatorname{Li}_n(x) \;=\; \sum_{k\ge1}\frac{x^k}{k^n}, \qquad |x|<1, \end{equation} continued analytically to C[1,)\mathbb{C}\setminus[1,\infty). The first two cases are Li1(x)=log(1x),Li2(x)=k1xkk2,\operatorname{Li}_1(x) = -\log(1-x), \qquad \operatorname{Li}_2(x) = \sum_{k\ge1}\frac{x^k}{k^2}, and the members are linked by the differential relations ddxLin(x)=Lin1(x)x (n2),ddxLi1(x)=11x.\begin{equation} \frac{\mathrm{d}}{\mathrm{d}x}\,\operatorname{Li}_n(x) = \frac{\operatorname{Li}_{n-1}(x)}{x}\ (n\ge2), \qquad \frac{\mathrm{d}}{\mathrm{d}x}\,\operatorname{Li}_1(x) = \frac{1}{1-x}. \end{equation} Equivalently, Lin(x)=0xLin1(t)dtt\operatorname{Li}_n(x)=\int_0^x \operatorname{Li}_{n-1}(t)\,\frac{\mathrm{d}t}{t} for n2n\ge2, expressing Lin\operatorname{Li}_n as a single integration of Lin1\operatorname{Li}_{n-1} against the logarithmic kernel dt/t\mathrm{d}t/t.

Iterating [eq:polydiff] down to Li1\operatorname{Li}_1 realizes Lin\operatorname{Li}_n as an nn-fold iterated integral, which we make precise in 5 below. The number nn is the weight; it counts the layers of integration.

5.2 Multiple polylogarithms and multiple zeta values

Definition 3 (Multiple polylogarithm; status S). For positive integers n1,,ndn_1,\dots,n_d and complex arguments x1,,xdx_1,\dots,x_d, Lin1,,nd(x1,,xd)  = ⁣ ⁣0<k1<<kd ⁣ ⁣x1k1xdkdk1n1kdnd,\begin{equation} \operatorname{Li}_{n_1,\dots,n_d}(x_1,\dots,x_d) \;=\!\!\sum_{0<k_1<\cdots<k_d}\!\! \frac{x_1^{k_1}\cdots x_d^{k_d}}{k_1^{n_1}\cdots k_d^{n_d}}, \end{equation} convergent for xi1|x_i|\le1 with (nd,xd)(1,1)(n_d,x_d)\neq(1,1). Its weight is n=n1++ndn=n_1+\cdots+n_d and its depth is dd.

Definition 4 (Multiple zeta values; status S). The specialization to all arguments equal to 11, ζ(n1,,nd)  =  Lin1,,nd(1,,1)  = ⁣ ⁣0<k1<<kd ⁣ ⁣1k1n1kdnd,nd2,\begin{equation} \zeta(n_1,\dots,n_d) \;=\; \operatorname{Li}_{n_1,\dots,n_d}(1,\dots,1) \;=\!\!\sum_{0<k_1<\cdots<k_d}\!\!\frac{1}{k_1^{n_1}\cdots k_d^{n_d}}, \qquad n_d\ge2, \end{equation} is a multiple zeta value (MZV) of weight n=n1++ndn=n_1+\cdots+n_d and depth dd. These are the special constants that appear as the weight-graded pieces of loop amplitude expansions.

5.3 Chen iterated integrals

The uniform analytic home of all of the above is Chen’s calculus of iterated path integrals.

Definition 5 (Chen iterated integral; status S). Fix points a1,,aNCa_1,\dots,a_N\in\mathbb{C} (the singularities) and endpoints a0,aN+1a_0,a_{N+1}. For a path γ:[0,1]C{a1,,aN}\gamma:[0,1]\to\mathbb{C}\setminus\{a_1,\dots,a_N\} from a0a_0 to aN+1a_{N+1}, the iterated integral of the logarithmic forms ωi=dt/(tai)\omega_i = \mathrm{d}t/(t-a_i) is the ordered-simplex integral I(a0;a1,,aN;aN+1)  =  0<t1<<tN<1γ(t1)dt1γ(t1)a1γ(tN)dtNγ(tN)aN.\begin{equation} I(a_0;a_1,\dots,a_N;a_{N+1}) \;=\; \int_{0<t_1<\cdots<t_N<1} \frac{\gamma'(t_1)\,\mathrm{d}t_1}{\gamma(t_1)-a_1}\cdots \frac{\gamma'(t_N)\,\mathrm{d}t_N}{\gamma(t_N)-a_N}. \end{equation} Here the simplex is oriented 0<t1<<tN<10<t_1<\cdots<t_N<1, so t1t_1 is the innermost variable and the leftmost letter a1a_1 is the one integrated first. When an endpoint coincides with a singularity the integral is defined by tangential base-point regularization (Deligne; Goncharov). In Goncharov’s convention the classical polylogarithm is the special value Lin(x)  =  I(0;1,0,,0n1;x),\begin{equation} \operatorname{Li}_n(x) \;=\; -\,I(0;1,\underbrace{0,\dots,0}_{n-1};x), \end{equation} the iterated integral along the straight path from 00 to xx with the alphabet {dt/t, dt/(t1)}\{\mathrm{d}t/t,\ \mathrm{d}t/(t-1)\}: the innermost step is taken against the puncture at 11, the remaining n1n-1 steps against the puncture at 00.

Example 6 (Li2\operatorname{Li}_2 as a double iterated integral; status S). We verify [eq:li-as-chen] for n=2n=2 directly. By definition, with the innermost letter a1=1a_1=1 and outer letter a2=0a_2=0, I(0;1,0;x)=0<t1<t2<xdt1t11dt2t2=0xdt2t20t2dt1t11.-I(0;1,0;x) = -\int_{0<t_1<t_2<x}\frac{\mathrm{d}t_1}{t_1-1}\,\frac{\mathrm{d}t_2}{t_2} = -\int_0^x\frac{\mathrm{d}t_2}{t_2}\int_0^{t_2}\frac{\mathrm{d}t_1}{t_1-1}. The inner integral is 0t2dt1/(t11)=log(1t2)\int_0^{t_2}\mathrm{d}t_1/(t_1-1)=\log(1-t_2), so I(0;1,0;x)=0xlog(1t2)t2dt2=Li2(x),-I(0;1,0;x) = -\int_0^x \frac{\log(1-t_2)}{t_2}\,\mathrm{d}t_2 = \operatorname{Li}_2(x), using Li2(x)=0xlog(1t)dt/t\operatorname{Li}_2(x)=-\int_0^x\log(1-t)\,\mathrm{d}t/t from [eq:polydiff]. This makes the “iterated propagation” picture concrete: each of the two integrations is one propagation step, the innermost against the puncture at 11 (the form dt/(t1)\mathrm{d}t/(t-1), contributing log(1t)\log(1-t)) and the outer against the puncture at 00 (the form dt/t\mathrm{d}t/t). The same computation with n1n-1 trailing dt/t\mathrm{d}t/t factors reproduces Lin(x)=k1xk/kn\operatorname{Li}_n(x)=\sum_{k\ge1}x^k/k^n by raising the exponent once per outer integration.

The passage [eq:li-as-chen] is the bridge between the “propagation” picture (each factor dt/(tai)\mathrm{d}t/(t-a_i) is one elementary propagation step against a singular locus) and the combinatorial machinery — shuffle products, the coproduct, the symbol — that organizes the whole weight-graded family. We record the two products that iterated integrals satisfy.

Proposition 7 (Shuffle product; status S). Iterated integrals along a fixed path multiply by the shuffle product: I(a0;u;aN+1)I(a0;v;aN+1)  =  σuvI(a0;σ;aN+1),\begin{equation} I(a_0;\,\vec{u}\,;a_{N+1})\cdot I(a_0;\,\vec{v}\,;a_{N+1}) \;=\;\sum_{\sigma\in \vec u\,\shuffle\,\vec v} I(a_0;\,\sigma\,;a_{N+1}), \end{equation} the sum running over all interleavings σ\sigma of the two letter sequences u,v\vec u,\vec v preserving the internal order of each. Physically (status H) the shuffle records that two sequences of propagation steps performed along the same path may be interleaved in all order-preserving ways without changing the accumulated value.

Proof. Expand the product of the two simplex integrals over the common interval [0,1][0,1]. The product of an rr-simplex and an ss-simplex integral is an integral over [0,1]r+s[0,1]^{r+s} intersected with the two independent orderings; decomposing [0,1]r+s[0,1]^{r+s} into the (r+sr)\binom{r+s}{r} chambers on which a single total order of the r+sr+s times holds, and discarding the measure-zero coincidence loci, expresses the product as the sum over all interleavings preserving the internal order of each factor. Each chamber is exactly one shuffle term [eq:shuffle]. ◻

The series representation of 4 satisfies a second, distinct product (the stuffle or quasi-shuffle), obtained by splitting the summation region {k1<}×{l1<}\{k_1<\cdots\}\times\{l_1<\cdots\} into the regions where indices are <<, >>, or ==. The two products together impose the double-shuffle relations among MZVs; we use only the shuffle relation computationally (16).

5.4 The symbol

Definition 8 (Symbol; status S). The symbol of a weight-nn (multiple) polylogarithm FF is the length-nn tensor S(F)(F×Q)n\mathcal{S}(F)\in(\mathbb{F}^\times\otimes\mathbb{Q})^{\otimes n} obtained by maximally iterating the reduced coproduct down to weight-one letters. Concretely it is computed recursively from the differential: if dF=iFid ⁣logRi\mathrm{d}F=\sum_i F_i\,\mathrm{d}\!\log R_i with RiF×R_i\in\mathbb{F}^\times and each FiF_i of weight n1n-1, then S(F)  =  iS(Fi)Ri.\begin{equation} \mathcal{S}(F) \;=\; \sum_i \mathcal{S}(F_i)\otimes R_i . \end{equation} The symbol is the sharpest elementary invariant for detecting functional identities among polylogarithms: two weight-nn combinations are equal modulo lower-weight products of logarithms and constants iff their symbols agree.

6 Weight, Depth, and the Emergent Property

Definition 9 (Weight and depth grading; status S/H). The weight n=n1++ndn=n_1+\cdots+n_d measures transcendental complexity; the depth dd counts the number of nested iterated-integration layers. The physical reading (status H) is: weight=loop order / functional transcendentality,depth=number of independent kinematic channels.\begin{align*} \text{weight} &= \text{loop order / functional transcendentality},\\ \text{depth} &= \text{number of independent kinematic channels}. \end{align*}

The weight grading is compatible with all the structure introduced so far: the differential [eq:polydiff] lowers weight by one; the shuffle product [eq:shuffle] is weight-additive; the symbol [eq:symbol-rec] of a weight-nn function is a length-nn tensor of weight-one letters. The grading is what makes “how complicated is this function” into a number rather than an impression, and the emergent property of the rung is the physical interpretation of that number.

Remark 10 (The emergent property: transcendental weight == loop order; status S/H). Perturbative computations in quantum field theory produce, order by order in the loop expansion, transcendental functions of increasing weight: a one-loop finite integral is generically weight two (dilogarithms), an \ell-loop integral is generically weight 22\ell in four dimensions, and the constants appearing are MZVs of the corresponding weight. The empirical regularity that weight tracks loop order is the emergent property this rung names. It is not a theorem in the generality of all QFTs: it is a strong heuristic (H) with a large body of confirming case studies (finite integrals in ϕ4\phi^4 theory; the six-gluon remainder function in planar N=4\mathcal N=4 super Yang–Mills; the sunrise family up to its elliptic boundary, 14) and known exceptions once elliptic and higher-genus geometry enters. The mathematical content that is a theorem — and that makes the heuristic precise and bounded — is the termination statement of the next section: complexity, whatever its physical origin, is finitely generated by weight-one logarithms.

7 Chen’s Theorem and Termination of the Coproduct

7.1 Path-independence

Theorem 11 (Chen path-independence for logarithmic forms; status S). Let a1,,aNCa_1,\dots,a_N\in\mathbb{C} and let γ0γ1\gamma_0\simeq\gamma_1 be homotopic paths in C{a1,,aN}\mathbb{C}\setminus\{a_1,\dots,a_N\} with the same endpoints, the homotopy fixing the endpoints. Then the iterated integral [eq:chen] of the closed logarithmic forms ωi=dt/(tai)\omega_i=\mathrm{d}t/(t-a_i) is unchanged: Iγ0(a0;a1,,aN;aN+1)  =  Iγ1(a0;a1,,aN;aN+1),I_{\gamma_0}(a_0;a_1,\dots,a_N;a_{N+1}) \;=\; I_{\gamma_1}(a_0;a_1,\dots,a_N;a_{N+1}), with tangential regularization at any singular endpoint. Consequently the classical polylogarithm Lin(x)  =  I(0;1,0,,0;x)\operatorname{Li}_n(x)\;=\;-\,I(0;1,0,\dots,0;x) of [eq:li-as-chen] is a well-defined multivalued analytic function on P1{0,1,}\mathbb{P}^1\setminus\{0,1,\infty\} whose monodromy is exactly the analytic-continuation data organized by the later cobracket.

Proof. This is Chen’s fundamental theorem of iterated path integrals (Chen, 1977). The key point is that the iterated integral of a collection of closed 11-forms along a path is invariant under homotopy of the path rel endpoints. We sketch the standard chain-homotopy argument. Let H:[0,1]×[0,1]C{a1,,aN}H:[0,1]\times[0,1]\to\mathbb{C}\setminus\{a_1,\dots,a_N\} be a homotopy with H(,0)=γ0H(\cdot,0)=\gamma_0, H(,1)=γ1H(\cdot,1)=\gamma_1, and H(0,s),H(1,s)H(0,s),H(1,s) constant in ss. Regard the length-NN iterated integral as the evaluation of a 11-form ΘN\Theta_N on the based path space, built from the forms ωi\omega_i; Chen’s transport formula gives dΘN=±ΘkΘNk\mathrm{d}\Theta_N = \sum \pm\,\Theta_{k}\wedge\Theta'_{N-k} with each factor proportional to dωi=0\mathrm{d}\omega_i=0, because every ωi\omega_i is closed. Hence ΘN\Theta_N is closed on path space, and Stokes’ theorem applied to the homotopy square shows the difference of the two iterated integrals equals the integral of dΘN=0\mathrm{d}\Theta_N=0 over the interior plus boundary terms along the constant edges H(0,s),H(1,s)H(0,s),H(1,s), which vanish because the endpoints are fixed. Therefore the two iterated integrals agree.

For [eq:li-as-chen]: the forms dt/t\mathrm{d}t/t and dt/(t1)\mathrm{d}t/(t-1) are closed on C{0,1}\mathbb{C}\setminus\{0,1\}, so the iterated integral defining Lin\operatorname{Li}_n depends only on the homotopy class of the path from 00 to xx in P1{0,1,}\mathbb{P}^1\setminus\{0,1,\infty\}. Different homotopy classes differ by loops around 00 and 11; the resulting shifts are exactly the monodromy of Lin\operatorname{Li}_n. The primary generator, the monodromy around the branch point x=1x=1, acts by Lin(x)Lin(x)2πi(logx)n1(n1)!\operatorname{Li}_n(x)\mapsto \operatorname{Li}_n(x) - 2\pi i\,\tfrac{(\log x)^{\,n-1}}{(n-1)!}, while the loop around x=0x=0 acts on the resulting lower-weight logarithm; together they generate the full (nonabelian) monodromy. Thus Lin\operatorname{Li}_n is single-valued on the universal cover and multivalued on P1{0,1,}\mathbb{P}^1\setminus\{0,1,\infty\}. ◻

Remark 12 (Physical reading; status H). Path-independence is the mathematical reason a Feynman integral’s transcendental value does not depend on how one parametrizes the loop-momentum contour, only on the topological class of the integration cycle relative to its singularities. It directly anticipates the integration cycle Γ\Gamma of the period datum [eq:master6] that a later rung evaluates.

7.2 Termination of the iterated coproduct

We now state the fact that makes “weight == loop order” a bounded, finite statement. We work in the connected graded Hopf algebra H=n0Hn\mathcal{H}=\bigoplus_{n\ge0}\mathcal{H}_n of motivic periods (weight grading, H0=Q1\mathcal{H}_0=\mathbb{Q}\cdot1), with reduced coproduct Δ(x)=Δ(x)x11x\Delta'(x)=\Delta(x)-x\otimes1-1\otimes x on the augmentation ideal H=kerε\overline{\mathcal{H}}=\ker\varepsilon.

Proposition 13 (Termination at weight-one primitives; status S). Let xHx\in\mathcal{H} be a (motivic) polylogarithm of weight n1n\ge1. Then Δ\Delta' is graded and strictly lowers weight in each tensor factor, and its iteration on xx terminates after at most n1n-1 steps, with terminal leaves of weight one. In symbols, the tower xΔxxΔid, idΔx \xmapsto{\Delta'} \textstyle\sum x'\otimes x'' \xmapsto{\Delta'\otimes\mathrm{id},\ \mathrm{id}\otimes\Delta'} \cdots reaches only weight-one tensor factors after at most n1n-1 applications, and Δ\Delta' vanishes on weight one.

Proof. Because H\mathcal{H} is connected and graded, for xx of weight nn every term of Δ(x)=ixixi\Delta'(x)=\sum_i x_i'\otimes x_i'' has wt(xi)1\operatorname{wt}(x_i')\ge1, wt(xi)1\operatorname{wt}(x_i'')\ge1, and wt(xi)+wt(xi)=n\operatorname{wt}(x_i')+\operatorname{wt}(x_i'')=n; hence each factor has weight n1\le n-1. Apply Δ\Delta' again to each factor of weight 2\ge2; by the same argument the maximal weight of a factor drops by at least one at each step. After at most n1n-1 steps every factor has weight one. On weight one, Δ\Delta' vanishes: a weight-one element cannot split as p+qp+q with p,q1p,q\ge1 summing to 11, so ΔH1=0\Delta'|_{\mathcal{H}_1}=0 and every weight-one element is primitive. Finiteness of the whole tree follows because each node has finitely many children (the coproduct is a finite sum) and the depth is bounded by n1n-1. ◻

Remark 14 (Why this licenses the slogan; status S/H). 13 is the precise fact behind the emergent property of 10: whatever the physical origin of a weight-nn contribution, its coalgebraic anatomy is a finite tree of bounded depth whose leaves are weight-one logarithms logR\log R with RF×R\in\mathbb{F}^\times — exactly Rung I’s observable ratios. Complexity is not merely large; it is finitely generated by the ground-floor data of the ladder. The full structural consequence — that these weight-one primitives cogenerate the entire Goncharov Lie coalgebra, with P1F×QP_1\cong\mathbb{F}^\times\otimes\mathbb{Q} — belongs to Rung IV; here we need only the termination, which is elementary given the grading.

7.3 The symbol of the dilogarithm

Theorem 15 (Symbol and cobracket of Li2\operatorname{Li}_2; status S). The reduced coproduct of the motivic dilogarithm is ΔLi2m(x)  =  Li1m(x)logm(x)  =  logm(1x)logm(x),\begin{equation} \Delta'\,\operatorname{Li}_2^{\mathfrak m}(x) \;=\; \operatorname{Li}_1^{\mathfrak m}(x)\otimes\log^{\mathfrak m}(x) \;=\; -\,\log^{\mathfrak m}(1-x)\otimes\log^{\mathfrak m}(x), \end{equation} so that the symbol is S(Li2(x))  =  (1x)x,\begin{equation} \mathcal{S}(\operatorname{Li}_2(x)) \;=\; -(1-x)\otimes x, \end{equation} and the cobracket is δLi2m(x)=log(x)log(1x)\delta\,\operatorname{Li}_2^{\mathfrak m}(x) = \log(x)\wedge\log(1-x).

Proof. From [eq:polydiff], dLi2(x)=Li1(x)dx/x=log(1x)d ⁣logx\mathrm{d}\operatorname{Li}_2(x)=\operatorname{Li}_1(x)\,\mathrm{d}x/x = -\log(1-x)\,\mathrm{d}\!\log x. Applying the symbol recursion [eq:symbol-rec] with the single term F1=Li1(x)=log(1x)F_1=\operatorname{Li}_1(x)=-\log(1-x) and R1=xR_1=x gives S(Li2(x))=S(log(1x))x=(1x)x\mathcal{S}(\operatorname{Li}_2(x))=\mathcal{S}(-\log(1-x))\otimes x = -(1-x)\otimes x, using S(logR)=R\mathcal{S}(\log R)=R for weight-one letters. Reading off the weight-(1,1)(1,1) component of Goncharov’s coproduct from the last symbol entry gives ΔLi2m(x)=Li1m(x)logm(x)=logm(1x)logm(x)\Delta'\,\operatorname{Li}_2^{\mathfrak m}(x)=\operatorname{Li}_1^{\mathfrak m}(x)\otimes \log^{\mathfrak m}(x)=-\log^{\mathfrak m}(1-x)\otimes\log^{\mathfrak m}(x), consistent in sign with [eq:dilog-symbol]. Antisymmetrizing the two tensor slots (the map ababa\otimes b\mapsto a\wedge b) gives δLi2m(x)=log(1x)log(x)=log(x)log(1x)\delta\,\operatorname{Li}_2^{\mathfrak m}(x)= -\log(1-x)\wedge\log(x)=\log(x)\wedge\log(1-x). ◻

The two tensor slots of [eq:dilog-symbol] are the two weight-one primitives 1x1-x and xx; physically (status H) they are the two branch loci x=1x=1 and x=0x=0 of the dilogarithm, i.e. its cut structure. This is the smallest nontrivial instance of the dictionary entry “cobracket \leftrightarrow cut”; the full one-loop discontinuity computation belongs to Rung IV.

8 Functional Identities and the Double-Shuffle Relations

Before turning to the five-term relation we record the elementary weight-two functional identities of the dilogarithm and the double-shuffle relations among multiple zeta values. Both are instances of the same principle — the special functions of this rung are heavily constrained, not free — and both are proved most cleanly at the level of the symbol [eq:symbol-rec], which reduces a functional equation among weight-nn functions to a linear-algebra identity among tensors of weight-one letters (modulo lower-weight products, which are then fixed by evaluation at a single point).

8.1 Weight-two identities of the dilogarithm

Proposition 16 (Reflection, inversion, Landen, duplication; status S). The dilogarithm satisfies, on the appropriate branches, Li2(x)+Li2(1x)=π26log(x)log(1x),Li2(x)+Li2 ⁣(1x)=π2612log2(x),Li2(x)+Li2 ⁣(xx1)=12log2(1x),Li2(x2)=2(Li2(x)+Li2(x)).\begin{align} \operatorname{Li}_2(x) + \operatorname{Li}_2(1-x) &= \frac{\pi^2}{6} - \log(x)\log(1-x), \\ \operatorname{Li}_2(x) + \operatorname{Li}_2\!\left(\tfrac1x\right) &= -\frac{\pi^2}{6} - \tfrac12\log^2(-x), \\ \operatorname{Li}_2(x) + \operatorname{Li}_2\!\left(\frac{x}{x-1}\right) &= -\tfrac12\log^2(1-x), \\ \operatorname{Li}_2(x^2) &= 2\big(\operatorname{Li}_2(x) + \operatorname{Li}_2(-x)\big). \end{align}

Proof. Each is an equality of weight-two functions, so by 8 it suffices to check the symbols agree and then fix the additive weight-two constant (a rational multiple of π2\pi^2) by evaluating at one convenient point. We do the reflection identity [eq:reflection] in detail; the others are identical in method. The symbol of the left-hand side is S(Li2(x))+S(Li2(1x))=(1x)x    x(1x),\mathcal{S}\big(\operatorname{Li}_2(x)\big) + \mathcal{S}\big(\operatorname{Li}_2(1-x)\big) = -(1-x)\otimes x \;-\; x\otimes(1-x), using 15 for the first term and the substitution x1xx\mapsto1-x (which also swaps the roles of the two branch loci) for the second. The symbol of the right-hand side: the constant π2/6\pi^2/6 has empty symbol (it is a weight-two number, killed by d\mathrm{d}), and S(logxlog(1x))=x(1x)(1x)x\mathcal{S}\big(-\log x\log(1-x)\big) = -\,x\otimes(1-x) - (1-x)\otimes x by the Leibniz rule for the symbol of a product of logarithms. The two symbols coincide. Hence the two sides differ by a weight-two constant; evaluating at x=12x=\tfrac12, where Li2(12)=π21212log22\operatorname{Li}_2(\tfrac12)=\tfrac{\pi^2}{12}-\tfrac12\log^2 2 and both arguments equal 12\tfrac12, fixes the constant to π2/6\pi^2/6. The inversion, Landen, and duplication identities follow by the same symbol comparison, with constants fixed at x=1x=-1, x0x\to0, and x=1x=1 respectively. ◻

These identities are exactly the ingredients that make the Bloch–Wigner function single-valued: the combination arg(1z)logz\arg(1-z)\log|z| in 20 is chosen so that the multivalued pieces produced by [eq:reflection][eq:inversion] cancel, yielding the clean symmetries D(z)=D(1/z)=D(1z)D(z)=-D(1/z)=-D(1-z) recorded in 21. The reflection and duplication identities are numerically certified by the Haskell code of 16.

8.2 Shuffle, stuffle, and a double-shuffle consequence

Multiple zeta values carry two products: the shuffle [eq:shuffle], from their iterated-integral representation, and the stuffle (quasi-shuffle), from their series representation. Their difference produces nontrivial Q\mathbb{Q}-linear relations.

Proposition 17 (A double-shuffle relation; status S). In the summation convention of 34 (indices increasing, ζ(n1,n2)=0<k1<k2k1n1k2n2\zeta(n_1,n_2)= \sum_{0<k_1<k_2} k_1^{-n_1}k_2^{-n_2}, convergent when the outer exponent n22n_2\ge2), one has ζ(1,3)  =  0<m<n1mn3  =  14ζ(4)  =  π4360.\begin{equation} \zeta(1,3) \;=\; \sum_{0<m<n}\frac{1}{m\,n^3} \;=\; \tfrac14\,\zeta(4) \;=\; \frac{\pi^4}{360}. \end{equation}

Proof. The stuffle product splits the double sum ζ(2)2=(mm2)(nn2)\zeta(2)^2=\big(\sum_m m^{-2}\big)\big(\sum_n n^{-2}\big) over {(m,n):m,n1}\{(m,n):m,n\ge1\} into the regions m<nm<n, m>nm>n, and m=nm=n; the two off-diagonal regions are equal by symmetry, giving ζ(2)2  =  2ζ(2,2)+ζ(4).\begin{equation} \zeta(2)^2 \;=\; 2\,\zeta(2,2) + \zeta(4). \end{equation} The shuffle product, applied to the length-two iterated-integral word representing ζ(2)\zeta(2), gives ζ(2)2  =  2ζ(2,2)+4ζ(1,3),\begin{equation} \zeta(2)^2 \;=\; 2\,\zeta(2,2) + 4\,\zeta(1,3), \end{equation} the shuffles of the two length-two words collecting into two copies of the word for ζ(2,2)\zeta(2,2) and four copies of the word for the convergent depth-two weight-four value ζ(1,3)\zeta(1,3). Subtracting [eq:stuffle22] from [eq:shuffle22] gives 4ζ(1,3)=ζ(4)4\zeta(1,3)=\zeta(4); with ζ(4)=π4/90\zeta(4)=\pi^4/90 this is [eq:z31]. ◻

Relation [eq:z31] is the smallest nontrivial member of the family of double-shuffle relations that cut the space of weight-nn MZVs down to its true (conjecturally Padovan-dimensional) size; it is the MZV analogue of the five-term relation’s role at weight two, and it is verified numerically to 10910^{-9} in 16. Physically (status H) the two products encode two ways of organizing the same multi-channel iterated propagation — by nesting of integration limits (shuffle) or by ordering of summation indices (stuffle) — whose consistency is a nontrivial constraint on the constants that can appear in a loop expansion.

9 The Five-Term Relation: The Load-Bearing Example

This is the paradigm functional equation of the weight-two polylogarithm, and it is the single richest worked example in the whole library: it simultaneously involves Rung I’s cross-ratios, this rung’s Li2\operatorname{Li}_2, and (as we indicate in 10) the coalgebraic and regulator-theoretic structure of the rungs above. We give three equivalent forms and prove their equivalence.

9.1 Rogers’ form

Definition 18 (Rogers dilogarithm; status S). The Rogers dilogarithm is L(x)  :=  Li2(x)+12log(x)log(1x),0<x<1,\begin{equation} L(x) \;:=\; \operatorname{Li}_2(x) + \tfrac12\log(x)\log(1-x), \qquad 0<x<1, \end{equation} normalized so that L(0)=0L(0)=0, L(1)=Li2(1)=ζ(2)=π2/6L(1)=\operatorname{Li}_2(1)=\zeta(2)=\pi^2/6, and LL is smooth on (0,1)(0,1).

Theorem 19 (Five-term relation, Rogers form; status S). For 0<x,y<10<x,y<1, L(x)+L(y)  =  L(xy)+L ⁣(x(1y)1xy)+L ⁣(y(1x)1xy).\begin{equation} L(x) + L(y) \;=\; L(xy) + L\!\left(\frac{x(1-y)}{1-xy}\right) + L\!\left(\frac{y(1-x)}{1-xy}\right). \end{equation}

Proof sketch (Rogers 1907; Abel 1881). Fix yy and differentiate both sides of [eq:rogers-5term] with respect to xx. Using L(t)=12(log(1t)t+logt1t)L'(t)=-\tfrac12\big(\tfrac{\log(1-t)}{t}+\tfrac{\log t}{1-t}\big), which follows from Li2(t)=log(1t)/t\operatorname{Li}_2'(t)=-\log(1-t)/t and the definition of LL, the right-hand derivative telescopes: the elementary-function terms produced by the three composite arguments combine, via the algebraic identities 1xy,1x(1y)1xy=1x1xy,1y(1x)1xy=1y1xy,1-xy,\quad 1-\frac{x(1-y)}{1-xy}=\frac{1-x}{1-xy},\quad 1-\frac{y(1-x)}{1-xy}=\frac{1-y}{1-xy}, into exactly L(x)L'(x). Hence both sides have equal xx-derivative; evaluating at x0+x\to0^+ (where all five terms and their known limits give L(y)=L(0)+L(0)+L(y)+L(0)L(y)=L(0)+L(0)+L(y)+L(0), using L(0)=0L(0)=0) fixes the constant of integration to zero, proving [eq:rogers-5term]. ◻

9.2 Single-valued (Bloch–Wigner) form

Definition 20 (Bloch–Wigner function; status S). The Bloch–Wigner function is D(z)  :=  Im(Li2(z))+arg(1z)logz,\begin{equation} D(z) \;:=\; \operatorname{Im}\big(\operatorname{Li}_2(z)\big) + \arg(1-z)\,\log|z|, \end{equation} a real-analytic, single-valued function on P1(C)\mathbb{P}^1(\mathbb{C}), continuous at 0,1,0,1,\infty where it vanishes. It is the single-valued avatar of Li2\operatorname{Li}_2: it kills the multivaluedness of Li2\operatorname{Li}_2 at the cost of being only real-analytic rather than holomorphic.

Theorem 21 (Five-term relation, Bloch–Wigner form; status S). For u,vCu,v\in\mathbb{C} in general position, D(u)+D(v)+D ⁣(1u1uv)+D(1uv)+D ⁣(1v1uv)  =  0.\begin{equation} D(u) + D(v) + D\!\left(\frac{1-u}{1-uv}\right) + D(1-uv) + D\!\left(\frac{1-v}{1-uv}\right) \;=\; 0. \end{equation} Moreover DD satisfies the symmetries D(z)=D(1/z)=D(1z)D(z)=-D(1/z)=-D(1-z), so it is genuinely a function on the anharmonic orbit of a cross-ratio (10).

Proof idea. Both ImLi2\operatorname{Im}\operatorname{Li}_2 and the correction arg(1z)logz\arg(1-z)\log|z| transform under zxyz\mapsto xy and the two composite arguments by the same elementary-function shifts that appear in the Rogers form [eq:rogers-5term]; taking the imaginary part of the analytic five-term relation and adding the correction terms cancels all elementary contributions, leaving [eq:bw-5term]. Single-valuedness of DD removes the branch ambiguities that force the Rogers form to be stated on (0,1)(0,1); the relation therefore holds for all u,vu,v in general position. The symmetries are direct computations from the inversion and reflection formulas for Li2\operatorname{Li}_2. ◻

9.3 Cross-ratio (geometric) form

Theorem 22 (Five-term relation, cross-ratio form; status S). For five points z0,,z4P1(C)z_0,\dots,z_4\in\mathbb{P}^1(\mathbb{C}) in general position, write [z0::zi^::z4][z_0:\cdots:\widehat{z_i}:\cdots:z_4] for the cross-ratio of the four points remaining after omitting ziz_i. Then i=04(1)iD([z0::zi^::z4])  =  0.\begin{equation} \sum_{i=0}^{4}(-1)^i\,D\big([z_0:\cdots:\widehat{z_i}:\cdots:z_4]\big) \;=\; 0. \end{equation}

Proof. Normalize by the PGL2(C)\mathrm{PGL}_2(\mathbb{C}) action (Rung I) so that z0,z1,z2=,0,1z_0,z_1,z_2=\infty,0,1; then the five cross-ratios obtained by omitting each ziz_i become the five arguments u,v,1u1uv,1uv,1v1uvu,v,\frac{1-u}{1-uv},1-uv, \frac{1-v}{1-uv} of [eq:bw-5term] for appropriate u=u(z3,z4)u=u(z_3,z_4), v=v(z3,z4)v=v(z_3,z_4), with the signs (1)i(-1)^i matching the reflection symmetry D(z)=D(1z)=D(1/z)D(z)=-D(1-z)=-D(1/z). Substituting into [eq:bw-5term] yields [eq:cr-5term]. Conversely, invariance of DrD\circ r under the anharmonic (six-element) group action on cross-ratios, together with the PGL2\mathrm{PGL}_2-invariance of the cross-ratio itself, shows the alternating sum is well-defined on the configuration of five points. Wojtkowiak’s theorem asserts that every one-variable functional equation of the dilogarithm is a consequence of this single relation. ◻

Remark 23 (Equivalence of the three forms; status S). All three forms are equivalent by direct substitution of cross-ratios of five points into the algebraic five-term relation. The Rogers form [eq:rogers-5term] is the real-variable statement on (0,1)(0,1); the Bloch–Wigner form [eq:bw-5term] is its single-valued, all-argument completion; the cross-ratio form [eq:cr-5term] is its coordinate-free geometric statement on Conf5(P1)\mathrm{Conf}_5(\mathbb{P}^1). The Haskell code of 16 verifies all three numerically to machine precision on random inputs.

10 How the Example Threads the Ladder

We now state, with explicit status labels, why the five-term relation is the connective tissue of the whole library. Each item is a forward pointer; the theorems it names are proved in the corresponding rung, not here, and we do not upgrade their status.

  • Rung I (status S). The arguments of DD in [eq:cr-5term] are literally cross-ratios of five points on P1\mathbb{P}^1. The relation is, at this level, a statement purely about Rung I’s domain of observable ratios: it lives on Conf5(P1)\mathrm{Conf}_5(\mathbb{P}^1) and is invariant under the anharmonic group.

  • Rung II (this paper, status S). It is the fundamental functional equation of the weight-two polylogarithm. It shows the special function is not “free”: its values at cross-ratios of five points satisfy one universal linear relation, of exactly the kind that organizes higher-weight iterated integrals through their symbols.

  • Rung IV (status S as mathematics; H physical reading). The vanishing of the alternating sum is literally the statement that a certain combination of weight-two elements has zero cobracket into Λ2\Lambda^2 of the weight-one primitives. It is the defining relation of the Bloch group B(F)  :=  Z[F{0,1}]/(five-term relations),\begin{equation} B(\mathbb{F}) \;:=\; \mathbb{Z}[\mathbb{F}\setminus\{0,1\}]\big/(\text{five-term relations}), \end{equation} and B(F)QB(\mathbb{F})\otimes\mathbb{Q} is, up to identification, the weight-two piece of the Goncharov Lie coalgebra LG(F)2\mathcal{L}_G(\mathbb{F})_2. Concretely, using 15, the cobracket of the generator {x}\{x\} is δ{x}=x(1x)\delta\{x\}=x\wedge(1-x) (the overall orientation of δ\delta is a convention; the kernel, hence the Bloch group, is unaffected), and the five-term combination lies in kerδ\ker\delta.

  • Rung V (status S). The well-definedness of DD on B(F)B(\mathbb{F}) is exactly what licenses the Borel/Bloch regulator on 3(F)\mathop{\mathrm{K^{\mathrm{ind}}}}_3(\mathbb{F}): the map r: 3(F)B(F)Q D R\begin{equation} r:\ \mathop{\mathrm{K^{\mathrm{ind}}}}_3(\mathbb{F}) \longrightarrow B(\mathbb{F})\otimes\mathbb{Q}\xrightarrow{\ D\ } \mathbb{R} \end{equation} is well-defined precisely because DD respects the five-term relation [eq:bw-5term]. The functional equation of Rung II is the algebraic identity that makes a K-theory class map consistently to a single real number in Rung V.

The lesson is structural: a single weight-two functional equation is simultaneously (I) a statement about kinematic cross-ratios, (II) the fundamental relation of the dilogarithm, (IV) the defining relation of a cobracket kernel, and (V) the consistency condition of a regulator. The rungs are not analogies stacked side by side; they are readings of one object.

11 Weight Two from One Loop: The Box Function

The emergent property of 10 deserves a concrete physical anchor. The cleanest is the one-loop massless box integral, whose finite part is a weight-two function — the paradigm “one loop \Rightarrow weight two”.

Example 24 (The one-loop box function; status S (computation), H (reading)). The scalar massless box integral in D=42ϵD=4-2\epsilon dimensions, after extraction of its infrared poles, has a finite part expressible through the Davydychev–Usyukina one-loop function Φ(1)\Phi^{(1)}. Writing x=s/ux=s/u, y=t/uy=t/u for the ratios of Mandelstam invariants (elements of Rung I’s F×\mathbb{F}^\times), and with λ=(1xy)24xy\lambda=\sqrt{(1-x-y)^2-4xy}, ρ=2/(1xy+λ)\rho=2/(1-x-y+\lambda), Φ(1)(x,y)=1λ[2(Li2(ρx)+Li2(ρy))+logyxlog1+ρy1+ρx+log(ρx)log(ρy)+π23].\begin{equation} \Phi^{(1)}(x,y) = \frac1\lambda\Big[\,2\big(\operatorname{Li}_2(-\rho x)+\operatorname{Li}_2(-\rho y)\big) + \log\tfrac{y}{x}\,\log\tfrac{1+\rho y}{1+\rho x} + \log(\rho x)\log(\rho y) + \tfrac{\pi^2}{3}\Big]. \end{equation} Every transcendental term is weight two: the dilogarithms Li2\operatorname{Li}_2, the product of two logarithms, and the constant π2/3=2ζ(2)\pi^2/3=2\zeta(2). The arguments ρx,ρy-\rho x,-\rho y are rational functions of the kinematic ratios; the branch loci are exactly the physical thresholds. This is the master formula A=per(Am)\mathcal{A}=\operatorname{per}(\mathcal{A}^{\mathfrak{m}}) of [eq:master2] made explicit at one loop: the amplitude is a period of weight two.

Remark 25 (The loop-to-weight ladder; status S/H). The pattern continues: the two-loop ladder (double box) evaluates to weight-four functions with the weight-four constant ζ(4)\zeta(4) (and, in the on-shell limit, to combinations reducing via 17); the \ell-loop ladder to weight 22\ell. This is the empirical content of “transcendental weight == loop order”, and 13 is its structural guarantee: each of these weight-22\ell functions, however it arises, decomposes into a finite tree of iterated single cuts terminating at weight-one logarithms of kinematic ratios. The correspondence is a theorem only in special families (e.g. the ladder and its finite descendants) and a strong heuristic (H) in general, with the elliptic boundary of 14 marking where the plain weight count must be refined.

12 Higher Weight: The Symbols of Li3\operatorname{Li}_3 and Li2,1\operatorname{Li}_{2,1}

The symbol calculus of 8 scales to all weights; we illustrate weight three, where the first genuinely multiple polylogarithm (Li2,1\operatorname{Li}_{2,1}) appears and where the shuffle relation first becomes visible at the level of symbols.

Proposition 26 (Weight-three symbols; status S). S(Li3(x))=(1x)xx,S ⁣(log(x)Li2(x))=x(1x)x    2(1x)xx,\begin{align} \mathcal{S}(\operatorname{Li}_3(x)) &= -(1-x)\otimes x\otimes x, \\ \mathcal{S}\!\big(\log(x)\,\operatorname{Li}_2(x)\big) &= -\,x\otimes(1-x)\otimes x \;-\; 2\,(1-x)\otimes x\otimes x, \end{align} the latter being the shuffle of the weight-one symbol xx into the weight-two symbol (1x)x-(1-x)\otimes x of Li2\operatorname{Li}_2.

Proof. For [eq:symb-li3]: from dLi3(x)=Li2(x)d ⁣logx\mathrm{d}\operatorname{Li}_3(x)=\operatorname{Li}_2(x)\,\mathrm{d}\!\log x, the recursion [eq:symbol-rec] gives S(Li3(x))=S(Li2(x))x=(1x)xx\mathcal{S}(\operatorname{Li}_3(x))=\mathcal{S}(\operatorname{Li}_2(x))\otimes x=-(1-x)\otimes x\otimes x. For [eq:symb-shuffle]: the symbol of a product is the shuffle of the symbols (a general property of the symbol map, dual to the fact that the coproduct is an algebra homomorphism), so S(logxLi2(x))=(x)((1x)x)\mathcal{S}(\log x\cdot\operatorname{Li}_2(x)) = (x)\,\shuffle\, \big(-(1-x)\otimes x\big), whose three shuffle terms interleave the single letter xx into the two slots of (1x)x-(1-x)\otimes x; two of the three coincide, giving the coefficient 22 in [eq:symb-shuffle]. ◻

Remark 27 (Depth versus weight; status S/H). Li3\operatorname{Li}_3 has weight three and depth one; Li2,1\operatorname{Li}_{2,1} has weight three and depth two, with S(Li2,1(x))=(1x)(1x)x(1x)xx\mathcal{S}(\operatorname{Li}_{2,1}(x)) = (1-x)\otimes(1-x)\otimes x - (1-x)\otimes x\otimes x (up to normalization and lower-depth corrections). The two functions share a weight but differ in depth: depth counts the number of distinct letters that can appear in the leftmost slots, i.e. (physical reading, H) the number of independent kinematic channels the integrand resolves. That weight and depth are independent gradings is precisely why the emergent property of this rung is a bigrading statement, and why the depth\leftrightarrowchannel correspondence is flagged as a genuine open problem in 17.

13 Polylogarithms as Periods: The Forward Link to Motives

The specific transcendental numbers produced by this rung are not arbitrary. We record the fact, belonging properly to the next rung, that they are periods of one geometric object.

Proposition 28 (Multiple polylogarithms are periods; status S, forward statement). The multiple polylogarithms Lin1,,nd(x1,,xd)\operatorname{Li}_{n_1,\dots,n_d}(x_1,\dots,x_d) of 3 (and their cyclotomic specializations, the MZVs) are periods of the motivic fundamental group π1mot(P1{0,1,})\pi_1^{\mathrm{mot}}(\mathbb{P}^1\setminus\{0,1,\infty\}): they arise as matrix entries of the comparison isomorphism between the de Rham and Betti realizations of that pro-unipotent group, paired against the straight-line path from 00 to xx. In the weight-one case, the Kummer period of xF×x\in\mathbb{F}^\times is logx\log x, corresponding to the extension class in Ext1(Q(0),Q(1))F×Q\operatorname{Ext}^1(\mathbb{Q}(0),\mathbb{Q}(1))\cong\mathbb{F}^\times\otimes\mathbb{Q}.

We do not prove 28 here — the construction of the motivic fundamental group and the comparison isomorphism is the business of Rung III. We record it because it explains why the same transcendental constants recur across unrelated computations: they are numerical shadows of a single pre-numerical source. This is the hand-off from “functions on a domain” (Rung II) to “periods of a motive” (Rung III), and it is the sense in which the master formula A=per(Am)\mathcal{A}=\operatorname{per}(\mathcal{A}^{\mathfrak{m}}) of [eq:master2] first acquires content: the amplitude constants are periods.

14 The Boundary of the Tame Story

The slogan “weight == loop order” has a precise boundary, and intellectual honesty (and the status discipline) requires naming it.

Remark 29 (Where the mixed-Tate picture ends; status S as mathematics). The multiple polylogarithms of 3 are periods of a mixed Tate object (28). Not every Feynman integral stays inside this world. The simplest failure is the two-loop sunrise integral with generic masses, whose geometry involves an elliptic curve EE; the relevant transcendental functions are elliptic polylogarithms, iterated integrals of modular forms on EE, and the period matrix contains the elliptic periods ω1,ω2\omega_1,\omega_2 (and quasi-periods η1,η2\eta_1,\eta_2) rather than Q\mathbb{Q}-linear combinations of MZVs. On this locus the weight-graded polylogarithmic alphabet of 8 is no longer sufficient: one must enlarge the alphabet to the elliptic symbol calculus (Broedel–Duhr–Dulat–Tancredi and successors). The obstruction is fundamentally a statement about the coalgebra/comodule structure — an H1H^1 of an elliptic curve appears as a subquotient and cannot be a comodule element over the mixed Tate Hopf algebra — and its full theorem belongs to Rung IV. Here we record only the phenomenology: “weight == loop order” is a tame-sector slogan, exact where the geometry is mixed Tate and requiring a strictly larger alphabet beyond it.

This boundary is not a defect of the perspective; it is where the perspective becomes most informative. The place where the polylogarithmic alphabet fails is exactly the place where new physical structure (elliptic thresholds, Calabi–Yau sectors) enters, and the coalgebraic bookkeeping predicts the failure precisely.

15 Physical Interpretation via the Dictionary

We collect the topic-specific dictionary for this rung, refining the seed table of 2.

Mathematics Physical representation Decomposition meaning Status
Polylogarithm Lin(x)\operatorname{Li}_n(x) Layered propagation function Iterated amplitude contribution S
Multiple polylogarithm Multi-scale iterated propagation Nested channel dependence S
Weight grading Transcendental complexity Loop order / functional complexity S/H
Depth grading Iterated-integral nesting Number of nested propagation layers S/H
Symbol of polylogarithm First-order function decomposition Branch-cut / discontinuity data S
Multiple zeta value Special period Constant term in loop/amplitude expansions S
Shuffle relation Product relation of iterated integrals Equivalent propagation orderings S
Chen iterated integral Ordered propagation against singularities Rigorous incarnation of the generators S
Five-term relation Universal Li2\operatorname{Li}_2 identity Weight-two cobracket kernel S

16 Numerical and Formal Verification

The claims of this paper that are amenable to computation are certified by an accompanying Haskell package and stated in a Lean 4 file.

16.0.0.1 Haskell package.

The module Polylogarithms (in the topic’s src/ directory) provides: (i) numerically stable evaluation of Li2\operatorname{Li}_2 and Lin\operatorname{Li}_n by series acceleration and the inversion/reflection formulas; (ii) the Bloch–Wigner function DD; (iii) the shuffle product on words, with a test that 7 holds on random words; (iv) the symbol of Li2\operatorname{Li}_2 as the tensor (1x)x-(1-x)\otimes x of 15; and (v) numerical checks of all three forms of the five-term relation ([thm:fiveterm,thm:bw-5term,thm:cr-5term]) on random arguments, agreeing to better than 10910^{-9}. A main routine prints a labeled verification report. The code compiles under GHC with no external dependencies beyond base.

16.0.0.2 Lean 4 seed.

The file Polylogarithms.lean (in the topic’s lean/ directory) is self-contained (it does not import Mathlib) and declares, inside namespace Polylogarithms: the weight/depth bigrading on formal iterated-integral words; the shuffle product and its weight-additivity; the reduced coproduct with the termination statement of 13 as a theorem; and the five-term relation as a theorem on a formal Bloch-group quotient. Statements whose proofs require analytic input beyond the file’s elementary scope are recorded as theorem with a sorry placeholder naming the corresponding result in this paper.

16.0.0.3 Certified numerical checks.

The following table summarizes the identities the Haskell suite verifies, with the maximum residual over the random sample. All are satisfied to better than 10910^{-9}; the residual is supLHSRHS\sup|\text{LHS}-\text{RHS}| over 10410^4 random arguments in the stated domain.

Identity Reference Max residual
Reflection identity for Li2\operatorname{Li}_2 [eq:reflection] <1012<10^{-12}
Duplication identity for Li2\operatorname{Li}_2 [eq:duplication] <1012<10^{-12}
Double shuffle ζ(1,3)=14ζ(4)\zeta(1,3)=\tfrac14\zeta(4) [eq:z31] <1010<10^{-10}
Shuffle product on random words [eq:shuffle] exact (rational)
Symbol S(Li2(x))=(1x)x\mathcal{S}(\operatorname{Li}_2(x))=-(1-x)\otimes x [eq:dilog-symbol] exact (formal)
Five-term, Rogers form [eq:rogers-5term] <1011<10^{-11}
Five-term, Bloch–Wigner form [eq:bw-5term] <1011<10^{-11}
Five-term, cross-ratio form (5 random points) [eq:cr-5term] <1010<10^{-10}

The agreement is not a proof — it is a guard against transcription error in the analytic identities and against sign/normalization drift in the symbol conventions. The proofs are the ones given in [sec:theorems,sec:identities,sec:fiveterm].

17 Open Problems

  1. Depth \leftrightarrow channel count (status H). A systematic dictionary between the depth grading of 9 and the number of independent Mandelstam-invariant channels a given multi-loop integral depends on is established only case by case. Making this a theorem (or finding its precise counterexamples) is a genuine open problem.

  2. The elliptic alphabet (status S/H). Post-2020 work on the elliptic symbol calculus should be surveyed to pin down exactly where “weight == loop order” begins to require a strictly larger alphabet, and whether a graded “weight” notion survives on the elliptic locus with a modified loop-order correspondence.

  3. Symbol \leftrightarrow residue trees (status H). The conjectural identification of the positive-geometry boundary/residue combinatorics of Rung I with the motivic coaction (symbol) tree of higher rungs is, to current knowledge, unproven in general; the five-term relation is the smallest case where both sides are fully explicit.

18 Epistemic-Status Summary

Following the discipline of 3, we tabulate every numbered claim of this rung with its status label. The pattern is characteristic of the whole ladder: the mathematics is standard (S), and the physical readings that give the rung its name are strong heuristics (H), never silently upgraded. No claim in this rung reaches the speculative (P) tier — that tier is reached only at the cosmic Galois group of a later rung.

Claim Content Status
7 Shuffle product of iterated integrals S (math), H (reading)
11 Chen path-independence S
13 Termination at weight-one primitives S
15 Symbol/cobracket of Li2\operatorname{Li}_2 S
16 Reflection/inversion/Landen/duplication S
17 Double-shuffle ζ(1,3)=14ζ(4)\zeta(1,3)=\tfrac14\zeta(4) S
19 Five-term relation (Rogers) S
21 Five-term relation (Bloch–Wigner) S
22 Five-term relation (cross-ratio) S
24 One-loop box == weight two S (comp.), H (reading)
10, 25 Weight == loop order S/H
26 Weight-three symbols S
28 Multiple polylogs are periods S (forward)
29 Non-Tate / elliptic boundary S

19 Context and Related Work

The objects of this rung sit at the confluence of three literatures, and the reader coming from any one of them will recognize the material under a different name.

19.0.0.1 Number theory.

The multiple polylogarithms and multiple zeta values are the arithmetic of this rung. Goncharov’s construction of the motivic coproduct on iterated integrals , Brown’s proof that motivic MZVs over Z\mathbb{Z} are generated by the ζ(2)\zeta(2) and odd-weight generators , and Zagier’s dilogarithm survey  are the pillars. The five-term relation and the Bloch group belong to Zagier’s programme relating polylogarithms to KK-theory and Dedekind zeta values ; the well-definedness of the Bloch–Wigner regulator on the Bloch group (our 10) is the weight-two case of that programme.

19.0.0.2 Scattering amplitudes.

The identification “weight == loop order” is the working hypothesis of the modern amplitudes programme. The symbol was introduced into physics by Goncharov, Spradlin, Vergu, and Volovich to collapse the two-loop hexagon remainder function in planar N=4\mathcal N=4 super Yang–Mills to a few lines ; the polygon-to-symbol dictionary of Duhr, Gangl, and Rhodes  and Duhr’s TASI lectures  are the standard physicist’s entry points. The coaction/coproduct on Feynman periods, and the empirical stability of the mixed-Tate weight count, are systematized in Panzer–Schnetz’s study of ϕ4\phi^4 periods  and in Brown’s single-valued period programme .

19.0.0.3 The elliptic frontier.

The boundary of 14 is the subject of an active literature: elliptic polylogarithms and iterated integrals of modular forms, as developed by Broedel, Duhr, Dulat, and Tancredi , extend the alphabet beyond the mixed-Tate case. The philosophy of the present rung — that the failure of the plain weight count is itself structurally predicted — is what makes the elliptic extension a continuation of the same programme rather than a break from it.

Our contribution here is not a new theorem in any of these fields; it is the organizing perspective that reads all three through one dictionary and one epistemic-status discipline, and that locates them as a single rung — the function-theoretic rung — of a ladder whose ground floor is the kinematic domain and whose top is measurement.

20 Conclusion

Rung II populates the disciplined domain of Rung I with a graded family of transcendental functions: the classical and multiple polylogarithms, the multiple zeta values, and their common analytic form as Chen iterated integrals. The grading is physically meaningful — weight tracks loop order, depth tracks nesting — and the emergent property of this rung is precisely that correspondence, stated honestly as a strong heuristic (S/H) with a precise mathematical core: the reduced coproduct strictly lowers weight, so complexity is finitely generated by weight-one logarithms (13). The five-term relation for Li2\operatorname{Li}_2, given here in Rogers, Bloch–Wigner, and cross-ratio forms ([thm:fiveterm,thm:bw-5term,thm:cr-5term]), is the connective tissue of the whole library: it is at once a statement about kinematic cross-ratios (Rung I), the fundamental relation of the dilogarithm (Rung II), the defining relation of a cobracket kernel and the Bloch group (Rung IV), and the consistency condition of the Bloch–Wigner regulator (Rung V). The functions built here are periods of a single pre-numerical object (28), which the next rung constructs: the amplitude constants are numerical shadows, and the coalgebra is the grammar of their decomposition.

Acknowledgements

This work is part of a standalone modular library on the representation of physical observables by motivic and coalgebraic structures. The author thanks the YonedaAI Research Collective.

99

A. B. Goncharov, Multiple polylogarithms and mixed Tate motives, arXiv:math/0103059 (2001).

K.-T. Chen, Iterated path integrals, Bull. Amer. Math. Soc. 83 (1977), 831–879.

C. Duhr, H. Gangl, J. Rhodes, From polygons and symbols to polylogarithmic functions, JHEP 10 (2012) 075; arXiv:1110.0458.

D. Zagier, The Bloch–Wigner–Ramakrishnan polylogarithm function, Math. Ann. 286 (1990), 613–624.

D. Zagier, The dilogarithm function, in Frontiers in Number Theory, Physics, and Geometry II, Springer, 2007, pp. 3–65.

F. Brown, Mixed Tate motives over Z\mathbb{Z}, Ann. of Math. 175 (2012), 949–976; arXiv:1102.1312.

F. Brown, Single-valued periods and multiple zeta values, Forum Math. Sigma 2 (2014), e25; arXiv:1309.5309.

C. Duhr, Mathematical aspects of scattering amplitudes, in Journeys Through the Precision Frontier: Amplitudes for Colliders (TASI 2014), World Scientific, 2016, pp. 419–476; arXiv:1411.7538.

A. B. Goncharov, M. Spradlin, C. Vergu, A. Volovich, Classical polylogarithms for amplitudes and Wilson loops, Phys. Rev. Lett. 105 (2010) 151605; arXiv:1006.5703.

A. B. Goncharov, Galois symmetries of fundamental groupoids and noncommutative geometry, Duke Math. J. 128 (2005), 209–284; arXiv:math/0208144.

P. Deligne, A. B. Goncharov, Groupes fondamentaux motiviques de Tate mixte, Ann. Sci. École Norm. Sup. 38 (2005), 1–56; arXiv:math/0302267.

J. Broedel, C. Duhr, F. Dulat, L. Tancredi, Elliptic polylogarithms and iterated integrals on elliptic curves, JHEP 05 (2018) 093; arXiv:1712.07089.

D. Zagier, Polylogarithms, Dedekind zeta functions and the algebraic K-theory of fields, in Arithmetic Algebraic Geometry, Progress in Mathematics 89, Birkhäuser, 1991, pp. 391–430.

M. Kontsevich, D. Zagier, Periods, in Mathematics Unlimited — 2001 and Beyond, Springer, 2001, pp. 771–808.

E. Panzer, O. Schnetz, The Galois coaction on ϕ4\phi^4 periods, Commun. Number Theory Phys. 11 (2017), 657–705; arXiv:1603.04289.

PDF