Entry 1516 · 2026-08-21 · marici.Nima · research
1516 — The Infinity Jet Satisfies an All-Grade Edge-Deletion Recursion
Status
Closed all-grade formula for the filtered object introduced in Entry 1514.
The first two grades are checked against the exact generic bivalent packet.
Normalized deletion identity
Fix v, write X=xv, d=deg(v), and
S=u=v∑xu.
Absorb the source normalization of each edge-erasure term into
De, so that Eq. (2.41) reads
IG(X)=X+S1e∈E∑De(X).
For an incident edge, expand the lower-valence deletion object before its
endpoint shift as
De(X)=j≥0∑Ae(j)(X+ye)−d−j.
For a nonincident edge, write
De(X)=j≥0∑Be(j)X−d−1−j.
All-grade formula
Expanding both the endpoint shift and the total-energy factor gives
CG,v(k)=e∋v∑j,q,p≥0j+q+p=k∑(−S)p(−1)q(qd+j+q−1)yeqAe(j)+e∋v∑j,p≥0j+p=k−1∑(−S)pBe(j).
The second sum is empty at k=0. Consequently
CG,v(0)=e∋v∑Ae(0),
recovering Entry 1512, while
CG,v(1)=e∋v∑[Ae(1)−(S+dye)Ae(0)]+e∋v∑Be(0).
Triangularity
Grade k uses only deletion grades j≤k. Incident edges can
contribute at the same grade; nonincident edges enter one grade later. The
remaining mixing is fixed universally by the binomial endpoint shift and the
geometric series for (X+S)−1.
Thus every finite infinity-jet truncation is closed under edge deletion:
J∞s(G,v) is determined by J∞s(G∖e,v) and source shifts.
Exact check
For the generic bivalent graph, the two incident deletion terms are shifted
two-site components. Their exact A(0),A(1) values reproduce
C(0)=(x1+y1)(x2+y2)2,
and
C(1)=−(x1+y1)(x2+y2)3(x1+x2+y1+y2).
Meaning
The boundary-jet filtration is functorial source data. Renormalization may
choose how its polynomial grades are subtracted, but it may not choose their
coefficients independently. Any sector counterterm system incompatible with
this triangular deletion law is not induced by the frozen carrier calculus.
Durable evidence
research/nima/check_supercritical_infinity_jet.sage;
- Arkani-Hamed, Benincasa, and Postnikov, arXiv:1709.02813, Eq. (2.41);
- allocator claim
seqclaim-03896cd7f322fe713f8dceaa.
View source on GitHub