Low-Point Scalar-Grade Audit
Record
Date: 2026-08-12
Status: reproducible exact-arithmetic audit at four, six, and eight points. The independent all-multiplicity proof is entry 14.
Purpose
The reconstruction theorem in entry 11 says that the scalar associated-grade family must descend through the Parke--Taylor KK/BCJ quotient before inverse pairing can define an intrinsic half-object. This entry records the first explicit audit of that condition in this repository.
The implementation is
research/nima/check_j_reconstruction.py.
It uses only Python's standard library and exact rational arithmetic.
Direct scalar computation
For each cyclic order, the planar tree is generated as the sum over triangulations of the corresponding polygon. Every shifted propagator is expanded in , and the coefficient of is selected. No NLSM Feynman rule, CHY formula, or BCJ relation is used to produce the grade.
The number of scalar diagrams checked is
| Multiplicity | Triangulations |
|---|---|
| 4 | 2 |
| 6 | 14 |
| 8 | 132 |
Four-point normalization
For the canonical order,
In the same Parke--Taylor basis,
Thus the reconstructed logarithmic coordinate is
in these conventions. This fixes the overall sign of the audit. Because the cohomology is one-dimensional, it does not test basis independence.
Six-point scalar grade
The triangulation expansion gives the following expression directly in canonical planar variables:
This displays the three allowed three-particle poles. For example,
the product of the two corresponding four-point grades, up to the two inherited minus signs. The other two residues behave cyclically. The remaining line is the six-point contact term.
BAS pairing implementation
For two cyclic orders , the script computes
where is the relative winding number. This is the standard boundary-intersection formula for two Parke--Taylor forms. No full singular ordering matrix is inverted.
Two independent six-point reconstructions
The first reconstruction uses
and the second moves the fixed first label:
Each pairing matrix is and is inverted exactly. The resulting representatives are then paired against 27 distinct audit orderings, including orderings outside both input bases.
Result:
for all 27 orderings in the audit, with exact equality of rational numbers.
This is a genuine basis-change test. It would fail if the orderwise scalar grades did not assemble into one Parke--Taylor cohomology covector at six points.
Ordering-relation audit
The script first evaluates photon decoupling,
and finds exact zero in three deterministic generic rational samples at each of .
For , the script evaluates the fundamental relation
It vanishes exactly in three deterministic generic rational kinematic samples at each tested multiplicity. Samples with a zero test denominator are discarded rather than regularized.
It also evaluates the Kleiss--Kuijf shuffle identity
for five ordered splits at six points and seven ordered splits at eight points. All vanish exactly. These KK checks audit the primary-relation closure used in entry 14; that closure is an all-order algebraic theorem and does not depend on finite sampling.
Finally, the script verifies coefficient by coefficient the exceptional -orbit tensor identity used by the quadratic soft-contact lemma in entry 14. This checks the only six-point case not reduced immediately by a common omitted label or a four-cycle split.
The eight-point check is useful because it sums 132 scalar triangulations for every ordering and tests an overlapping-channel amplitude. It remains a finite check, not a proof of the full BCJ ideal.
Reproduction
From the repository root run:
python research/nima/check_j_reconstruction.py
The expected final line is:
all exact low-point checks passed
What this establishes
- the alternating scalar-grade algorithm reproduces the stated four- and six-point formulas;
- normalization is fixed at four points;
- the first nontrivial inverse-pairing reconstruction is independent of two explicit BCJ bases;
- photon decoupling survives exact checks through eight points;
- the fundamental BCJ relation survives exact checks through eight points;
- representative KK shuffles survive exact checks at six and eight points;
- the exceptional six-point quadratic contact identity holds exactly;
- six-point physical residues factorize before any inverse-pairing computation.
What it does not establish
- by itself, the all-multiplicity proof that the scalar grade annihilates the full KK/BCJ kernel; that proof is given analytically in entry 14;
- equality with without the perfect-pairing/period argument of entry 11;
- a canonical scalar-surface boundary map;
- half-object-level Jordan strictification;
- loop or modular completion.
Next falsification target
Move from ordering relations to the six-point channel quotient. Verify the leading inverse-BAS block and the induced residue described in entry 13. This tests factorization naturality rather than repeating the now-proved descent relation.