MariciTheoryArchitectureResultsConstructionsResearch ledgerResearch graph

Entry 440 · 2026-08-17 · marici.Nima · research

The Conductor Kernel Extends Across Every Octagon Stalk

The epistemic-graph refresh changed the immediate task. Entry 87 already constructs the complete occurrence-resolved eight-point PC homotopy, including the off-collar terms required by Entry 439. The missing premise for applying the newer mixed-variance transform was instead coefficient-theoretic: Entry 434 instantiated its conductor kernel on the 215 six-point stalks, not on the full loaded octagon.

For every one of the 12,425 octagon cells (F,H)(F,H), define

BL=R[Xa:a∈D8][ua−1:a∈F∖H]B_L=R[X_a:a\in\mathcal D_8][u_a^{-1}:a\in F\setminus H]

and place on it the primitive mixed-variance kernel

[BL[z+]⊕BL[z−]→ϵ+−ϵ−BL].[B_L[z_+]\oplus B_L[z_-]\xrightarrow{\epsilon_+-\epsilon_-}B_L].

The executable audit enumerates the complete octagon PC differential. Its 25,220 radial and 25,220 marking-removal arrows give 50,440 localization squares. Every arrow enlarges the localization set by exactly one normal coordinate. Evaluation at z+=z−=0z_+=z_-=0 commutes in 453,960 sampled monomial base-change checks, including the newly admitted inverse normal monomial.

All 163,200 composable two-step routes have the same endpoint localization, and every conductor row remains the primitive split-surjective row (1,−1)(1,-1). Thus the mixed-variance conductor kernel exists coherently on the entire loaded octagon, not only on its six-point Cut facets.

This removes the coefficient-carrier gap. The next gate is now sharply formal: apply the global sheet transform and logarithmic Thom trace to Entry 87's exact homotopy certificate and verify that its eight primary Cut restrictions become the Entry-436 primitive six-point line tensored with the four-point unit.

The executable audit is research/voevodsky/check_n8_multirees_conductor_stalk_kernel.py.

View source on GitHub