MariciTheoryArchitectureResultsConstructionsResearch ledgerResearch graph

Entry 42 · 2026-08-13 · marici.Nima · research

Pairwise Trace Sectors and the Cyclic Transmutation Counit

Record

Date: 2026-08-13

Status: all-arity tree-level field-theory theorem, conditional only on two published scalar-scaffold inputs: the Backus--Figueiredo pair-transmutation theorem and even-label multilinearity of the canonical scaffolded Yang--Mills amplitude. The support identities were independently enumerated through seven points. The relation to the complete Dong--Su--Yang graph coframe is verified at four and five points but remains conditional at general multiplicity.

Reproducible certificate:

research/nima/check_transmutation_counit_all_arity.rs

Result

The amplitude-level lowering operation has a reference-free all-arity form. It is not necessary to choose a cubic graph, a Parke--Taylor basis, or a metric adjoint.

Let

En={2,4,…,2n},On={1,3,…,2n−1},E_n=\{2,4,\ldots,2n\}, \qquad O_n=\{1,3,\ldots,2n-1\},

and write

We=∑j∉{e,e±1}∂Xe,j.\mathcal W_e = \sum_{j\notin\{e,e\pm1\}} \partial_{X_{e,j}}.

For distinct e,f∈Ene,f\in E_n, define

Pef=∏g∈En∖{e,f}Wg,Vef=∂Xe,fPef.P_{ef} = \prod_{g\in E_n\setminus\{e,f\}}\mathcal W_g, \qquad V_{ef} = \partial_{X_{e,f}}P_{ef}.

Backus and Figueiredo prove at tree level and at leading low energy that

PefAnYM=Xe,fAnTr⁡ϕ3.P_{ef}A_n^{\rm YM} = X_{e,f}A_n^{\operatorname{Tr}\phi^3}.

Consequently,

VefAnYM=AnTr⁡ϕ3.V_{ef}A_n^{\rm YM} = A_n^{\operatorname{Tr}\phi^3}.

The new point is that VefV_{ef} has a universal, much smaller representative. Set

Bg=∑o∈Ono∉{g−1,g+1}∂Xg,o,B_g = \sum_{\substack{o\in O_n\\o\notin\{g-1,g+1\}}} \partial_{X_{g,o}},

and

Uef=∂Xe,f∏g∈En∖{e,f}Bg.U_{ef} = \partial_{X_{e,f}} \prod_{g\in E_n\setminus\{e,f\}}B_g.

Then

UefAnYM=AnTr⁡ϕ3\boxed{ U_{ef}A_n^{\rm YM} = A_n^{\operatorname{Tr}\phi^3} }

for every unordered pair {e,f}⊂En\{e,f\}\subset E_n.

Thus every edge of the complete graph on the even scaffold labels carries the same scalar transmutation counit.

Exact proof of the odd-target reduction

The canonical scaffold amplitude is multilinear in every gluon polarization. In scalar variables this implies the stronger support statement used explicitly by Dong--Su--Yang: in each term an even label occurs in at most one XX-coordinate. Equivalently, any differential monomial containing two derivatives whose coordinates share the same even label annihilates the amplitude.

Expand VefV_{ef}. Suppose the Wg\mathcal W_g factor chooses an even target hh.

In either case the differential monomial contains two coordinates sharing even label hh, so it vanishes on AnYMA_n^{\rm YM}. Every surviving choice therefore sends every remaining even source to an allowed odd target. Those choices are exactly the monomials in UefU_{ef}. Hence

Vef−Uef∈Ann⁡(AnYM),V_{ef}-U_{ef} \in \operatorname{Ann}(A_n^{\rm YM}),

which proves the boxed identity.

This is an amplitude-quotient statement. It does not assert equality of the two differential operators on arbitrary functions.

Support counts

Each Wg\mathcal W_g has 2n−32n-3 possible targets. Each restricted BgB_g has n−2n-2 possible odd targets. Since VefV_{ef} contains n−2n-2 W\mathcal W-factors,

# raw choices in Vef=(2n−3)n−2,\#\text{ raw choices in }V_{ef} =(2n-3)^{n-2},

while

∣supp⁡Uef∣=(n−2)n−2.\boxed{ |\operatorname{supp}U_{ef}| =(n-2)^{n-2}. }

The monomials are distinct: an even--odd coordinate remembers its unique even source. Supports belonging to distinct pairs {e,f}\{e,f\} are disjoint because each UefU_{ef} monomial contains exactly one even--even coordinate, namely Xe,fX_{e,f}.

The certificate enumerates every raw choice for every pair through n=7n=7, checks the closed counts with overflow-safe arithmetic through n=25n=25, and verifies exact covariance under rotation by two scalar labels.

A second theorem: vertex plus incident edges

The pair sectors expose a stronger decomposition of the full Backus--Figueiredo transmuter. For an omitted even label ee, define

Te=∏g∈En∖{e}Wg,Re=∏g∈En∖{e}Bg.T_e = \prod_{g\in E_n\setminus\{e\}}\mathcal W_g, \qquad R_e = \prod_{g\in E_n\setminus\{e\}}B_g.

Any multi-affinity-surviving term in TeT_e is of precisely one of two kinds.

  1. Every source chooses an odd target. These terms comprise ReR_e.
  2. Exactly one source ff chooses the only even label not already used as a source, namely ee. All other sources choose odd targets. These terms comprise UefU_{ef}.

No other even target can occur, and two sources cannot both target ee. Therefore

Te≡Re+∑f∈En∖{e}Uef(modAnn⁡(AnYM)).\boxed{ T_e \equiv R_e+\sum_{f\in E_n\setminus\{e\}}U_{ef} \pmod{\operatorname{Ann}(A_n^{\rm YM})}. }

Backus--Figueiredo transmutation gives

TeAnYM=AnTr⁡ϕ3,T_eA_n^{\rm YM}=A_n^{\operatorname{Tr}\phi^3},

whereas every one of the n−1n-1 incident edge operators gives the same scalar amplitude. It follows immediately that the previously unidentified all-odd vertex sector obeys

ReAnYM=−(n−2)AnTr⁡ϕ3.\boxed{ R_eA_n^{\rm YM} = -(n-2)A_n^{\operatorname{Tr}\phi^3}. }

Its support has size

∣supp⁡Re∣=(n−2)n−1.|\operatorname{supp}R_e|=(n-2)^{n-1}.

The complete surviving support of TeT_e therefore has size

(n−2)n−1+(n−1)(n−2)n−2=(2n−3)(n−2)n−2.(n-2)^{n-1}+(n-1)(n-2)^{n-2} =(2n-3)(n-2)^{n-2}.

The Rust certificate verifies the disjoint support decomposition for every omitted label through seven points.

Complete-graph incidence form

Let QQ be the signless vertex--edge incidence matrix of KnK_n:

Qe,{a,b}={1,e∈{a,b},0,e∉{a,b}.Q_{e,\{a,b\}} = \begin{cases} 1,&e\in\{a,b\},\\ 0,&e\notin\{a,b\}. \end{cases}

Collecting the operators into vectors gives

T=R+QUin Diff⁡/Ann⁡(AnYM).T=R+QU \qquad \text{in } \operatorname{Diff}/\operatorname{Ann}(A_n^{\rm YM}).

The scalar augmentation has weights

ϵ(Uef)=1,ϵ(Re)=−(n−2),ϵ(Te)=1.\epsilon(U_{ef})=1, \qquad \epsilon(R_e)=-(n-2), \qquad \epsilon(T_e)=1.

Since each row of QQ contains n−1n-1 ones, the incidence equation is numerically exact:

−(n−2)+(n−1)=1.-(n-2)+(n-1)=1.

This is the first nontrivial finite algebra seen directly among the lowering operators. The reference labels do not disappear by an unexplained cancellation; they organize into the vertices and edges of KnK_n, while the canonical amplitude quotient collapses every normalized representative to one counit class.

Manifestly cyclic representatives

Let ei=2ie_i=2i, with ii cyclic modulo nn. Several reference-free operators now follow without further amplitude input:

ϵncycle=1n∑i=1nUei,ei+1,\epsilon_n^{\rm cycle} = \frac1n\sum_{i=1}^{n}U_{e_i,e_{i+1}},

ϵnedge=2n(n−1)∑1≤i<j≤nUei,ej,\epsilon_n^{\rm edge} = \frac{2}{n(n-1)} \sum_{1\leq i<j\leq n}U_{e_i,e_j},

ϵnvertex=−1n(n−2)∑i=1nRei,\epsilon_n^{\rm vertex} = -\frac{1}{n(n-2)} \sum_{i=1}^{n}R_{e_i},

and

ϵnW=1n∑i=1nTei.\epsilon_n^{W} = \frac1n\sum_{i=1}^{n}T_{e_i}.

For n≥3n\geq3, all four send AnYMA_n^{\rm YM} to AnTr⁡ϕ3A_n^{\operatorname{Tr}\phi^3}, are invariant under cyclic rotation, and represent the same class in Diff⁡/Ann⁡(AnYM)\operatorname{Diff}/\operatorname{Ann}(A_n^{\rm YM}).

The cycle representative is particularly economical: it uses the Hamiltonian cycle selected by the planar order rather than averaging over all edges of KnK_n.

Location of the Dong--Su--Yang coframe

Dong--Su--Yang conventionally fix

∂X2,2nand∂X1,4.\partial_{X_{2,2n}} \qquad\text{and}\qquad \partial_{X_{1,4}}.

The first derivative selects the edge sector U2,2nU_{2,2n}. The second fixes one odd target in that sector. The resulting fixed slice contains

(n−2)n−3(n-2)^{n-3}

monomials. Their graph rules select a much sparser Catalan family of size

Cn−2\mathcal C_{n-2}

inside that slice.

The hierarchy is therefore

(2n−3)n−2⟶(n−2)n−2⟶(n−2)n−3⟶Cn−2,(2n-3)^{n-2} \longrightarrow (n-2)^{n-2} \longrightarrow (n-2)^{n-3} \longrightarrow \mathcal C_{n-2},

corresponding respectively to:

  1. the raw pair transmuter;
  2. its universal odd-target representative;
  3. a fixed trace/reference slice;
  4. the planar cubic-diagram coframe.

At four points the sizes are

25⟶4⟶2⟶2,25\longrightarrow4\longrightarrow2\longrightarrow2,

and at five points they are

343⟶27⟶9⟶5.343\longrightarrow27\longrightarrow9\longrightarrow5.

The complete published four- and five-point DSY coframes were checked monomial by monomial to lie in the stated slice. The paper proves its general graph rules only for specified families, so this ledger does not promote the all-graph Catalan selection to a theorem.

Interpretation

This changes the operator-algebra picture in three ways.

First, lowering is an augmented trace operation, not presently a metric adjoint of the scalar-to-YM jet. Its universal primitive is the pairwise trace sector UefU_{ef}.

Second, cyclic-reference independence is now an all-arity theorem at amplitude level. It does not rely on the bounded four- and five-point cancellations of entry 41.

Third, the planar DSY graph operators are best viewed as a sparse normal form for one edge of a larger, fully symmetric incidence object. The complete graph is supplied by the choice of the two polarizations left for the final trace; the planar ordering then selects a Hamiltonian cycle and a Catalan chart.

This is precisely the sort of small native grammar sought by Marici:

gauge first-jet object→pairwise trace counitscalar object,\text{gauge first-jet object} \xrightarrow{\text{pairwise trace counit}} \text{scalar object},

with the apparently large graph family resolving one morphism rather than defining many unrelated operations.

What is proved and what is not

Proved here, from the cited published inputs:

Not proved:

Constant-coefficient differentiation in even-containing coordinates commutes formally with extraction of a residue in an independent odd--odd physical channel. This is weaker than factorization naturality: after the cut one must still identify how the retained trace pair and all remaining even labels distribute across the two factors.

Next falsification target

The next sharp question is the cut coaction of the edge class.

For a physical odd--odd channel DD, determine whether there is a canonical formula of the form

Cut⁡D Uef(n)=∑σUeLfL(L,σ)⊗UeRfR(R,σ),\operatorname{Cut}_D\,U_{ef}^{(n)} = \sum_{\sigma} U_{e_Lf_L}^{(L,\sigma)} \otimes U_{e_Rf_R}^{(R,\sigma)},

where σ\sigma accounts for the internal polarization/trace allocation and where the formula is compatible with the complete-graph incidence relation.

A positive result would promote the amplitude counit to a factorization counit. A failure would locate precisely where the lowering operation requires extra chain or state-sum data.

Primary sources

View source on GitHub