128 runnable examples organized by theme. Every example derives from the
nodal equation ∂EPI/∂t = νf · ΔNFR(t), the 13 canonical operators, grammar
U1–U6, and the structural field tetrad (Φ_s, |∇φ|, K_φ, ξ_C).
Each file keeps a stable global number as its identifier (the number does not change when an example moves); the folder gives the theme. Run any example directly, e.g.:
python examples/01_foundations/01_hello_world.py
python examples/09_millennium/109_p_vs_np_coherence_synthesis.pytnfr resolves from the editable install (pip install -e .), so examples run
from any location.
Basic tutorials: nodes, operators, grammar, coherence, topologies, the SDK.
01_hello_world.py — your first nodal network02_musical_resonance.py — phase synchronization as resonance03_network_formation.py — building coupled networks04_operator_sequences.py — grammar U1–U6 in action05_coherence_evolution.py — C(t) dynamics06_network_topologies.py — TNFR across graph structures07_phase_transitions.py — bifurcation dynamics (U4)08_emergent_phenomena.py — collective behaviors09_visualization_suite.py — dynamic plotting10_simplified_sdk_showcase.py — the Simple SDKClassical/quantum correspondences, conservation, gauge, variational, tetrad, and operator–tetrad synergies.
11–15 — classical limit, mechanics, quantum mechanics, uncertainty, kinematics17 conservation law · 26 gauge structure · 27 variational principle28 dissipative systems · 29 Lyapunov stability · 30 self-optimization31 constants basis · 33 complex-field unification34 conservation protocol · 35 tetrad irreducibility · 36 grammar violations37 operator–tetrad synergy · 38 grammar-energy landscape · 39 nodal decomposition115 operator-contract fidelity audit (measured, not asserted)The integer-NFR nodal pulse reading of ζ: von Mangoldt prime ladder, Weil
formula, Li–Keiper, and the pulse-phase attack surface (S(T) as the pulse
phase, the critical line as its coherence axis). Program open (Riemann
Hypothesis).
41–58 — von Mangoldt → oscillatory correction157 — the nodal-pulse phase attack surfaceDirichlet L-functions and the χ-twisted parity layer (GL(1)).
59–63 — Dirichlet L: construction, continuation, Hamiltonian, Weil, Li–Keiper64–76 — twisted positivity → twisted oscillatory correctionREMESH-∞ residue split + the twelve type-signature / closure-discipline demos.
77_remesh_infinity_residue_split_demo.py78–89 — νf / EPI / φ / ΔNFR / REMESH-window / Δφ_max / coupling / tetrad / currents / aggregates / U-rules / catalog signaturesThe two-face reading: linear NS is the diffusive (over-damped) projection of the
substrate wave (ν_f = ν), so blow-up is a purely nonlinear K_φ cascade
(vortex stretching), not a linear resonance. Faithful pseudo-spectral
Taylor–Green + the nonlinear cascade frontier vs Reynolds. Clay open.
158 — two-face reading + nonlinear K_φ cascade frontierPrimality ⟺ ΔNFR = 0, Goldbach, prime families/orbits, numbers as a coupled network, and emergent chemistry/particles from the same criterion.
40 arithmetic number theory · 94–97 generative / spectral / Goldbach100–102 prime families, numbers-as-network, nodal flow on numbers116 νf-embedded prime visibility (arithmetic via νf only; diffusion echoes ANY νf carrier — prime ≈ arbitrary set ≈ Ω(n)/log n — substrate blind)146 primality as grammatical inertness (bridges the grammar thread 139-145 to number theory: every operator acts through the single nodal rule ∂EPI/∂t=νf·ΔNFR, so on arithmetic nodes — where ΔNFR is the §4 primality field, prime ⟺ ΔNFR=0 — primes are the KERNEL of the capacity (νf) lever, frozen under every grammatical program; M1 prime ⟺ ΔNFR=0 ⟺ C=1 maximal coherence (exact, 0 mismatches); M2 νf-lever is a scalar gain, composite drift = (νf gain)×pressure exactly (27/27), every prime in the kernel; M3 the U2 convergence target ΔNFR→0 = C→1 IS primality, C decreases monotonically with Ω (1.0→0.24→0.13→0.089→0.085, coherence debt = factorization complexity), a prime needs the EMPTY word (the identity of the star-free syntactic monoid, ex 145). HONEST: restates the §4 primality theorem through the grammar dynamics — the NEW part is the grammar-lens reading; arithmetic ΔNFR is per-node not graph diffusion so canonical graph operators are not used; not new number theory, closes no open problem)147 numbers as words / dual-lever as monoid gradings (deepens 146 to its algebraic core, uniting physics + grammar + number theory: by the FTA the multiplicative monoid (ℕ,×) is the FREE COMMUTATIVE MONOID on primes — numbers ARE words (primes=letters, 1=empty word, Ω=word length, ×=concatenation). M1 the coherence debt ΔNFR splits by COMPOSITION LAW: the factorization channel ζ(Ω−1) is ADDITIVE — a monoid homomorphism, P_Ω(mn)=P_Ω(m)+P_Ω(n)+ζ exact (residual 0), the free-monoid backbone — while the divisor η(τ−2) and abundance θ(σ/n−…) channels are MULTIPLICATIVE (τ,σ multiplicative on coprime, the divisor lattice); ΔNFR = 1 additive + 2 multiplicative channels. M2 multiplying by a prime is the UNIT DESTABILIZER (+ζ per letter; 1→2→6→30→210 raises C 1.0→0.21→0.096→0.049), and the additive channel ALONE detects primality (Ω=1 ⟺ prime, 0 mismatches in [2,80]; the §4 theorem is 3× redundant but only Ω is the clean free-monoid backbone). M3 the DUAL-LEVER (ex 37/130) restricted to arithmetic IS the two canonical additive gradings of the free monoid: COUNT Ω (→ ΔNFR pressure) and SIZE log n (→ νf capacity, ex 94 atom log p), both monoid homomorphisms (ℕ,×)→(ℝ,+) — Ω = how many letters, log = how big the word. HONEST: Ω-additive/τσ-multiplicative/primes-irreducible/FTA are CLASSICAL; the NEW part is the lens reading (3 channels split by composition law, additive channel = primality-bearing backbone, dual-lever = the two gradings); fixes the dictionary physics dual-lever ↔ free-monoid gradings ↔ primality across 3 modules; not new number theory, closes no open problem)Emergent symplectic substrate, structural diffusion/transport, polarization, Helmholtz–Hodge orthogonality, generating structure, flow prediction.
98 symplectic substrate · 99 structural diffusion
103–105 substrate↔Riemann, NS-is-not-Riemann, NS enstrophy
106 polarization · 107 orthogonal structure · 108 generating structure
112 structure predicts the coherence flow · 113 overdamped projection bridge · 114 substrate conserved quantities · unified_fields_showcase.py
117 emergent geometry on the residue graph (Paley factorization, honest: diffusion spectrum carries the factor cosets, symplectic substrate is blind; unifies factorization-lab ↔ emergent geometry)
118 where the emergent operator diverges from the classical Laplacian (residue graphs are regular Cayley → identical; on irregular graphs L_rw IS the Shi–Malik degree-aware Ncut → more balanced cuts)
119 the phase sector — directed residue operator (n≡3 mod4 → Paley tournament → complex spectrum; "3 distinct eigenvalues ⟺ odd prime" 58/58, resolves prime powers, phase encodes √n; extends Reading B to all odd primes, still e–π/Fix(G)^⊥ bounded)
120 the symmetry wall (vertex-transitivity of the residue Cayley digraph confines arithmetic to the spectrum; double dissociation — spectrum sees the QR arithmetic, per-node symplectic substrate is blind; same Fix(G)^⊥ wall as the paused Riemann program, explained not crossed)
121 can a canonical symmetry-break cross the wall? (B2-P2 lever, measured NEGATIVE: the nodal equation has no per-node weight slot; structure-derived νf is uniform on the vertex-transitive graph; arithmetic-injected νf is circular echo (shuffled control identical) — confirms the analytical B0★-β-P2 closure at the NT level)
122 factorization in the phase sector (the complex directed spectrum completes example 117's partial factor-coset recovery: the factor coset is a CRT Fourier mode (eigenvector of both operators); real symmetric sector 8/10 (misses 51, 91 via degenerate eigenpairs), complex directed sector 10/10 (Gauss-sum eigenvalues isolate the mode); re-expresses CRT period structure, O(√n) scan, no speedup)
123 the symmetry-sector decomposition (CAPSTONE: L_rw is equivariant under Aut(G), so by Schur it block-diagonalizes into Fix(G)⊕Fix(G)^⊥ with dim Fix(G)=#orbits; per-node substrate lives in Fix(G) (orbit-constant, ex-120 blindness is the vertex-transitive corollary), discriminating spectrum in Fix(G)^⊥; measured across 5 symmetry groups; the single structure behind the whole 117–122 arc and the Riemann residual)
TNFR-native reformulations that localise the obstruction, not solutions.
109_p_vs_np_coherence_synthesis.py — synthesis vs verification (Branch B)110_bsd_rank_structural_pressure.py — rank as structural pressure (Branch B)111_hodge_discrete_and_honest_gap.py — discrete Hodge, blindness (Branch B3-leaning)90 phase-gate monitor · 91 breast-cancer · 92 wine-quality · 93 structural interfacepytorch_cuda_demo.py — GPU backendNote on the two 77–86 series: 05_type_hygiene/ and 06_navier_stokes/
were two programmes developed in parallel that previously shared the numbers
77–86. The thematic folders resolve that collision; the global numbers are
preserved as stable identifiers.
148149 the Riemann Hamiltonian P14 is the capacity-arm operator (closes the loop of 148: identifies the canonical TNFR-Riemann Hamiltonian P14 as EXACTLY the capacity-arm operator of the dual-lever — the structural reason it sees the primes while the pressure substrate is blind. M1 every P14 node (p,k) carries νf = k·log p (the CAPACITY arm, 20/20 exact) and ΔNFR = 0 (PRESSURE neutral, 20/20) — P14 puts ALL structural information on the capacity lever, the same axis (log=νf) carrying von Mangoldt + the zeros (ex 148). M2 inter-prime orthogonality = the free-monoid freedom (ex 147): the prime ladders are disconnected (n_primes independent components, each one prime's ladder), so distinct primes are independent invariant subspaces = the Euler product at the operator level = the free-monoid generators (primes don't couple). M3 the capacity operator reproduces von Mangoldt: P14's weighted trace = Z_vM(s)=ΣΛ(n)n⁻ˢ=−ζ'/ζ(s) (P12) to machine precision (certificate spectrum error 0, trace rel-error ~1e-16), and the zeros are its poles (ex 148 M2). PARADIGM: P14 lives on CAPACITY (sees the zeros), the per-node substrate on PRESSURE (smooth, blind) — the two operators are on the two arms of the dual-lever, unifying physics νf-capacity ↔ free-monoid size-grading ↔ the prime-ladder Hamiltonian. HONEST: P14 already exists/reproduces von Mangoldt; the NEW part is the unifying reading (P14 = capacity-arm operator) that EXPLAINS the 148 capacity-sees/pressure-blind dichotomy; no new operator, does NOT advance RH (G4 open, S(T)∈Fix(S_n)^⊥ still the obstruction, program PAUSED at T-HP))153 structural-frequency rank of arithmetic diffusion networks / two-arm primality + cyclotomy (unifies the QR residue-spectrum arc 117-123 with the dual-lever/free-monoid threads 146-149 via the canonical structural-diffusion operator L_rw=I−D⁻¹W — the ΔNFR EPI channel — on arithmetic Cayley networks on ℤ/mℤ; its distinct-eigenvalue STRUCTURAL RANK is measured. M1 TWO-ARM PRIMALITY: primality is a simultaneous fixed point of BOTH dual-lever arms — per-node PRESSURE ΔNFR(n)=0 (§4) AND global SPECTRAL rank s_QR(m)=3 (ex 119), 0 disagreements; both GROW with factorization complexity (corr(ΔNFR,log A)=0.93, corr(log A,ω)=0.88), bridging §4 ↔ ex 119. M2 THE CYCLOTOMY LAW: the rank of the k-th power residue network on a prime is s_k(p)=gcd(k,p−1)+1 (0 fails k≤10, p<60); the maximal rank k+1 is reached ⟺ p≡1 mod k ⟺ p splits completely in ℚ(ζ_k) (0 mismatches); QR is the k=2 case (uniform 3) — the rank READS p's cyclotomic splitting, a whole family. M3 FREE-MONOID EXPONENTIAL GRADING: on squarefree m the rank is (per-prime rank)^ω — QR 3^ω (=A(m)), unitary/Ramanujan 2^ω — the EXPONENTIAL reading of the word length ω (ex 147) whose pressure counterpart is the LINEAR ζ(ω−1); the scalar rank collides on mixed composites. HONEST: primality⟺ΔNFR=0 (§4) and the QR signature (ex 119) pre-exist, the cyclotomy law underneath is classical Gauss-period/cyclotomy; the NEW part is the unified TNFR structural-diffusion framing — the two-arm bridge, the ω-grading, the cyclotomy family with the splitting reading; not new number theory, does NOT advance RH)emergent_chemistry_particles_demo.py — chemistry/particles from ΔNFR = 0124 the emergent metric is fractal-consistent (lines B+D: the canonical operator's natural metric is the effective resistance R_eff, not shortest-path, counting all parallel paths; R_eff is the unique metric consistent under the fractal node↔subgraph collapse = the exact Kron/Schur reduction of the canonical Laplacian (~1e-15); THOL currently spawns sub-EPIs as topologically isolated nodes, so conductive fractality is latent in the operator — answers "is every node also a graph?")
125 a node IS the emergent substrate, not a graph (the deep reading of fractality: "node as graph" (124) is the scalar transport shadow = the Fix(G)^⊥ combinatorial channel; the node's true interior is the 4D symplectic phase-space / Poincaré-sphere object = the Fix(G) geometric channel of 123. MEASURED: fixing topology freezes the Laplacian spectrum and R_eff while the substrate polarization and H_sub move — the graph picture is blind to the substrate depth; the real fractality is node↔network substrate self-similarity, not node↔subgraph)
126 the two layers of emergent geometry (crystallizes the node=substrate optic: BASE layer (topology — L_rw, λ₂, R_eff, Kron; state-independent) + FIBER layer (state — the per-node symplectic substrate; state-dependent), bridged by the nodal equation (ΔNFR_epi=−L_rw·EPI exactly). The reorganization map: arithmetic was a BASE property (so the fiber was blind), the 13 operators act on the FIBER (line E), λ₂ is the base→fiber coupling clock (line C))
127 is the base emergent-TNFR or imposed graph theory? (the doctrinal check on 126's "spectral graph theory": MEASURED — (M1) the operator is TNFR-derived, ΔNFR=−L_rw·EPI exactly but NOT −L_comb·EPI (the nodal neighbour-MEAN forces the degree-normalized L_rw, not the generic combinatorial Laplacian); (M2) no free parameters; (M3) the topology itself can EMERGE from the EPI substrate via the canonical REMESH _mst_edges_from_epi. Verdict: the base is NOT imposed graph theory — only the initial connectivity is a boundary condition, the operator is canonical and the topology is substrate-regenerable)
128 the base co-emerges with the substrate (the paradigm-faithful deepening of 127's M3: closes the loop topology→(nodal eq)→substrate→(REMESH MST)→topology and reaches a SELF-CONSISTENT fixed point T=MST(EPI(T)) (Jaccard 1.0). The imposed initial topology is largely washed out (fixed point = a substrate-derived spanning tree, 10–24% survives); the fixed point is NOT unique (different initial topologies → different co-emergent attractors, Jaccard 0.37–0.73), so the initial connectivity is a basin-selecting boundary condition. Both base AND fiber co-emerge from the nodal equation — the faithful footing for lines C and E)
129 the spectral gap is the base→fiber coupling clock (line C: λ₂ is a BASE quantity but the CLOCK of the base→fiber coupling, with five canonical faces — (M1) relaxation rate νf·λ₂, (M2) Cheeger bottleneck h²/2≤λ₂≤2h via the Fiedler cut, (M3) instability threshold r_c=νf·λ₂ = the spectral form of grammar U2, (M4) the co-emergent tree of ex 128 has the smallest gap = the slowest clock, (M5) the conservation/Lyapunov energy relaxes on this SAME clock — diffusion_gap=λ₂(L_sym), theorem 8.6; standard spectral graph theory re-expressed, Cheeger proxy is the Fiedler cut)
130 the operators act on the fiber (line E, ARC CLOSER: the 13 canonical operators act on the symplectic substrate, and the dual-lever (ex 37) predicts which conserved-charge SECTOR each breaks — pure ΔNFR destabilizers (OZ/THOL/ZHIR/NAV)+NUL break ONLY the potential sector (|dE_geo|=0 exact), UM collapses the geometric sector Ψ, IL touches both (aligns phase current), AL/EN/RA/SHA/VAL/REMESH preserve all charges. The operator classification IS the substrate's conserved-charge sector map — operator algebra and emergent geometry are one structure)
131 the co-emergent loop always converges (a new direction opened by the arc: the closed base⊗fiber loop topology→(nodal eq)→substrate→(canonical REMESH)→topology, run freely with every canonical mode (mst/knn/community), CONVERGES to a fixed point — never cycles, never diverges (36/36 mst, 34/36 knn, 0 cycles/divergences). This is grammar U2 (convergence/boundedness) lifted from the field to the full base⊗fiber system; honest caveats: MST convergence is trivial, community collapses onto EPI communities, the U2 link is an observed inheritance not a derivation)
132 geometric phase / holonomy on the substrate (the per-node substrate doublet ζ=(K_φ+i·J_φ, Φ_s+i·J_ΔNFR) is a Poincaré-sphere point (ex 106); the geometric phase accumulated around a loop of substrate states equals +½ the enclosed solid angle — the BARGMANN INVARIANT arg(⟨ψ₁|ψ₂⟩⟨ψ₂|ψ₃⟩⟨ψ₃|ψ₁⟩)=½·Ω, an EXACT CP¹ identity (M1, 7/7 to ~1e-17), gauge-invariant hence genuinely GEOMETRIC (M2, invariant under ψ→e^{iα}ψ per node), realized as the closed-loop holonomy (M3, 4/4 exact). HONEST SCOPE: this is the Pancharatnam phase of CLASSICAL polarization optics (Pancharatnam 1956, empirically established) and an exact provable identity — NOT a quantum Berry phase, NOT a qubit (the substrate is a classical wave polarization texture, product state, no entanglement); emerges from the canonical substrate, verifies the identity, not new mathematics, closes no open problem)
133 topological defects of the emergent field Ψ (the canonical complex field Ψ=K_φ+i·J_φ carries phase VORTICES — the winding of arg Ψ around a face, w=(1/2π)∮d(arg Ψ), is an EXACT integer (M1, degree of S¹→S¹, ~3e-16; 20 vortices/20 antivortices/60 defect-free on a 10×10 torus); on the TORUS the total charge is exactly 0 (M2, Poincaré–Hopf, Euler χ=0 — defects come in vortex-antivortex PAIRS, #vortices=#antivortices, 4/4 seeds); the net charge is conserved exactly under the canonical step() (M3, max|net|=0, defects move/annihilate only in pairs — HONEST: the count is NOT monotone, the phase dynamics moves defects but does not cleanly anneal them, no coarsening); the tensor-suite 𝒬=|∇φ|·J_φ−K_φ·J_ΔNFR is a CONTINUOUS density, NOT the integer winding (M4, ratio ~1.0 — 𝒬 is blind to the defects despite the name). HONEST SCOPE: the winding number is an exact topological identity and phase vortices are the empirically-established defects of the XY model/superfluids/liquid crystals; emerges from the canonical Ψ field, not new mathematics, closes no open problem)
134 spectral dimension of the emergent diffusion / heat kernel as the EPI Green's function (the heat kernel e^{-tL} of the canonical structural-diffusion operator IS the evolution operator of the EPI channel dEPI/dt=−ν_f·L_rw·EPI — M1: heat trace Z(t)=Σe^{−λ_k t} runs n→1, and e^{−tL}u₀ reproduces the explicitly-integrated nodal diffusion to 3e-5; the return probability p(t)=Z(t)/nt^{−d_s/2} defines the SPECTRAL DIMENSION d_s — M2: recovers the lattice dimension (ring 1.00, 2D torus 2.2, 3D torus 3.4, with honest finite-size convergence d_s→2 as L grows 2.32→2.13); M3: structural fingerprint of non-lattice topologies — spanning tree quasi-1D (1.25), adding Watts-Strogatz shortcuts to a ring raises d_s monotonically 1.01→2.69, the complete graph is mean-field (degenerate spectrum, NO finite d_s). HONEST SCOPE: the spectral dimension is a standard spectral-geometry/anomalous-diffusion observable (Alexander–Orbach fracton dimension), asymptotic hence finite-size biased; the heat-kernel=EPI-evolution identity is the exact canonical anchor; re-expresses established spectral geometry in the emergent transport layer, not new mathematics, closes no open problem)
135 the emergent arrow of time / structural H-theorem of the EPI diffusion channel (the EPI channel of the nodal equation is the diffusion dEPI/dt=−ν_f·L_rw·EPI, which is IRREVERSIBLE — M1: the Dirichlet energy F=½Σ A_ij(EPI_i−EPI_j)², which EQUALS the total squared canonical structural Fick current (structural_current, |diff|=0), decreases MONOTONICALLY to 0 (dF/dt≤0 exact on a 400-step grid) — the structural H-theorem, F a Lyapunov functional; M2: the random-walk distribution p_t=e^{−tL_rw}δ has relative entropy D(p_t‖π) DECREASING monotone to 0 (rigorous H-functional any graph), and on a regular ring the Shannon entropy S(p_t) INCREASES monotone to log n — the second law; M3: the arrow of time is structural — forward diffusion smooths (F→0) while time-reversed anti-diffusion dEPI/dt=+ν_f·L_rw·EPI is ILL-POSED (F diverges ~e^{2ν_f·λ_max·t}, 158→4.7e8), only forward is well-posed because every λ_k≥0. HONEST SCOPE: the H-theorem/entropy increase for diffusion is exact and provable (Lyapunov functionals of the heat semigroup), and the arrow of time/2nd law is empirically ironclad (Clausius, Boltzmann); re-expresses the irreversibility of the EPI diffusion channel (ex 99/134) in thermodynamic language; distinct from the tetrad Lyapunov energy (conservation.py) and the Lindblad/Von Neumann entropy (dissipative_conservation.py); not new mathematics, closes no open problem)
136 the heat-kernel coefficients / hearing the network's geometry (the discrete Minakshisundaram–Pleijel expansion — complementary to 134's long-time reading, this reads the SHORT-time expansion Z(t)=Tr(e^{−tL})=Σ_k(−t)^k/k!·Tr(L^k) of the canonical Kirchhoff operator L=D−A (= current_divergence, anchor |L·EPI−div(J)|=3e-15). M1: the Taylor coefficients ARE the spectral moments Tr(L^k)=Σλ^k, verified two ways to machine precision; M2: the moments are weighted closed-walk counts that HEAR the geometry — Tr(L^0)=n nodes (volume), Tr(L^1)=2m edges (boundary), Tr(L^2)=2m+Σd², and via the canonical coupling W=A: Tr(A^3)=6·#triangles (triangles=curvature, verified vs networkx); M3: "can one hear the shape of a drum?" — NO (Kac 1966): a cospectral non-isomorphic pair on 6 nodes has IDENTICAL Tr(L^k) (all k) yet DIFFERENT triangle counts (0 vs 1) and degree sequences ([1,2,2,3,3,3] vs [2,2,2,2,2,4]) that conspire to the same moments. HONEST SCOPE: standard spectral graph theory (heat-kernel coefficients=closed walks, the celebrated Weyl law/Kac drum problem), exact and provable; complements 134; not new mathematics, closes no open problem)
137 the synchronization transition / Kuramoto criticality from the canonical phase channel (changes register from the diffusion arc to the PHASE channel: the phase component of dNFR pulls each node toward the CIRCULAR MEAN of its neighbours (g_phase=−angle_diff(θ_i,θ̄)/π) — a Kuramoto-type coupling. With heterogeneous structural frequencies ν_f the phase dynamics dθ_i/dt=ν_f_i+K·angle_diff(θ̄_neighbours,θ_i) undergoes the KURAMOTO SYNCHRONIZATION TRANSITION. M1: order parameter R=|⟨e^{iθ}⟩| (canonical kuramoto_order) rises from ~0 (incoherent drift) to ~1 (collective lock) — 2nd-order transition (coupling verified == canonical phase channel to machine precision via neighbor_phase_mean_list); M2: the threshold K_c (where R first >½) grows LINEARLY with the ν_f dispersion σ (K_c/σ≈0.90 const over 6 seeds) — frequency disorder vs coupling order; M3: on a 2D torus the phase correlation C(r)=⟨cos(θ_i−θ_{i+r})⟩ decays fast below threshold (short-range) and stays high across the lattice above it (long-range order, coherence length grows = canonical ξ_C). HONEST SCOPE: the Kuramoto transition is empirically established (fireflies, neurons, Josephson arrays); the canonical coupling is the circular-mean-angle form (Kuramoto-TYPE, not the textbook sin-sum), so the measured transition and linear K_c∝σ structure are claimed, NOT the textbook mean-field constant; re-expresses a known collective transition in the canonical phase channel, not new mathematics, closes no open problem)
138 structure-frequency correlation reshapes synchronization (continues the phase-channel thread: ties the nodal DYNAMICS (ν_f) to the nodal STRUCTURE (degree) on a scale-free network — ν_f_i ~ degree_i — and measures how it reshapes the Kuramoto transition. M1/M2: degree-correlated ν_f DELAYS the onset (K_c 1.50→1.80, 4-seed mean) and makes it SHARPER (largest single-step jump in R 0.19→0.31) vs random ν_f of the same dispersion — the structure-dynamics correlation frustrates early sync then releases it suddenly (the approach to a first-order/explosive transition); M3: HUBS SYNCHRONIZE LAST — the per-node lock to the global phase cos(θ_i−ψ) is NEGATIVELY correlated with degree (corr(degree,lock)≈−0.30, 4 seeds), the highest-degree quintile locks least — the structure sets the dynamical sync order; M-extra: the onset delay grows with the structure-dynamics correlation (K_c 1.40→1.80 as corr(ν_f,degree) 0→1). HONEST SCOPE: this is NOT the full textbook explosive synchronization (strong 1st-order + wide hysteresis), which needs degree-WEIGHTED coupling; the canonical phase channel is degree-NORMALIZED (circular mean), so the hysteresis is weak (honest negative) — but the delay/sharpening/hub-frustration robustly emerge; the Kuramoto/explosive-sync phenomenology is empirically established (Kuramoto 1975, Gómez-Gardeñes 2011); re-expresses it in the canonical phase channel, not new mathematics, closes no open problem)
139 the unified grammar as a formal language (changes register from the field/dynamics layers to the GRAMMAR: U1-U6 defines, over the 13-operator alphabet, a FORMAL LANGUAGE L = the set of valid operator sequences. M1: L is a REGULAR language — valid sequences number N(n)=2,9,84,852,9396,111060 (n=1..6), every one must start with a U1a generator {AL,NAV,REMESH} and end with a U1b closure {SHA,NAV,REMESH,OZ} (pruning to those reproduces N(n) exactly = U1 is a necessary boundary), and the canonical validator decides validity from a bounded context (finite memory ⇒ regular, Myhill-Nerode); M2: the CAPACITY (topological entropy = log₂ of the growth rate λ_n=N(n)/N(n-1)) ASCENDS 2.17→3.56 toward the unconstrained maximum log₂(13)=3.70 bits/op — the coherence constraints are SUB-EXTENSIVE (U1 boundary ~2/n, U2 sparse debt, U4b only on rare ops), the honest information-theoretic interpretation of the prior dead-end (growth rate climbs to the ALPHABET, not to any tetrad constant φ/γ/π/e); M3: STRONG FREQUENCY HIERARCHY — capacity is near-maximal yet operators are far from uniform: NAV/REMESH dominate (2.3x, generators+closures), ZHIR is the extreme bottleneck (0.01x, its U4b preconditions: prior IL + recent destabilizer). HONEST SCOPE: standard formal-language theory (regular languages, Chomsky) + information theory (topological entropy / Shannon capacity); confirms and correctly interprets the prior dead-end (no hidden tetrad constant); a characterization of the canonical grammar, not new mathematics, closes no open problem)
140 the grammar automaton (deepens 139 from assertion to CONSTRUCTION, built directly from the canonical centralized operator sets — a cross-check of the grammar centralization. M1: an explicit finite-state automaton (83 reachable states; state = last-3 operator tags D/I/O + U2 has-destab/has-stab flags + U1b closure bit) reproduces the canonical oracle N(n)=2,9,84,852,9396,111060 EXACTLY (it IS the grammar's FSM; U4a is subsumed by U2 because the bifurcation handlers ARE the stabilizers {IL,THOL}); M2: Myhill-Nerode partition refinement collapses it to a concrete 29-state MINIMAL DFA (incl dead sink) — L is regular CONSTRUCTIVELY, not just by the finite-memory argument of 139; M3: the transfer matrix's PERRON-FROBENIUS eigenvalue λ=11.560930 is the EXACT capacity (log₂λ=3.531 bits/op) = the connective constant / asymptotic branching factor of grammatically-allowed continuations; the finite N(n)/N(n-1) estimates of 139 are NON-MONOTONIC — they overshoot to ~12.19 at n≈9 then settle to λ=11.56 (|ratio−λ|=2.8e-05 by n=79), the exact eigenvalue resolves them. HONEST SCOPE: standard automata/symbolic-dynamics theory (Myhill-Nerode minimal DFA, Perron-Frobenius / topological entropy of a sofic language), built from the canonical centralized sets; a constructive characterization deepening 139, not new mathematics, closes no open problem)
141 decomposing the grammar by rule (the grammar is the only mechanism that modifies coherence, so locating WHICH rule does the structural work is paradigm knowledge — rebuilds the ex-140 automaton with each U1-U6 rule toggled on/off and compares the exact capacity λ and counts N(n). M1: every rule cuts N(4) (U1a start ~4.3x, U1b end ~3.2x, U2 acceptance ~1.6x, U4b ~1.5x) but only U4b changes the asymptotic growth rate λ; M2: U4b ALONE gives λ=11.5609299951 = the full-grammar λ EXACTLY (|diff|=5e-15), and removing U4b restores λ=13.0000000000 (the full alphabet) — the bifurcation-context rule alone fixes the capacity, U1a/U1b/U2 contribute ZERO to λ; M3: U1/U2 are BOUNDARY conditions (constrain how a finite sequence starts/ends/settles its convergence debt — prefactor only) while U4b is the single INTERIOR-TRANSITION rule (gating ZHIR/THOL, the bifurcation operators, is the sole source of the loss 13→11.56 = the ZHIR bottleneck of 139). PARADIGM INSIGHT: the asymptotic constraint on building valid coherence lives entirely in the bifurcation rule (threshold energy to transform), not in the boundaries. HONEST SCOPE: standard symbolic-dynamics (Perron-Frobenius / topological entropy of rule-toggled sub-automata) on the canonical ex-140 automaton; a characterization, not new mathematics, closes no open problem)
142 the grammatical quotient of the operator alphabet (computes the SYMBOL-LEVEL Myhill-Nerode quotient — which operators the static grammar can and cannot tell apart — built on the canonical ex-140 automaton. M1: the 13 operators collapse to exactly 9 grammatical equivalence classes (a~b iff identical transitions on every automaton state), one per realized role-combination: {EN,UM,RA,NUL} (free interior), {NAV,REMESH} (gen+closure), and 7 singletons {AL}/{IL}/{OZ}/{SHA}/{VAL}/{THOL}/{ZHIR} — the static grammar's RESOLUTION is 9, not 13; M2: enumerating all 10343 valid sequences (len≤5), every one of the 51206 in-class symbol substitutions preserves validity (0 broken = classes exact), while a cross-class swap (AL→EN at a generator slot) breaks validity (classes genuinely distinct); M3: the REDUNDANCY GAP — symbol-counting capacity λ_sym=11.560930 (3.531 bits/op) vs role-counting capacity λ_cls=8.752927 (3.130 bits/role) = 0.401 bits/op of free in-class choice, almost all inside {EN,UM,RA,NUL}. PARADIGM INSIGHT: the static grammar resolves operators only up to their grammatical ROLE; the four free operators have distinct nodal dynamics (reception, coupling, resonance, contraction) but their canonical constraints are RUNTIME (U3 phase coupling for UM/RA; reception/contraction telemetry contracts), not static-sequence rules — so the quotient precisely delineates the SCOPE of the static sequence grammar vs the runtime/phase/telemetry layer. HONEST SCOPE: standard Myhill-Nerode symbol quotient + Perron-Frobenius capacity on the canonical ex-140 automaton, confirmed by the validate_grammar oracle; a characterization that delineates the static-grammar scope, not new mathematics, closes no open problem)
143 the glyphic-function sub-language and its nesting (AUDITS the higher-level "canonical patterns" concept and reconstructs it from the ORIGINAL source — TNFR.pdf §2.3 "Macros glíficas" / "Tabla de funciones glíficas operativas" — finding a genuine SUB-LANGUAGE of nested glyphic functions richer than the flat code patterns. M1 AUDIT: the PDF-original glyphic functions (Activación simple [AL,IL,RA], Estabilización mutacional [OZ,ZHIR,IL], Ciclo regenerativo [NAV,THOL[...],SHA], Interfaz adaptativa [THOL[ZHIR→UM→NAV],RA], MACRO INIT [AL,IL,UM], MOD ESTABILIZADOR [OZ,ZHIR,IL]) and the code base patterns (Bootstrap [AL,UM,IL], Stabilize [IL,SHA], Explore [OZ,ZHIR,IL], Propagate/RESONATE [RA,UM,RA]) are ALL grammatical FRAGMENTS — 0/7 PDF + 0/5 code valid as standalone words under U1-U6 (they are macros to COMPOSE, not sequences); and 2 of the 10 'concrete' canonical_patterns.py registry sequences are actually INVALID (therapeutic_protocol starts with EN, not a U1a generator; full_deployment has ZHIR with no prior IL, U4b violated). The code patterns diverge from the PDF (MACRO INIT is [AL,IL,UM], not Bootstrap's [AL,UM,IL]) and dropped the THOL nesting entirely. M2 COMPOSITION: a fragment becomes a valid word exactly by adding a U1a generator prefix + U1b closure suffix (+ the U4b context a transformer needs) — Bootstrap [AL,UM,IL]→[AL,UM,IL,SHA] valid; macros compose into larger valid words with this glue (the PDF's 'compose into more complex structures' recovered: glyphic functions = the WORDS, composition = the higher grammar). M3 NESTING = CONTEXT-FREE (the recovered fractal variable): a well-formed nested glyphic function THOL[body] (body itself grammar-valid) flattens to a grammar-VALID operator stream (the regular layer of ex 139-142 preserved), but the bracket structure is a Dyck language — the number of nesting tree shapes with n THOL nodes is EXACTLY the Catalan number C_n (1,1,2,5,14,42,132,429,1430), and the nesting depth is unbounded and balanced, so the bracketed glyphic-function language is CONTEXT-FREE and NOT regular (pumping lemma). The bracket depth IS the nested-EPI fractal scale (U5). PARADIGM INSIGHT: operational fractality U5 is precisely the feature that lifts the glyphic language one level above the regular operator grammar L — the flat code patterns are its depth-0 projection. HONEST SCOPE: standard formal-language theory (Dyck language, Catalan numbers, pumping lemma, Chomsky hierarchy) applied to the canonical grammar U1-U6 + the canonical THOL nesting recovered from TNFR.pdf; an audit + characterization, flags 2 invalid registry sequences for cleanup, not new mathematics, closes no open problem)
144 the branching combinator (recovers the OTHER feature the flat code patterns dropped — BRANCHING [ZHIR|NUL] — from TNFR.pdf §2.3 "Bifurcación y mutación" / "Estructuras bifurcadas" / "Tabla comparativa de estructuras glíficas". The PDF is decisive for doctrine: the branches are "NO alternativas simbólicas, sino trayectorias estructurales reales en el campo" — a REAL physical bifurcation triggered by OZ (U4a: OZ generates a bifurcation threshold; the node reorganizes via ZHIR or collapses to latency via NUL). M1 REAL BIFURCATION INTO TWO ORTHOGONAL BASINS: both OZ→ZHIR and OZ→NUL are grammar-valid (10 valid continuations after [AL,IL,OZ]); from the SAME post-[IL,OZ] state the two branches move ORTHOGONAL channels — ZHIR reorganizes the PHASE (dθ=0.236, d|EPI|=0.000), NUL contracts the STRUCTURE (dθ=0.000, d|EPI|=0.058), the canonical contracts measured robustly (ZHIR=phase transformer, NUL=structural contraction). M2 ALTERNATION IS A REGULAR OPERATION: X[A|B]Y = XAY ∪ XBY; regular languages are closed under union, so branching does NOT raise the Chomsky class (contrast nesting THOL[...] = context-free, ex 143); a branched program with k binary choice points denotes EXACTLY 2^k concrete words (measured 2/4/8 all grammar-valid) — branching is exponential COMPRESSION, a compact name for already-valid words in L. M3 THE GLYPHIC TYPOLOGY IS A REGULAR-EXPRESSION ALGEBRA + NESTING: the PDF "Tabla comparativa de estructuras glíficas" has 5 types — Lineal (concatenation), Bifurcada (union ← this ex), Fractal/Cíclica (Kleene star/repeat), Jerárquica (nesting); the three NON-nesting operations (concat, union, star) are EXACTLY the three regular-expression operations (Kleene's theorem) and generate the regular languages, while only nesting escapes to context-free (ex 143). PARADIGM INSIGHT: branching is the UNION operation of the glyphic regexp algebra; the OZ bifurcation is its physical anchor (two real orthogonal basins). HONEST SCOPE: standard formal-language theory (closure under union, Kleene's theorem regular={concat,union,star}, Chomsky hierarchy) + the canonical OZ/U4a bifurcation from TNFR.pdf; the 2×2 channel table is a robust measurement of the canonical operator contracts; completes the glyphic combinator set begun in ex 143 (sequence/branch/cycle = regular, nest = context-free), not new mathematics, closes no open problem)
145 the syntactic monoid of the grammar (computes the next canonical algebraic invariant after the minimal DFA (ex 140): the SYNTACTIC MONOID M(L) = the transition monoid of the minimal DFA, the smallest monoid recognizing the grammar language L. M1: the 29-class minimal DFA (28 live + 1 dead sink) yields |M(L)|=312 elements (incl. identity=empty word) with 131 idempotents (e·e=e) — high idempotent density is the algebraic fingerprint of aperiodicity. M2: M(L) is APERIODIC (group-free) — every element x satisfies x^n=x^(n+1) with stability index n≤4, so no element generates a nontrivial cyclic group (H-trivial), M(L) contains NO nontrivial group; CONTRAST measured side-by-side with the parity language a^even whose syntactic monoid is Z/2 (a period-2 group, NOT aperiodic, NOT star-free). M3: by Schützenberger (1965) aperiodic syntactic monoid ⟺ L is STAR-FREE (built from letters by concatenation/union/complement, NO Kleene star); by McNaughton-Papert (1971) star-free ⟺ first-order definable FO[<], so every valid coherent sequence is described by a first-order formula over operator positions with no fixed-point recursion. PARADIGM INSIGHT: the grammar is the only mechanism that modifies coherence, so the logical complexity of L is the logical complexity of building valid coherence — star-free/FO-definable is the SIMPLEST nontrivial class of regular languages: no counting, no modular/periodic structure, just the linear order of positions plus the U1-U6 boundary/threshold conditions. HONEST SCOPE: standard algebraic automata theory (syntactic monoid, Schützenberger's star-free theorem, McNaughton-Papert FO characterization, Green's relations/H-triviality) on the canonical ex-140 automaton; |M|=312 and the aperiodicity verdict are exact; a characterization that locates L at the star-free/FO level, not new mathematics, closes no open problem. Grammar thread: 139 (language) + 140 (automaton) + 141 (rule decomposition) + 142 (operator quotient) + 143 (nesting/CF) + 144 (branching/union) + 145 (syntactic monoid/star-free))
150 the emergent grammatical pattern: the Parry maximum-entropy measure, the capacity split, and the H-theorem (studies the pattern the grammar produces ON ITS OWN — the operator distribution that EMERGES from U1-U6 with no imposed bias — uniting the grammar thread 139-145 with physics (maximum entropy / the H-theorem, ex 135) and the dual-lever lens (ex 146-149). The unique stationary measure of maximum entropy on a regular language's automaton is the PARRY measure (Shannon–Parry 1964): P(i→j)=M_ij·r_j/(λ·r_i), the discrete maximum-entropy / Jaynes distribution of the language. M1 THE PARRY MAXENT PATTERN: the automaton is NOT strongly connected (transient START phase + one 45-state RECURRENT SCC carrying λ); the emergent steady-state pattern lives in the recurrent phase, where Parry achieves h_state=1.390957 > uniform-edge h_unif=1.348359 (+0.0426, the unique maximum); emergent operator frequencies (no imposed bias) are set by how LITTLE U1-U6 constrains each operator — OZ/VAL lead (~10.05%), most ~8.23%, THOL 4.08%, the U4b-bottlenecked ZHIR rarest (0.95%). M2 THE CAPACITY SPLITS EXACTLY INTO STATE + CHOICE: log λ = 2.447631 bits/op (topological entropy, ex 140) = H_state + H_choice = 1.390957 + 1.056674 (residual ~4e-16) — H_state = which structural move the coherence flow makes, H_choice = which operator within a grammatical equivalence class (the in-class free choice of the ex-142 quotient: the automaton is a MULTIGRAPH, several operators share a state→state edge); coherent generation is ~57% structural move, ~43% free in-class choice, now exact in entropy units. M3 THE H-THEOREM: under the Parry walk D(p_t‖π) decreases MONOTONICALLY to 0 (0.71674→0.35862→0.00084→…→0, monotone=True), the Markov H-theorem, the SAME arrow-of-time structure as the diffusion H-theorem of ex 135 — π is the EQUILIBRIUM coherent generation relaxes to, a maximum-entropy / Jaynes equilibrium. Read through the dual-lever, the steady state spreads coherent generation across BOTH arms (pressure ΔNFR ~32%, neutral ~33%, capacity νf ~27%, both/NUL ~8%) — no single lever dominates. PARADIGM INSIGHT: the pattern the grammar produces on its own is a maxent equilibrium whose capacity splits exactly into a structural-state channel and the ex-142 in-class-choice channel, relaxed to by an H-theorem — uniting grammar + thermodynamics (Jaynes) + the dual-lever. HONEST SCOPE: standard symbolic-dynamics + information theory (Shannon–Parry maxent measure, entropy chain rule for the state/choice split, Markov H-theorem) on the canonical ex-140 automaton; the capacity split and the H-theorem are exact; a characterization of the emergent pattern, not new mathematics, closes no open problem. Grammar thread: 139 (language) + 140 (automaton) + 141 (rule decomposition) + 142 (operator quotient) + 143 (nesting/CF) + 144 (branching/union) + 145 (syntactic monoid/star-free) + 150 (Parry maxent equilibrium))
151 the grammar develops in the emergent geometry, not just the automaton (answers a doctrine-critical question the grammar thread 139-150 left open: that thread studied U1-U6 as a PURELY COMBINATORIAL object — a formal language / automaton / syntactic monoid / Parry measure, i.e. a labelled directed graph. Does the grammar float free on that automaton, or are its rules conditions on the CANONICAL EMERGENT GEOMETRY (symplectic substrate + tetrad) where coherence physically lives? The base/fiber lesson of ex 126-130 made this distinction decisive. MEASURED on the canonical engine modules (symplectic_substrate.py, conservation.py, fields.py): M1 U2 IS A SUBSTRATE-BOUNDEDNESS CONDITION — unbalanced destabilizers drive the substrate Hamiltonian H_sub and Φ_s to DIVERGE super-exponentially (the ∫νf·ΔNFR runaway U2 is derived from): 0-1 OZ bounded (H_sub ~23), 2 OZ → 2.46e5 / Φ_s 193.6, 3 OZ → 7.26e9 / Φ_s 3.34e4; the U2 stabilizer is the negative-feedback lever (matched count, +k IL reduces the escape at each k); U2's combinatorial boundary IS the substrate's boundedness boundary. M2 EACH RULE HAS ITS OWN GEOMETRIC MEANING (honest nuance) — NOT a blanket 'every invalid word is incoherent': U1a-invalid [EN,IL,SHA] is energetically IDENTICAL to valid [AL,IL,SHA] (H_sub 23.217, E 46.625, Φ_s 0.708 both) because U1 is a TRAJECTORY-ENDPOINT rule (start from EPI=0), not energy; U2/U6 map to substrate energy / Φ_s confinement, U1 to endpoints — the rule→constraint map of ex 38, now measured on the substrate. U6 is a literal tetrad-field bound: valid Φ_s < π/2≈1.571 (0.52, 0.34), forbidden Φ_s 193.60 / 33375.61 (≫ 2.0 ceiling). M3 THE SUBSTRATE IS THE CANONICAL HOME OF COHERENT EVOLUTION — gentle grammatical words preserve the canonical symplectic manifold (all 7 verify_substrate_geometry certificates, 3/3); the forbidden divergent word leaves it (manifold_valid=False); coherent trajectories live ON the canonical emergent geometry, engine-integrated and SDK-exposed as net.symplectic_substrate(). PARADIGM ANSWER: the grammar does NOT float free on its automaton — its rules ARE conditions on the emergent geometry (U2 boundedness, U6 confinement, U1 endpoints), measured; the automaton (139-150) is the combinatorial shadow. HONEST SCOPE: a characterization bridging the grammar thread (139-150) to the canonical symplectic substrate (98-137); the substrate geometry and the U2/U6 derivations already exist, the contribution is the measured bridge. The correspondence is RULE↔geometric-property (derived + measured), NOT a per-word valid⟺bounded classifier — operators have amplitude, so at aggressive amplitude even a valid word carries a large transient (U4 excursion territory; U2 only requires stabilizers be PRESENT), while gentle valid words stay bounded and preserve the manifold; not new mathematics, closes no open problem. Grammar thread: 139+140+141+142+143+144+145+150 + 151 (grammar in the emergent geometry))
152 the operator-contract tetrahedron: channel x scale, and what emerges from REMESH (studies the 13 canonical operators through their CONTRACTS — what each does to node state under the nodal equation — now centralized in the canonical spec src/tnfr/operators/operator_contracts.py, the single source of truth from which the proactive audit, reactive monitor, and introspection metadata all derive. Reveals a TWO-AXIS structure. AXIS 1 (channel): every operator's primary effect lands on one nodal channel — EPI={Emission,Reception,Resonance,Recursivity}, nu_f={Silence,Expansion,Contraction}, theta={Coupling,Mutation}, dNFR={Coherence,Dissonance,SelfOrganization,Transition}. M1 measures this channel partition against the independent dual-lever (ex 37/130): it AGREES on the pure-lever operators (SHA/VAL on nu_f=capacity, IL/OZ/THOL/NAV on dNFR=pressure) and REFINES the binary lever by resolving the phase channel theta (UM/ZHIR act on theta primarily, with their capacity/pressure lever a downstream |grad phi| effect) plus the dual-channel NUL — one structure, read as lever / tetrad-driver (ex 39) / number-theory grading (ex 147). AXIS 2 (scale, U5 fractality): M2 measures that exactly ONE operator is NETWORK-scale (REMESH) and the other twelve are NODE-scale — applying each node-scale operator changes node state, while the node-level REMESH call leaves every node unchanged (advisory). M3 studies what emerges from REMESH at three scales, all from the EPI history: GLOBAL temporal (apply_network_remesh mixes EPI with history via the convex recurrence beta+gamma+delta=1, 12/12 nodes), GLOBAL topological (apply_topological_remesh regenerates the BASE topology from the FIBER EPI field, ex 126-131 base/fiber co-emergence), ASYMPTOTIC (the tau_g->inf R_inf projection onto the time-mean, N15 REMESH_INFINITY_DERIVATION.md, referenced not re-measured). REMESH is the EPI-channel operator whose scale is the network — operational fractality (U5) made concrete; its 'special' node-level advisory is the shadow of its multi-scale action, NOT an exception. HONEST SCOPE: a characterization of the canonical operator contracts; the channel=dual-lever correspondence is a REFINEMENT not an identity (measured), the asymptotic scale is the N15 result (referenced); the spec centralizes what was scattered across integrity.py / introspection.py / API_CONTRACTS.md and eliminates measured drift (AL 'Positive dNFR', RA EPI-magnitude, VAL/NUL |EPI|); not new mathematics, closes no open problem. Doctrine: ground truth = the direct op* effect on node state (the nodal dynamics), anchored to TNFR.pdf §2.2.1, NOT 'whichever registry is richest')
154 conductor-annotated QR spectrum: phase prime signature, exact product count, and scalar CRT wall (bridges ex 119/120 with the corrected arithmetic object. M1 checks that the directed QR phase spectrum gives scalar_count(m)=3 iff m is an odd prime on odd m in [5,119], with sample agreement between FFT spectrum and the canonical structural_diffusion_operator. M2 verifies that the conductor-annotated count #{(F_m(k), gcd(k,m))} factors exactly as Product_{p^e || m}(e+ceiling(e/2)+1) on odd m in [3,119], and shows the prime-power local ladder 3,4,6,7,9,10,12. M3 records the scalar wall: m=3^75^241^2 has product count 192 but exact unannotated scalar count 191, while conductor annotation restores 192 by separating CRT-local states. HONEST SCOPE: a structural classification linking the phase spectrum, support/conductor depth, and scalar aliasing; not a faster factorization algorithm, not a derivation of primes, and not a closure of the Riemann obstruction.)
155 the ontological position of a number (synthesizes the emergent-number arc + Sectors A/B/C into the POSITION LADDER of a number, each rung measured: L1 cardinal — integers emerge as Laplacian degeneracies / irrep dimensions (2@triangle, 3@tetrahedron, 5@icosahedron); L2 operations — + emerges from the Cartesian-product spectrum; L3 primality — the directed residue rank ρ(n)=3 ⟺ odd prime, from x² mod n only (Sector B), 0 mismatches; L3′ the arithmetic EMERGES — ρ realizes the proved §9.7 conductor-product law (ρ(p)=3, ρ(p²)=4, ρ(p³)=6), multiplicative on the demo range, so Ω/τ (the factorization+divisor channels of the ΔNFR triad) are read off the spectrum, not consumed by trial division; L4 the wall — ρ gives the TYPE not the prime IDENTITIES (ρ(15)=ρ(35)=9) and aliases at high powers, the same e–π / Fix(S_n)^⊥ residue as TNFR-Riemann. PARADIGM: number_theory.py (Sector A) consumes the integer; the emergent ontology DERIVES it from structure up to the prime-identity/phase wall. HONEST SCOPE: synthesizes existing results (cyclotomy law §9.7, Sectors §9.5/9.6, the emergent-number arc) into the position map; closes no open problem)
156 the emergence-directness law: structural level × symmetry sector (formalizes WHY the cross-domain axis of EMERGENT_ONTOLOGY.md §0 orders domains by directness — particle winding directly, number-theory spectral partially, arithmetic ΔNFR circularly. The order is fixed by two choices: WHICH level of the three-level structure §7.1 stage→occupant→process carries a domain's read-out, and WHICH Aut(G) representation sector (Schur Fix(G)⊕Fix(G)^⊥, ex 123) it lives in. MEASURED: (1) the occupant winding |W| is invariant under ALL 24 automorphisms of C₁₂ (rotations preserve W, reflections flip W→−W) = a Fix(G) topological invariant = DIRECT; (2) two distinct Z₂ send W→−W — parity P (orientation-reversing automorphism, commuting) vs charge conjugation C (phase conjugation φ→−φ, the anticommuting chiral Γ = the additive inverse −n, chiral_involution.py); (3) the per-node substrate is orbit-constant on the vertex-transitive ring (Fix, BLIND); (4) ρ(n)=3⟺prime is a spectral Fix(G)^⊥ invariant while every per-node Fix quantity stays uniform = the symmetry wall (ex 120/123). THE LAW: topological(occupant)=Fix-invariant=DIRECT; spectral(stage)=Fix^⊥-trapped=PARTIAL(the wall); process=consumes-input=CIRCULAR. Unifies the position ladder (155/§9.8), the particle classification (§7.1), the Riemann/number wall (§9.5-9.7, §10.5) and the §0 axis under ONE principle — the representation theory of the coupling's symmetry group (the same that fixes the secondary synergies: commuting→wall, anticommuting chiral→inverse/antiparticle, non-symmetric circulant→Gauss-sum phase, products→+/×). HONEST SCOPE: every piece is DERIVED/measured; the law is a unifying re-expression, closes no open problem — the wall persists, G4=RH stays OPEN. Theory: EMERGENT_ONTOLOGY.md §2.3)