Appendix B Computation Scripts, Computations 37 to 63
Computation 37 · §18.3 · [NUMERICAL]
Analytical-numerical bridge validation at , .
Sets up the closed-form infinite- framework: the Leibniz identity [187] for the SU(2) generators acting on holomorphic Toeplitz symbols on . The op-norm at infinite Bergman truncation reduces to where . The correct pointwise op-norm for complex is with and ; the naive formula misses the term for complex symbols. Validation: at , , , , the matrix singular values give (analytical ) and (analytical ). The ratio matches the analytical -formula to four digits: numerical vs analytical. The framework is therefore an explicit constrained-optimisation sequence over indexed by .
Computation 38 · §18.3 · [NUMERICAL]
Infinite- L_comm gap at : cutoff-transition discontinuity.
Applies the validated framework (Computation 37) to compute the infinite- analytical gap at the Walsh-weight cutoff for , by grid-searching over the 3-real-parameter unit sphere in . Findings: (i) at fixed (), the analytical gap is , fitting an exponential at rate , not the finite- rate of Computation 36. The difference is supplied by the matched-truncation correction . (ii) At the cutoff transition (between and ), the analytical gap JUMPS from to , the closure-at- structure is not uniform in at infinite under the multiplicative bridge of Computations 32–36. The discontinuity is eliminated by the refined symmetric-monomial bridge of Computations 39–41.
Computation 39 · §18.3 · [NUMERICAL]
Refined symmetric-monomial bridge: closed-form ratio.
Constructs the symmetric bridge replacing the multiplicative Mosco-averaged bridge of Computations 32–36. All Walsh modes of the same weight get mapped to the same operator, so Mosco averaging is trivial. Closed-form ratio: , with the sup attained at on . At : ratio , exact closure at with zero parameters. For integer chosen to minimise gap, the residual is – across –.
Computation 40 · §18.3 · [NUMERICAL]
Two-monomial refined bridge: even- closure.
Adds a tunable parameter via the superposition . Numerical grid search yields essentially exact closure (gap ) at (i.e., even and ): at ; at ; at . Odd retain residual gap – in the two-monomial family.
Computation 41 · §18.3 · [NUMERICAL]
Three-monomial refined bridge: odd- closure.
Extends to with two free parameters per . Grid search closes odd : at , , , , ratio exactly; at , , , , ratio , gap . Combined with Computation 40, the three-monomial refined bridge closes L_comm with -independent and below at all confirmed , eliminating the cutoff-transition discontinuity exposed in Computation 38. The infinite- closure of the relaxed criterion is therefore demonstrated achievable; the rigorous proof is the remaining analytical step.
Computation 42 · §18.3 · [NUMERICAL]
Refined-bridge closure verification at higher .
Computation 41 had a verification gap at (search converged to a local minimum) and did not test . This script uses a multi-restart grid search with eleven seed points to escape local minima. Results: : , , , ratio exactly; : , , , gap ; : , , , gap ; : , , , gap ; : , , , ratio exactly. Combined with Computations 39–41, the refined symmetric-monomial bridge closes L_comm at every from 1 to 12 verified, with maximum gap at and exact closure at . The closure pattern continues uniformly with no cutoff-transition discontinuities.
Computation 43 · §14.2 · [PROOF]
Dixon-algebra foundation: octonion chain algebra on .
Sets up the Fano-plane octonion multiplication explicitly and verifies non-associativity . Left- and right-multiplication algebras each fill (matrix rank 64). Centre of is 1-dim (trivial), no non-trivial central idempotents. Foundational octonion structure used in Computations 53, 57–59.
Computation 44 · §14.2 · [PROOF]
multiplication setup.
Builds the multiplication table for the 64-dim real algebra , with 11 imaginary units (, , , , ) each squaring to . Non-associativity inherited from . Cites the structure result (real dim 512) as the natural ambient chain algebra for the generation decomposition (Computation 48).
Computation 45 · §14.2 · [PROOF]
Extended chiral idempotent on .
Constructs the extended chiral idempotent where is the Cl(0,6) volume element (). Verifies exactly, (half of ). Five of eleven imaginary-unit L-generators commute with : , matching Furey 2014’s structure for one generation. Used in §14.2 to fix the chiral half of each per-generation Hilbert space at dimension .
Computation 46 · §14.2 · [PROOF]
Three quaternionic sub-algebras containing fixed (structural seed for ).
Fixes and enumerates all quaternionic sub-algebras containing . Result: exactly 3 (, , ) one per Fano-plane line through . They partition into three disjoint 2-dim pairs. Count of 3 is -symmetric (same for any unit vector in ). Combined with the -valued asymmetric tension of P2, this is the combinatorial structure on that PST reads as , consistent with Furey 2014’s six--triplet decomposition of ; colour-vs-generation distinguishability on alone is non-trivial ( acts on as the fundamental, mixing the three sub-algebras) and is resolved in the ambient (Computation 48).
Computation 47 · §14.1 · [PROOF]
Per- Cl(0,2) chiral structure.
For each quaternionic sub-algebra , verifies generate a Cl(0,2) Clifford structure on with volume . Each chiral half is rank 4 on (4+4 split, structurally identical across all 3). Chiral idempotents each rank 4, but pairwise products (not mutually orthogonal, they overlap on the same 8-dim space, sharing the generation-blind core).
Computation 48 · §14.1 · [PROOF]
Three disjoint generation sectors in .
Resolves the colour-vs-generation distinguishability of in the Dixon-algebra ambient: the chain-algebra space decomposes as where (dim 16, generation-blind) and (dim 16, generation ). Verifies: for ; fills the full 64-dim space exactly. Per-generation Hilbert space has dim 32; chiral half = 16 states = one full generation of Standard-Model matter (15 SM + 1 right-handed neutrino). Inclusion-exclusion: exact.
Computation 49 · §14.2 · [PROOF]
-equivariance verification: on .
For the unit direction selected at modal sublimation, verifies that the cross-product-induced operator defined by satisfies on the 6-dim orthogonal complement . This realises the complex structure on that preserves on the -stabiliser . Underwrites the colour-SU(3)-as-stabiliser mechanism of §14.2 and the disjoint-generation-sector decomposition of Computation 48.
Computation 50 · §18.3 · [PROOF]
Rigorous single-mode L_round closure.
Verifies the elementary bound across , , . Cross-checks exactly. The ratio approaches from below, reaching at . Combined with Stirling, this proves the single-mode L_round closure as a rigorous theorem (not merely a numerical observation).
Computation 51 · §18.3 · [PROOF]
Block-decomposition identity and tail-sum reduction.
Diagonalises via spectral projectors . Verifies to machine precision that acts as on diagonal blocks and as on off-diagonal blocks . Establishes the closed-form identity for every and every . Consequence: where . For at , : and exactly. True asymptotic L_round rate: (the empirical of Computation 23 is a pre-asymptotic fit, crossover near ). Reduces the remaining analytical work to a closed-form bound on the off-diagonal block .
Computation 52 · §18.3 · [PROOF]
Closed-form for the Walsh-tail off-diagonal block.
SVD profile of across at cutoff . The dominant singular value matches exactly at every ; the dominant right singular vector is the -eigenvector of confined to weights , and the corresponding left singular vector is its counterpart. Direct calculation in this two-state model yields with (the eigenvalue on ) and (on each ). Simplification gives exactly, closing Lemma 2-prime on the -trivial component of . The second singular value (numerical here; analytically closed in Computations 54, 55) is bounded by an exponential gap from .
Computation 53 · §18.3 · [PROOF]
Algebraic identity .
Verifies to machine precision the algebraic identity , obtained by substituting (which follows from ) into the expansion of . Closed form on the weight-1 standard-rep input alone: with the eigenvalue on weight-2 states, achieved via the exact cancellation for when . The representation that commutes with is the fermionic-signed one; under it exactly (Computations 54, 55).
Computation 54 · §18.3 · [NUMERICAL]
Identification of the -irrep that saturates .
Implements the character-projector decomposition of under the fermionic-signed representation (the naive bit-permutation rep does not commute with because of the Jordan–Wigner strings; verified at versus to machine precision). Builds for each two-row irrep with , then computes within each isotypic block. Findings: the standard rep saturates exactly at ; every higher two-row irrep gives identically. The multiplicity of under is (Pieri on assigns it to and ), so the multiplicity-space matrix is ; numerically with singular values .
Computation 55 · §18.3 · [PROOF]
Closed-form on , completing Lemma 2-prime.
Exhibits the explicit -fixed vectors and and verifies to machine precision (for ) the algebraic identities , (no weight- leakage; the JW orderings on each triple cancel), with , with . Applying collapses the multiplicity-space matrix in the orthonormal basis , (with , ) to , rank with singular values . The saturating right singular vector is , the left singular vector is . Combined with Computation 52 this gives Lemma 2-prime as a theorem: exactly for every at .
Computation 56 · §18.3 · [PROOF]
Closed-form L_comm ratio for the single-monomial bridge (Lemma 5(a)).
Derives in closed form the L_comm ratio for the single-monomial bridge symbol on the holomorphic Toeplitz algebra of the weighted Bergman space (). Since ( is symmetric in ) and are antiholomorphic mirror pairs, is anti-diagonal in the Pauli basis with . The 1D optimisation on gives , verified to machine precision for . At the formula evaluates to , so the single-monomial bridge achieves exact L_comm closure at weight with zero refinement parameters. For the ratio differs from (undershoot at , overshoot at ; asymptotically ).
Computation 57 · §18.3 · [PROOF]
Lemma 5(b): existence of closing parameters for every via IVT.
Establishes the existence side of the refined-bridge closure for the 2-monomial family . The ratio is continuous in with (Computation 56) and . Since is strictly increasing in , the substrate target is bracketed by for a unique ; Bolzano then gives with exactly. Verifies the bracket condition for (extends to all via ) and computes the closing by IVT bisection: , , , , , all with R-target gap at machine precision. Theorem (Lemma 5(b)): for every , there exist and such that the 2-monomial bridge symbol achieves exact L_comm closure ratio .
Computation 58 · §18.3 · [PROOF]
Lemma 5(c): closed-form parametric expression for .
Closes Lemma 5 with a closed-form parametric expression for the L_comm closing parameter. The substitution parameterises the critical point on , and the critical-point equation gives for . Substituting back, the closing equation is an algebraic equation in of degree after rationalisation, so is an algebraic number and is a rational function of it. Verified for : the parametric expression matches Computation 57’s IVT-bisection values to six decimal places. The endpoint behaviour gives the single-monomial limit, the dominant- limit. Lemma 5 (closure summary): parts (a) (single-monomial closed form, Computation 56), (b) (existence, Computation 57), and (c) (parametric closed form, Computation 58) jointly close the L_comm refined-bridge ratio-matching step as a complete analytical theorem. The remaining open work for the full L_comm closure is structural: Berezin-transform compatibility, spectral-action invariance, and the uniform closure rate as .
Computation 59 · §18.3 · [NUMERICAL]
Lemma 7: uniform-in- closure of the refined bridge at finite (numerical).
Numerical investigation of the truncation gap of the exact 2-monomial bridge (with from Lemma 5(c)) on the truncated weighted Bergman space , as a function of and weight . Builds the SU(2) Dirac in the orthonormal monomial basis, applies the bridge , and measures . Findings: at the gap is essentially exactly (least-squares fit gives , with max residual ; the closed form derived in Computation 60 is exactly); at the gap is also but with -dependent constants (leading values , , at ) and a less clean two-term fit. At the matched scaling this implies at , polynomial L_comm closure rate, weaker than the exponential L_round rate but uniformly controlled. The full uniform-in- analytical bound for requires careful expansion of on the “boundary” modes (total degree close to ) of the truncated Bergman space.
Computation 60 · §18.3 · [PROOF]
Lemma 7(a): closed-form for the bare bridge.
Promotes Computation 59’s numerical fit to an exact closed-form theorem. For canonical Bergman weight on with orthonormal monomial basis restricted to , the holomorphic Toeplitz operators act as diagonal shifts (orthogonal target). Operator norms read off as maximum matrix elements: (maximiser for even ) and (maximiser , ). The commutator is anti-diagonal in the Pauli basis, giving the closed form exactly for even . Theorem (Lemma 7(a)): exactly, with Taylor expansion . Verified against Computation 59’s numerical SU(2)-Dirac measurement to decimal places at every . Closure rate at matched scaling : , polynomial in , weaker than the exponential L_round rate but uniformly controlled.
Computation 61 · §18.3 · [PROOF]
Lemma 6 (Berezin compatibility) closed: exactly.
Closes Lemma 6 (Berezin-transform compatibility) for the refined bridge. Theorem (Lemma 6): for holomorphic symbols on and the canonical weighted Bergman space , EXACTLY for every in the open ball. Proof: the reproducing-kernel adjoint identity follows from for all . Substituting, , using the standard for holomorphic . Applied to the refined bridge with holomorphic polynomial in : EXACTLY. On the truncated Bergman the identity holds up to an boundary correction that decays exponentially in for in the open ball. Verified numerically at every tested (interior) and every : gap below numerical precision at . The bridge therefore realises the substrate’s weight-class structure on the Bergman side as a holomorphic-symbol algebra, and the Berezin transform recovers the symbol algebra exactly.
Computation 62 · §18.3 · [PROOF]
Lemma 8 (spectral-action invariance corollary) at matched scaling.
Closes Lemma 8 (spectral-action invariance under the refined bridge ) as a corollary of Lemmas 5, 6, 7(a). Substrate Dirac has eigenvalues each with multiplicity ; Bergman SU(2) Dirac has Friedrich spectrum with multiplicity . Matched scaling: , so that the Bergman eigenvalue count up to equals = substrate Hilbert-space dimension. Theorem (Lemma 8): conditional on Lemmas 5, 6, 7(a), the Connes spectral action of the refined-bridge image is commensurate with the substrate spectral action at the matched scaling, up to a cutoff-function redefinition. Both sides scale as and their ratio is bounded independently of . Verified numerically with Gaussian cutoff for : exactly; constant (independent of ) at , at , at . Standard QGH-convergence statement applied to spectral actions. Together with Lemma 7(b)’s direct-gap closure, all six L_comm sub-lemmas are closed; that closure lands in Computation 65, after the fit-stability diagnostics of Computations 63 and 64 establish that the -extraction route is unreliable and must be replaced by the direct-gap bound.
Computation 63 · §18.3 · [NUMERICAL]
Lemma 7(b): leading for (2-parameter least-squares fit).
Numerical extraction of the leading constant in via a two-parameter least-squares fit on adapted to the bridge degree. Confirms Lemma 7(a)’s exactly with fit residual . Reports across . The fit stability of this extraction is interrogated in Computation 64; the foundational uniform-in- gap bound is established directly (without extraction) in Computation 65.