Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

ECI v6 — From Faulkner-Speranza to a complexity-bounded GSL on type-II crossed products

Kevin Remondière

Published May 2, 2026• 0 citations
Publisher

Abstract

⚠️ CORRECTION NOTICE (2026-07-12) - The boxed "Main result (Theorem)" and the abstract's "We prove an upper bound" overstate what is established: the bound depends on Assumption M1, explicitly labeled a POSTULATE (modular complexity ansatz) in this paper's own text. A contemporaneous internal multi-agent audit (3/3 independent reviewers) concluded the M1→Jacobson-EGJ bridge has "no route currently known" and recommended explicitly: "do not claim derivation." Recommend downgrading "Theorem"/"prove" to "conjectural bound under Assumption M1" in the abstract and result box.- Two papers extending Krylov complexity into the modular/horizon direction flagged as "surveillance targets" in the pre-submission novelty audit have since appeared (arXiv:2507.23739, arXiv:2602.02675); neither reproduces this paper's full composite equation, so no scoop has occurred, but the novelty margin is narrowing while this remains unsubmitted to arXiv.- This record is dormant (no update since May 2026) but not shown to be false; it sits outside the scope of the current lattice/mass-gap programme and should be read as such.``` We prove an upper bound on the rate of generalised entropy along the modular (Connes-Tomita-Takesaki) flow τ_R of a type-II crossed-product observer algebra A_R, extending the Eling-Guedens-Jacobson local Clausius schema dS = δQ/T + d_iS to the setting of Chandrasekaran-Longo-Penington-Witten and De Vuyst-Eccles-Held-Kirklin. The bound reads dS_gen[R]/dτ_R ≤ κ_R · C_k[ρ_R(τ_R)] · Θ(PH_k[δn(τ_R)]) with κ_R = 2π T_R the Bisognano-Wichmann modular surface gravity, C_k a k-design / spread complexity proxy, and Θ a topological activator on persistent homology of the dequantised classical density field δn. v6.0.16 retracts the v6.0.15 framing of M1 as a "conditional theorem" — see the framework paper (Remondière, ECI v6.0.16, DOI 10.5281/zenodo.19708889) and notes/m1_audit_2026_05_02.md. M1 retains POSTULATE status; the v8-bis math.CT companion target is Conjecture M1-C.

DOI
10.5281/zenodo.19983238

Related papers

Crossed Cosmos / ECI v7.5.0 — β-scan SU(2) 4D lattice EE sub-leading C-function

Kévin Rémondière

⚠️ CORRECTION NOTICE (2026-11-08; amended 2026-11-09) The original description of this record (27 May 2026) is kept unchanged below. It overstates what the record contains. Read it together with the correction notice of version v10.0.0 of the same concept (10.5281/zenodo.20415354, notice of 2026-07-12) and with the corrections of the repository crossed-cosmos (README, sections "STATUS UPDATE (2026-07-12)" and "INTEGRITY CORRECTION (2026-10-04)"; CHANGELOG, entry 2026-10-04). "World-first G₂ and Sp(4) entanglement entropy" is withdrawn. The priority claims, here and as "first measurement" in the included drafts, are unverified. An internal audit of 2026-06-20 also found that the G₂ result cannot be published as it stands. The G₂/SU(3) ratio given in the drafts (1.291–1.292) changes when both groups are matched at another lattice spacing. Its constancy for L = 4–12 is a stability in volume at fixed couplings, not in the lattice spacing. Part of the stored data could not be reproduced. The attribution of differences between groups to the centre (Donnelly–Wall) is an interpretation that was not tested; the code in this record makes no reference to the centre of the group. "Discovery: S₂/A/β is a Dynkin invariant" is withdrawn. It names an ordering of six numbers, one per group (file pysr_6groups_data.json, key "slopes"). The record does not show that any property of the Dynkin diagram determines them, and the two drafts included in this record do not contain the claim. The values in that file order the groups A₁ > B₃ > C₂ > A₂ > A₃ > G₂. The description of v10.0.0 states C₂ > B₃ > A₁ > A₂ > A₃ > G₂. The PySR formula is a fit, not a discovery or a derivation. Its coefficients were fitted a posteriori to the measured values of S₂/A by symbolic regression. The internal record of the fit also has an additive constant (+2.97) that the description omits. R² = 0.999 measures the quality of that fit; it is not a test on independent data. The v10 notice requalifies the later formula S₂/A = (π+e)(β−|Φ⁺|) − log(β−1−|Φ⁺|) − C₂ in the same way: (π+e) is a fitted constant, not a zero-parameter derivation. "Paper PRL 3pp included" refers to Paper_G2_EE_PRL_6groups.pdf. It is a three-page draft in PRL format, not a published PRL paper, and it still has unresolved citations and cross-references. It covers SU(2), SU(3), SU(4) and G₂ only. It contains none of the Sp(4), SO(7), Dynkin or PySR statements of the description. "Sp(4) falsifies simple C₂+ln|Z| at 50%" is unverified. The internal notes of 27 May 2026 contradict each other on it (one of them attributes most of the deviation to the choice of couplings). Amended 2026-11-09: the SU(2) β-scan files of this record must not be used. PAPER_BETASCAN_SU2_EE (.tex, .pdf, .pdf.ots), jax_su2_EE_BETASCAN_results.json, jax_su2_EE_BETASCAN_2026-05-25.py, analysis_betascan_2026-05-25.py and jax_su2_EE_BP2008b_FAST_2026-05-25.py are the files of version v7.5.0 (10.5281/zenodo.20378901, also deposited as 10.5281/zenodo.20379361), with the same MD5 checksums. All measured values in them were produced by the Metropolis kernel jax_su2_EE_BP2008b_FAST_2026-05-25.py, which has two independent bugs: its acceptance step uses Re Tr(U·K†) where Re Tr(U·K) is required, and the forward staple has its links in the wrong order. A cold-start test of the kernel (β = 2.4, L = 8) gives ⟨P⟩ ≈ −0.18 instead of about +0.6, so the configurations are not samples of the SU(2) Wilson action. The c₃D(L, β) values, their β-dependence and the claimed cancellation of the leading area-law term are therefore not physical results. The bugs were fixed in the repository crossed-cosmos on 25 May 2026 (commits 40346b0 and 73fbc43), before this record was published, but these files were included without being re-computed, and no corrected β-scan appears in the author's records. See also the notice of 2026-07-12 on 10.5281/zenodo.20378901. This notice is not a full audit of the record. The code, the 46 data points and the SU(2) β-scan draft (PAPER_BETASCAN_SU2_EE) are not re-checked here. Amended 2026-11-09: this notice is not a full audit of the record; the code and the 46 data points are not re-checked here (for the SU(2) β-scan files, see the point above). No file of the record has been changed. Original description (27 May 2026), unchanged: Kevinotron lattice gauge theory EE engine: 46 data points across SU(2), SU(3), SU(4), G₂, Sp(4), SO(7). World-first G₂ and Sp(4) entanglement entropy. Discovery: S₂/A/β is a Dynkin invariant. PySR formula: S₂/A ≈ 5.85·(β−|Φ⁺|) − 2.23·C₂ (R²=0.999). Sp(4) falsifies simple C₂+ln|Z| at 50%. Paper PRL 3pp included.

•May 25, 2026•0 citations

Anyon Condensation in Modular Tensor Categories: Computational Classification and Algebraic Structure (v4)

Adam Bazih

Author note (Nov 2026): an independent re-derivation confirms the two-algebra classification, the SO(11)_1 condensed phase, the N+k=6 characterization and the Witt class. It also found errors to be fixed in v8: the v7 erratum wrongly removed the SU(3)_2 x SU(2)_3 algebra, which is the SU(6)_1 conformal embedding (Theorem 4.1 should read 6 of 10, one E-type); mtctools 0.3.0 uses Re(S) in its invariant routine and accepts unphysical invariants (SO(9)_2 "d_A = 4"); WITT_TABLE central charges for F4_2 (16/11) and E6_2 (22/7) were rounded; the zero-locus conjecture fails for SU(2)_7. Version 7 — strengthens and corrects v6. 1. Adjoint transparency, characterized and explained. The v6 statement ("unique to SU(3)_3 among SU(N)_N") is superseded twice over. (a) Level-rank characterization: for SU(N)_k, k>=2, S_adj,fund = 0 if and only if N+k=6 (SU(2)_4, SU(3)_3, SU(4)_2 — one level-rank orbit), proved in closed form. (b) Mechanism and cross-family classification: the adjoint is a simple-current FIXED POINT exactly for SU(N)_{6-N} and for ALL Spin(N)_2, N>=5; a two-line lemma (multiplicativity of Verlinde eigenvalues) then forces S_adj,x = 0 for every current-charged x. The previously "isolated" Sp(2)_2 = Spin(5)_2 is the first member of the infinite metaplectic family. All S-matrix zeros in the scanned families are accounted for by this mechanism or by known exceptional invariants (SU(3)_5 in SU(6)_1, G2 level 3 in E6 level 1, ...); we conjecture no accidental zeros exist in WZW modular data. 2. Corrected survey. (a) The earlier non-simple-current algebra in SU(3)_2 ⊗ SU(2)_3 does not exist (non-unitary S-matrix artifact). (b) Condensed phases are now identified by rank+twists+central charge, never by D^2 alone: the Z2 condensation of SU(2)_2 ⊗ SU(2)_2 is the pointed theory SU(4)_1 (nu=6), NOT Ising; the maximal condensation of SU(3)_3 ⊗ SU(2)_2 is the nu=11 Ising-type category of Kitaev's sixteen-fold way — the modular tensor category of SO(11)_1 (h_sigma = 11/16), which shares its fusion rules with Ising and its fusion category with SU(2)_2 but is equivalent to neither as a braided category. Its Witt class is [Ising]^11, of order 16. 3. mtctools 0.3.0. The condensable-algebra finder now uses the modular-invariant (commutant) criterion decided by exact integer programming; the previous z_l-integrality test had false negatives on conformal-embedding algebras (it rejected 1+(j=3) in SU(2)_10, 1+(2,2) in SU(3)_5, 1+(1,1) in G2_3 — all now found and covered by regression tests). Phase identification is sixteen-fold-aware (takes c mod 8). Two further fixes: a twist-rounding bug that discarded B-series algebras (including the LAGRANGIAN of SO(9)_2 — which has c=0 mod 8 and a gapped boundary), and fixed-point splitting is now restricted to cyclic stabilizers (non-cyclic cases are flagged; they require discrete-torsion data beyond (S,T)). 4. New data: a Witt-class table for the metaplectic series SO(N)_2 (N=5..13), whose vector-current condensates are pointed (rank = D^2 forces it), reducing each Witt class to an explicit finite quadratic form (e.g. (Z_11, k^2/11), (Z_13, 2k^2/13)); SO(9)_2 is Witt-trivial. See ERRATUM_v7.md for the changelog. All computations reproducible with the included package (S unitary, S^2=C, integer Verlinde, ~1e-15).

•May 12, 2026•0 citations

Chronometric Closure Paper II Modular Record Transport and Channel-Projection Compatibility in the Chronometric Source Sector

tovi zituny

Chronometric Closure Paper II: Channel-Projection Compatibility and the Algebraic Origin of the Chronometric Source Channels Tovi Zituny — Independent Researcher, May 2026 Overview This paper is the second in the Chronometric Closure Series. It addresses the principal open assumption of Chronometric Closure Paper I: channel-projection compatibility (condition E7). Paper I established that the generalized chronometric maintenance source J_source^general = κ_R D∂_τ log R + κ_D R∂τ log D − Ξ∇ ∇² log χ + O(∂_τ², ∇⁴, ℓ²) arises as the local Markovian limit of an admissible open chronometric environment — but only under the assumption that the environmental response projects onto the three chronometric channels D∂_τ log R, R∂_τ log D, and ∇² log χ. Paper I treated this mapping as a given. Paper II derives it as a conditional algebraic projection theorem. Main Result The paper formulates channel-projection compatibility as an algebraic projection problem over local chronometric diamonds equipped with von Neumann record algebras, Araki relative entropy, modular record transport, and split finite-rank control sectors. Three projection lemmas are proved: Lemma CP1 establishes the record-channel projection: the environmental response onto the record sector is identified with D∂_τ log R through the algebraic record-flow identity ∂_τ log R = −∂_τΣ_R, weighted by the distinguishability factor D. Lemma CP2 establishes the distinguishability-channel projection: the logarithmic variation of the chronometric product structure χ_ℓ = C_ℓ[DR] naturally decomposes into a record channel and a distinguishability channel via ∂_τ(DR) = DR(∂_τ log D + ∂_τ log R). Lemma CP3 establishes the spatial chronometric projection: local, short-range, isotropic split-sector spatial response acting on the logarithmic chronometric variable log χ yields the leading Laplacian term ∇² log χ. Conditional Theorem CP assembles the three lemmas into the full channel-projection compatibility result: under modular-record regularity, product-structure preservation, log-support compatibility, local isotropic spatial response, and admissible projection system conditions, the three E7 channels are recovered as conditional low-energy projections with explicit error terms. This upgrades E7 from an unconstrained matching assumption in Paper I to a conditional algebraic projection theorem. The admissibility conditions in Definition 4.1 are stated independently of the E7 conclusion — a non-tautology note is included to make this explicit. Claim Status The result is a conditional algebraic projection theorem at the derivation level of mathematical physics. It does not prove full algebraic universality, derive all environmental operators from a UV-complete chronometric algebra, or show that every microscopic completion must realize the same projections. An explicit limitation is that the distinguishability factor D is not derived from the record algebra in this paper; it enters as a preserved CIFT input and remains a target for deeper information-geometric or operator-algebraic work. Thirteen failure modes are identified and classified in a dedicated section. Structure The paper contains eleven sections. Sections 1–2 inherit the problem from Paper I and formulate the algebraic projection task. Section 3 establishes the algebraic record setting using local diamonds, von Neumann algebras, Araki relative entropy, and record-log flow. Section 4 develops modular record transport and three projection regimes. Sections 5–7 prove Lemmas CP1, CP2, and CP3. Section 8 assembles Conditional Theorem CP. Section 9 identifies thirteen failure modes and scope limits. Section 10 assesses implications for Paper I, CUP, and the closure programme. Section 11 concludes. A claim-status summary table is provided.

•May 24, 2026•0 citations

The Information Budget of the Gravitational Observer

Ram Kirpitch

In the Type II algebras of semiclassical gravity, an observer's clock with energy bounded in a band regularizes the observables of a static patch, and entropies of the resulting algebras reproduce generalized entropy. What has not been computed in that program is the mutual information budget of the observer: how many bits of clock-field correlation the observer's time-bandwidth resources permit. We prove the regularized answer: for any solution of the constraint (H_fields + H_clock)|Ψ⟩ = 0 with clock spectrum confined to bandwidth W and ticks resolved over duration T, the clock-field mutual information obeys I ≤ 2 log₂(1 + ⌊WT/2π⌋) with equality if and only if the clock is the perfect lattice clock the state that, in the de Sitter algebra of Chandrasekaran-Longo-Penington-Witten, is the maximum-entropy state describing the empty static patch. Rigidity holds: any clock with d orthogonal equally spaced ticks carries at least 2 log₂ d bits, so perfect resolution and budget saturation are the same property. Four components of the statement are measured on IBM quantum hardware: an observer ladder (the same global state read by observers of increasing resolution yields 0 → 1.7 → 3.4 → 5.2 bits, and exactly 0 for a misaligned observer); a continuous observer-frame sweep following I = 1 - h((1 + V cos θ)/2) with R² = 0.998 the ledger invariance full restoration of the correlation under the co-rotation U_A ⊗ U_B at every angle, flat to within shot noise; and the rigidity relation itself tick overlap ε and information I measured by independent circuits at seven detunings, with the forbidden region I < 2 - 2 log₂(1 + ε) empty at every point. The lift of the regularized theorem to the Type II crossed product, where empty de Sitter is conjectured to realize the perfect clock exactly, is stated as a sharp open conjecture. Statements are labelled [P] proved, [N] measured, [C] conjecture.

•Jul 17, 2026•0 citations

A Tight Computational Indistinguishability Bound for Product Distributions

Nathan Geier

Lecture notes in computer science•Jan 1, 2022•2 citations

The alphabet theorems: cancellation mechanisms, mechanism moduli, and the unique flexible family of two-symbol Kochen-Specker sets

Manuel Flores Gordillo

Companion paper to "Exact rigidity certificates for Kochen-Specker sets, the graded flex dictionary, and the Peres-Penrose circle" (https://doi.org/10.5281/zenodo.21488473). A complete algebraic theory of Kernaghan's two-symbol alphabet landscape (arXiv:2603.16988). Results: (1) the exhaustive 80-case d=3 classification: exactly FOUR independent cancellation mechanisms (rational, modulus-2, phase, golden), not two - a fifth candidate is proved identical to the phase mechanism under the alphabet's own x<->1/x gauge duality - and any generator avoiding all four provably yields a 3-colorable pool (structure theorem via Godsil-Zaks); (2) the d=4 extension: a term-alphabet lemma, 16 new mechanisms from the 280-case 4-term classification, and no colorable regime (Peres-24 anchors every pool); (3) the mechanism-moduli audit across the census, proving the forward flex bound in general; (4) the uniqueness theorem: a machine-certified KS-coloring of the full 145-ray M3-line-stable graph proves the Gould-Aravind circle is the unique positive-dimensional flexible family of two-symbol d=3 KS sets - including the honest retraction of a tempting arithmetic explanation that failed direct verification; (5) the M2 mirror: the maximal circle-stable graph is KS-uncolorable, compactness pins the M2 circle to exactly five integer-trace exact points, and the Gaussian points x=+-(1+i) carry a NEW 49-ray KS core (SAT-certified with a three-anchor-validated encoder, critical, and exactly rigid) distinct from all six census islands and from the survey's own Gaussian island (shown here to reduce to Peres-33). Flexibility tracks the circle's four conjugation-fixed points exactly (Hypothesis L), and a J-splitting construction makes the real/skew flex decomposition well-posed at conjugation-symmetric non-real points. Every claim carries an explicit evidence label (PROVED / EXACT / NUMERICAL / CONJECTURE / OPEN), each backed by a script in the attached verification suite (also public: https://github.com/manuflog/contextuality-obstructions/tree/main/rigidity). Methods note: large-language-model assistants (Anthropic Claude) were used substantially in drafting and in developing the verification suite; every mathematical claim is machine-verified independently of that assistance, and the author takes full responsibility for the results. Version 4 (July 2026) — status of the Observation 28/29 point. This paper extends and in one place corrects Part II of Kernaghan's survey (arXiv:2603.16988). The specific disputed point, the reported non-persistence of the Peres/Penrose flex, was conceded by its author in v8 of that preprint, in a labelled correction note that also publishes the cause. References are updated to v8 and the passage now describes the matter as settled. As elsewhere in this series, v8 is not treated as independent confirmation of finiteness: its continuation is double precision and its modular rank computation bounds flex only from above, as its author states. Version 5 (July 2026) — a proof step is withdrawn and replaced. The theorem is unchanged. Versions up to v4 justified the last step of the structure theorem (necessity of a mechanism for the raw pool) by invoking Godsil–Zaks, paraphrased as “rational-coordinate projective ray sets in R^n are always 3-colorable”, and concluded that the x=3 graph is 3-colorable. Both halves are false and are withdrawn. The paraphrase is false: the x=2 raw pool is a rational-coordinate ray set (49 rays, 138 orthogonal pairs) with chromatic number 4. The application is false at the pool it was applied to: the x=3 graph is not 3-colorable either, also chromatic number 4. Godsil–Zaks concerns rational points of the unit sphere, and a rational ray such as (1,1,1) does not normalize to one, so the theorem never applied to these pools at all. The theorem itself is unaffected. Graph 3-colorability was only ever a sufficient route to KS-colorability, and KS-colorability at x=3 is established directly by exhaustive certificate — 31488 distinct valid KS colorings, recomputed independently for this version. Both chromatic numbers were verified twice, by DSATUR backtracking and by SAT (Glucose3). An earlier section of the paper had already retracted this same invocation for the Re(x) = -1/2 line; that retraction should have been applied to the structure theorem at the same time and was not. It is now. Also corrected: earlier versions described cross-product completion as “the closure step that rescues the Golden and CK-31 islands from initial colorability”. That is wrong for CK-31, whose raw pool at x=2 is already KS-uncolorable (49 rays, 138 pairs, 26 triads, no valid coloring). Completion enlarges it but is not needed for uncolorability. Only the Golden island is genuinely rescued by completion. Version 6 (July 2026) — a theorem is scoped, its closed-pool reading withdrawn, and the resolution identified. The structure theorem (“no mechanism, no KS set”) was stated through v5 without an alphabet hypothesis. For Hermitian-closed complex pools it is FALSE, and the cause is a term the classification missed: with x* as an entry, (x*)*·x = x² appears, so the closed term set is {±1, ±x, ±x*, ±N, ±x², ±(x*)²}. Counterexample, verified twice in independent exact implementations: x = √3 + i avoids every locus M1–M5, yet its closed pool (145 rays / 390 pairs / 30 triads) is KS-uncolorable; unclosed it is colorable. The identity x² + (x*)² = N holds along the whole lines arg x ≡ ±30° (mod 180°), at every modulus — a positive-dimensional uncolorable locus outside the classification. The resolution, also in this version: the new lines carry no new mechanism at core level and no new flexible family. Along them the ratio x/x* is a primitive sixth root of unity at every modulus, and projective rescaling identifies the lines’ uncolorable content with the known Eisenstein island: the line-stable graph is constant in the modulus away from a finite exceptional set, all 23 of its minimal uncolorable cores (complete enumeration) consist of modulus-independent rays, every core has mechanism flex exactly 0, and all 43 rays of the certified core embed projectively into the closed ω-pool. The pool’s one genuine deformation (flex exactly 1) lives entirely on colorable decoration rays. The uniqueness theorem — the Gould–Aravind circle as the unique positive-dimensional flexible family, scoped to M1–M4 — is unaffected. A complete x²-extended classification of closed-pool identities is recorded as open. The theorem is restated with the unclosed-alphabet hypothesis (under which it is true, and true for all real x); the term-alphabet lemma, correct as literally stated, now carries its scope explicitly. Found by the program’s own adversarial verification gate; every number above is from exact arithmetic with SAT and backtracking engines agreeing. Version 7 (July 2026) — the open problem left by v6 is closed, and the two-mechanism dichotomy is restored. v6 corrected a scope error (with x* as an entry the product x² appears, so the published 80-case classification is incomplete for Hermitian-closed pools) and recorded the complete x²-extended classification as open. This version carries it out. The classification. The closed term set has six types, giving 224 three-term cases; 126 are impossible for every nonzero x, and the rest reduce to the published loci M1–M5 together with exactly four new positive-dimensional loci — x²+(x*)² = ±N (the lines arg x = ±30° and ±60°) and x²+(x*)² = ±1 (two rectangular hyperbolae) — plus eight isolated points, all of which lie on the 60° line. Restricted to the 80 published cases the same computation returns exactly the 54 impossible cases and exactly M1–M5, reproducing the original theorem. The corrected dichotomy, now a theorem rather than an open problem. The closed raw pool is KS-uncolorable if and only if (A) |x|² ∈ {2, 1/2} or x ∈ {±2, ±1/2}, or (B′) x/x* is a primitive third or sixth root of unity. Established by an audit of all 58 realizable locus-membership classes, using the fact that the index-labelled closed graph depends only on which loci x belongs to. Why this is deflationary, and the point of the version. A ratio lemma explains the new uncolorable loci rather than adding a mechanism: projective rescaling by 1/x* carries the degree-one sub-pool isomorphically onto the pool over {0, ±1, ±r} with r = x/x*, multiplying every inner product by 1/N and so preserving orthogonality exactly. Since |r| = 1, the uncolorable cases are precisely those where r is a primitive third or sixth root of unity, and there the sub-pool is the unclosed Eisenstein pool at every modulus. The two hyperbola loci are genuinely new identities but carry no uncolorable content at any point tested; the arg = 45° locus, where r = i has order four and the pool is colorable, shows that being a root of unity is necessary but not sufficient. Consequence for the two-mechanism reading. Hermitian closure does not break the dichotomy reported in arXiv:2603.16988; it relocates one half of it. The literal rule “|x|² ≥ 3 and x not a root of unity implies colorable” fails — x = √3 + i is a counterexample — but that x has x/x* = e^{iπ/3}, and the corrected statement is again exactly two mechanisms: modulus, acting on x; phase, acting on x/x*. We read this as identifying the correct invariant for the phase mechanism rather than as a counterexample to the pattern. Verification scripts x2class_derive.py, x2class_pools.py, x2class_scan.py, x2class_deflate.py and x2class_closure.py accompany this version in the public repository; every colorability verdict was decided by SAT and by an independent backtracker in agreement, in exact arithmetic in the appropriate number field.

•Jul 22, 2026•0 citations
⚠️ CORRECTION NOTICE (2026-07-12) - The boxed "Main result (Theorem)" and the abstract's "We prove an upper bound" overstate what is established: the bound depends on Assumption M1, explicitly labeled a POSTULATE (modular complexity ansatz) in this paper's own text. A contemporaneous internal multi-agent audit (3/3 independent reviewers) concluded the M1→Jacobson-EGJ bridge has "no route currently known" and recommended explicitly: "do not claim derivation." Recommend downgrading "Theorem"/"prove" to "conjectural bound under Assumption M1" in the abstract and result box.- Two papers extending Krylov complexity into the modular/horizon direction flagged as "surveillance targets" in the pre-submission novelty audit have since appeared (arXiv:2507.23739, arXiv:2602.02675); neither reproduces this paper's full composite equation, so no scoop has occurred, but the novelty margin is narrowing while this remains unsubmitted to arXiv.- This record is dormant (no update since May 2026) but not shown to be false; it sits outside the scope of the current lattice/mass-gap programme and should be read as such.``` We prove an upper bound on the rate of generalised entropy along the modular (Connes-Tomita-Takesaki) flow τ_R of a type-II crossed-product observer algebra A_R, extending the Eling-Guedens-Jacobson local Clausius schema dS = δQ/T + d_iS to the setting of Chandrasekaran-Longo-Penington-Witten and De Vuyst-Eccles-Held-Kirklin. The bound reads dS_gen[R]/dτ_R ≤ κ_R · C_k[ρ_R(τ_R)] · Θ(PH_k[δn(τ_R)]) with κ_R = 2π T_R the Bisognano-Wichmann modular surface gravity, C_k a k-design / spread complexity proxy, and Θ a topological activator on persistent homology of the dequantised classical density field δn. v6.0.16 retracts the v6.0.15 framing of M1 as a "conditional theorem" — see the framework paper (Remondière, ECI v6.0.16, DOI 10.5281/zenodo.19708889) and notes/m1_audit_2026_05_02.md. M1 retains POSTULATE status; the v8-bis math.CT companion target is Conjecture M1-C.
⚠️ CORRECTION NOTICE (2026-11-08; amended 2026-11-09) The original description of this record (27 May 2026) is kept unchanged below. It overstates what the record contains. Read it together with the correction notice of version v10.0.0 of the same concept (10.5281/zenodo.20415354, notice of 2026-07-12) and with the corrections of the repository crossed-cosmos (README, sections "STATUS UPDATE (2026-07-12)" and "INTEGRITY CORRECTION (2026-10-04)"; CHANGELOG, entry 2026-10-04). "World-first G₂ and Sp(4) entanglement entropy" is withdrawn. The priority claims, here and as "first measurement" in the included drafts, are unverified. An internal audit of 2026-06-20 also found that the G₂ result cannot be published as it stands. The G₂/SU(3) ratio given in the drafts (1.291–1.292) changes when both groups are matched at another lattice spacing. Its constancy for L = 4–12 is a stability in volume at fixed couplings, not in the lattice spacing. Part of the stored data could not be reproduced. The attribution of differences between groups to the centre (Donnelly–Wall) is an interpretation that was not tested; the code in this record makes no reference to the centre of the group. "Discovery: S₂/A/β is a Dynkin invariant" is withdrawn. It names an ordering of six numbers, one per group (file pysr_6groups_data.json, key "slopes"). The record does not show that any property of the Dynkin diagram determines them, and the two drafts included in this record do not contain the claim. The values in that file order the groups A₁ > B₃ > C₂ > A₂ > A₃ > G₂. The description of v10.0.0 states C₂ > B₃ > A₁ > A₂ > A₃ > G₂. The PySR formula is a fit, not a discovery or a derivation. Its coefficients were fitted a posteriori to the measured values of S₂/A by symbolic regression. The internal record of the fit also has an additive constant (+2.97) that the description omits. R² = 0.999 measures the quality of that fit; it is not a test on independent data. The v10 notice requalifies the later formula S₂/A = (π+e)(β−|Φ⁺|) − log(β−1−|Φ⁺|) − C₂ in the same way: (π+e) is a fitted constant, not a zero-parameter derivation. "Paper PRL 3pp included" refers to Paper_G2_EE_PRL_6groups.pdf. It is a three-page draft in PRL format, not a published PRL paper, and it still has unresolved citations and cross-references. It covers SU(2), SU(3), SU(4) and G₂ only. It contains none of the Sp(4), SO(7), Dynkin or PySR statements of the description. "Sp(4) falsifies simple C₂+ln|Z| at 50%" is unverified. The internal notes of 27 May 2026 contradict each other on it (one of them attributes most of the deviation to the choice of couplings). Amended 2026-11-09: the SU(2) β-scan files of this record must not be used. PAPER_BETASCAN_SU2_EE (.tex, .pdf, .pdf.ots), jax_su2_EE_BETASCAN_results.json, jax_su2_EE_BETASCAN_2026-05-25.py, analysis_betascan_2026-05-25.py and jax_su2_EE_BP2008b_FAST_2026-05-25.py are the files of version v7.5.0 (10.5281/zenodo.20378901, also deposited as 10.5281/zenodo.20379361), with the same MD5 checksums. All measured values in them were produced by the Metropolis kernel jax_su2_EE_BP2008b_FAST_2026-05-25.py, which has two independent bugs: its acceptance step uses Re Tr(U·K†) where Re Tr(U·K) is required, and the forward staple has its links in the wrong order. A cold-start test of the kernel (β = 2.4, L = 8) gives ⟨P⟩ ≈ −0.18 instead of about +0.6, so the configurations are not samples of the SU(2) Wilson action. The c₃D(L, β) values, their β-dependence and the claimed cancellation of the leading area-law term are therefore not physical results. The bugs were fixed in the repository crossed-cosmos on 25 May 2026 (commits 40346b0 and 73fbc43), before this record was published, but these files were included without being re-computed, and no corrected β-scan appears in the author's records. See also the notice of 2026-07-12 on 10.5281/zenodo.20378901. This notice is not a full audit of the record. The code, the 46 data points and the SU(2) β-scan draft (PAPER_BETASCAN_SU2_EE) are not re-checked here. Amended 2026-11-09: this notice is not a full audit of the record; the code and the 46 data points are not re-checked here (for the SU(2) β-scan files, see the point above). No file of the record has been changed. Original description (27 May 2026), unchanged: Kevinotron lattice gauge theory EE engine: 46 data points across SU(2), SU(3), SU(4), G₂, Sp(4), SO(7). World-first G₂ and Sp(4) entanglement entropy. Discovery: S₂/A/β is a Dynkin invariant. PySR formula: S₂/A ≈ 5.85·(β−|Φ⁺|) − 2.23·C₂ (R²=0.999). Sp(4) falsifies simple C₂+ln|Z| at 50%. Paper PRL 3pp included.
Author note (Nov 2026): an independent re-derivation confirms the two-algebra classification, the SO(11)_1 condensed phase, the N+k=6 characterization and the Witt class. It also found errors to be fixed in v8: the v7 erratum wrongly removed the SU(3)_2 x SU(2)_3 algebra, which is the SU(6)_1 conformal embedding (Theorem 4.1 should read 6 of 10, one E-type); mtctools 0.3.0 uses Re(S) in its invariant routine and accepts unphysical invariants (SO(9)_2 "d_A = 4"); WITT_TABLE central charges for F4_2 (16/11) and E6_2 (22/7) were rounded; the zero-locus conjecture fails for SU(2)_7. Version 7 — strengthens and corrects v6. 1. Adjoint transparency, characterized and explained. The v6 statement ("unique to SU(3)_3 among SU(N)_N") is superseded twice over. (a) Level-rank characterization: for SU(N)_k, k>=2, S_adj,fund = 0 if and only if N+k=6 (SU(2)_4, SU(3)_3, SU(4)_2 — one level-rank orbit), proved in closed form. (b) Mechanism and cross-family classification: the adjoint is a simple-current FIXED POINT exactly for SU(N)_{6-N} and for ALL Spin(N)_2, N>=5; a two-line lemma (multiplicativity of Verlinde eigenvalues) then forces S_adj,x = 0 for every current-charged x. The previously "isolated" Sp(2)_2 = Spin(5)_2 is the first member of the infinite metaplectic family. All S-matrix zeros in the scanned families are accounted for by this mechanism or by known exceptional invariants (SU(3)_5 in SU(6)_1, G2 level 3 in E6 level 1, ...); we conjecture no accidental zeros exist in WZW modular data. 2. Corrected survey. (a) The earlier non-simple-current algebra in SU(3)_2 ⊗ SU(2)_3 does not exist (non-unitary S-matrix artifact). (b) Condensed phases are now identified by rank+twists+central charge, never by D^2 alone: the Z2 condensation of SU(2)_2 ⊗ SU(2)_2 is the pointed theory SU(4)_1 (nu=6), NOT Ising; the maximal condensation of SU(3)_3 ⊗ SU(2)_2 is the nu=11 Ising-type category of Kitaev's sixteen-fold way — the modular tensor category of SO(11)_1 (h_sigma = 11/16), which shares its fusion rules with Ising and its fusion category with SU(2)_2 but is equivalent to neither as a braided category. Its Witt class is [Ising]^11, of order 16. 3. mtctools 0.3.0. The condensable-algebra finder now uses the modular-invariant (commutant) criterion decided by exact integer programming; the previous z_l-integrality test had false negatives on conformal-embedding algebras (it rejected 1+(j=3) in SU(2)_10, 1+(2,2) in SU(3)_5, 1+(1,1) in G2_3 — all now found and covered by regression tests). Phase identification is sixteen-fold-aware (takes c mod 8). Two further fixes: a twist-rounding bug that discarded B-series algebras (including the LAGRANGIAN of SO(9)_2 — which has c=0 mod 8 and a gapped boundary), and fixed-point splitting is now restricted to cyclic stabilizers (non-cyclic cases are flagged; they require discrete-torsion data beyond (S,T)). 4. New data: a Witt-class table for the metaplectic series SO(N)_2 (N=5..13), whose vector-current condensates are pointed (rank = D^2 forces it), reducing each Witt class to an explicit finite quadratic form (e.g. (Z_11, k^2/11), (Z_13, 2k^2/13)); SO(9)_2 is Witt-trivial. See ERRATUM_v7.md for the changelog. All computations reproducible with the included package (S unitary, S^2=C, integer Verlinde, ~1e-15).
Chronometric Closure Paper II: Channel-Projection Compatibility and the Algebraic Origin of the Chronometric Source Channels Tovi Zituny — Independent Researcher, May 2026 Overview This paper is the second in the Chronometric Closure Series. It addresses the principal open assumption of Chronometric Closure Paper I: channel-projection compatibility (condition E7). Paper I established that the generalized chronometric maintenance source J_source^general = κ_R D∂_τ log R + κ_D R∂τ log D − Ξ∇ ∇² log χ + O(∂_τ², ∇⁴, ℓ²) arises as the local Markovian limit of an admissible open chronometric environment — but only under the assumption that the environmental response projects onto the three chronometric channels D∂_τ log R, R∂_τ log D, and ∇² log χ. Paper I treated this mapping as a given. Paper II derives it as a conditional algebraic projection theorem. Main Result The paper formulates channel-projection compatibility as an algebraic projection problem over local chronometric diamonds equipped with von Neumann record algebras, Araki relative entropy, modular record transport, and split finite-rank control sectors. Three projection lemmas are proved: Lemma CP1 establishes the record-channel projection: the environmental response onto the record sector is identified with D∂_τ log R through the algebraic record-flow identity ∂_τ log R = −∂_τΣ_R, weighted by the distinguishability factor D. Lemma CP2 establishes the distinguishability-channel projection: the logarithmic variation of the chronometric product structure χ_ℓ = C_ℓ[DR] naturally decomposes into a record channel and a distinguishability channel via ∂_τ(DR) = DR(∂_τ log D + ∂_τ log R). Lemma CP3 establishes the spatial chronometric projection: local, short-range, isotropic split-sector spatial response acting on the logarithmic chronometric variable log χ yields the leading Laplacian term ∇² log χ. Conditional Theorem CP assembles the three lemmas into the full channel-projection compatibility result: under modular-record regularity, product-structure preservation, log-support compatibility, local isotropic spatial response, and admissible projection system conditions, the three E7 channels are recovered as conditional low-energy projections with explicit error terms. This upgrades E7 from an unconstrained matching assumption in Paper I to a conditional algebraic projection theorem. The admissibility conditions in Definition 4.1 are stated independently of the E7 conclusion — a non-tautology note is included to make this explicit. Claim Status The result is a conditional algebraic projection theorem at the derivation level of mathematical physics. It does not prove full algebraic universality, derive all environmental operators from a UV-complete chronometric algebra, or show that every microscopic completion must realize the same projections. An explicit limitation is that the distinguishability factor D is not derived from the record algebra in this paper; it enters as a preserved CIFT input and remains a target for deeper information-geometric or operator-algebraic work. Thirteen failure modes are identified and classified in a dedicated section. Structure The paper contains eleven sections. Sections 1–2 inherit the problem from Paper I and formulate the algebraic projection task. Section 3 establishes the algebraic record setting using local diamonds, von Neumann algebras, Araki relative entropy, and record-log flow. Section 4 develops modular record transport and three projection regimes. Sections 5–7 prove Lemmas CP1, CP2, and CP3. Section 8 assembles Conditional Theorem CP. Section 9 identifies thirteen failure modes and scope limits. Section 10 assesses implications for Paper I, CUP, and the closure programme. Section 11 concludes. A claim-status summary table is provided.
In the Type II algebras of semiclassical gravity, an observer's clock with energy bounded in a band regularizes the observables of a static patch, and entropies of the resulting algebras reproduce generalized entropy. What has not been computed in that program is the mutual information budget of the observer: how many bits of clock-field correlation the observer's time-bandwidth resources permit. We prove the regularized answer: for any solution of the constraint (H_fields + H_clock)|Ψ⟩ = 0 with clock spectrum confined to bandwidth W and ticks resolved over duration T, the clock-field mutual information obeys I ≤ 2 log₂(1 + ⌊WT/2π⌋) with equality if and only if the clock is the perfect lattice clock the state that, in the de Sitter algebra of Chandrasekaran-Longo-Penington-Witten, is the maximum-entropy state describing the empty static patch. Rigidity holds: any clock with d orthogonal equally spaced ticks carries at least 2 log₂ d bits, so perfect resolution and budget saturation are the same property. Four components of the statement are measured on IBM quantum hardware: an observer ladder (the same global state read by observers of increasing resolution yields 0 → 1.7 → 3.4 → 5.2 bits, and exactly 0 for a misaligned observer); a continuous observer-frame sweep following I = 1 - h((1 + V cos θ)/2) with R² = 0.998 the ledger invariance full restoration of the correlation under the co-rotation U_A ⊗ U_B at every angle, flat to within shot noise; and the rigidity relation itself tick overlap ε and information I measured by independent circuits at seven detunings, with the forbidden region I < 2 - 2 log₂(1 + ε) empty at every point. The lift of the regularized theorem to the Type II crossed product, where empty de Sitter is conjectured to realize the perfect clock exactly, is stated as a sharp open conjecture. Statements are labelled [P] proved, [N] measured, [C] conjecture.
Companion paper to "Exact rigidity certificates for Kochen-Specker sets, the graded flex dictionary, and the Peres-Penrose circle" (https://doi.org/10.5281/zenodo.21488473). A complete algebraic theory of Kernaghan's two-symbol alphabet landscape (arXiv:2603.16988). Results: (1) the exhaustive 80-case d=3 classification: exactly FOUR independent cancellation mechanisms (rational, modulus-2, phase, golden), not two - a fifth candidate is proved identical to the phase mechanism under the alphabet's own x<->1/x gauge duality - and any generator avoiding all four provably yields a 3-colorable pool (structure theorem via Godsil-Zaks); (2) the d=4 extension: a term-alphabet lemma, 16 new mechanisms from the 280-case 4-term classification, and no colorable regime (Peres-24 anchors every pool); (3) the mechanism-moduli audit across the census, proving the forward flex bound in general; (4) the uniqueness theorem: a machine-certified KS-coloring of the full 145-ray M3-line-stable graph proves the Gould-Aravind circle is the unique positive-dimensional flexible family of two-symbol d=3 KS sets - including the honest retraction of a tempting arithmetic explanation that failed direct verification; (5) the M2 mirror: the maximal circle-stable graph is KS-uncolorable, compactness pins the M2 circle to exactly five integer-trace exact points, and the Gaussian points x=+-(1+i) carry a NEW 49-ray KS core (SAT-certified with a three-anchor-validated encoder, critical, and exactly rigid) distinct from all six census islands and from the survey's own Gaussian island (shown here to reduce to Peres-33). Flexibility tracks the circle's four conjugation-fixed points exactly (Hypothesis L), and a J-splitting construction makes the real/skew flex decomposition well-posed at conjugation-symmetric non-real points. Every claim carries an explicit evidence label (PROVED / EXACT / NUMERICAL / CONJECTURE / OPEN), each backed by a script in the attached verification suite (also public: https://github.com/manuflog/contextuality-obstructions/tree/main/rigidity). Methods note: large-language-model assistants (Anthropic Claude) were used substantially in drafting and in developing the verification suite; every mathematical claim is machine-verified independently of that assistance, and the author takes full responsibility for the results. Version 4 (July 2026) — status of the Observation 28/29 point. This paper extends and in one place corrects Part II of Kernaghan's survey (arXiv:2603.16988). The specific disputed point, the reported non-persistence of the Peres/Penrose flex, was conceded by its author in v8 of that preprint, in a labelled correction note that also publishes the cause. References are updated to v8 and the passage now describes the matter as settled. As elsewhere in this series, v8 is not treated as independent confirmation of finiteness: its continuation is double precision and its modular rank computation bounds flex only from above, as its author states. Version 5 (July 2026) — a proof step is withdrawn and replaced. The theorem is unchanged. Versions up to v4 justified the last step of the structure theorem (necessity of a mechanism for the raw pool) by invoking Godsil–Zaks, paraphrased as “rational-coordinate projective ray sets in R^n are always 3-colorable”, and concluded that the x=3 graph is 3-colorable. Both halves are false and are withdrawn. The paraphrase is false: the x=2 raw pool is a rational-coordinate ray set (49 rays, 138 orthogonal pairs) with chromatic number 4. The application is false at the pool it was applied to: the x=3 graph is not 3-colorable either, also chromatic number 4. Godsil–Zaks concerns rational points of the unit sphere, and a rational ray such as (1,1,1) does not normalize to one, so the theorem never applied to these pools at all. The theorem itself is unaffected. Graph 3-colorability was only ever a sufficient route to KS-colorability, and KS-colorability at x=3 is established directly by exhaustive certificate — 31488 distinct valid KS colorings, recomputed independently for this version. Both chromatic numbers were verified twice, by DSATUR backtracking and by SAT (Glucose3). An earlier section of the paper had already retracted this same invocation for the Re(x) = -1/2 line; that retraction should have been applied to the structure theorem at the same time and was not. It is now. Also corrected: earlier versions described cross-product completion as “the closure step that rescues the Golden and CK-31 islands from initial colorability”. That is wrong for CK-31, whose raw pool at x=2 is already KS-uncolorable (49 rays, 138 pairs, 26 triads, no valid coloring). Completion enlarges it but is not needed for uncolorability. Only the Golden island is genuinely rescued by completion. Version 6 (July 2026) — a theorem is scoped, its closed-pool reading withdrawn, and the resolution identified. The structure theorem (“no mechanism, no KS set”) was stated through v5 without an alphabet hypothesis. For Hermitian-closed complex pools it is FALSE, and the cause is a term the classification missed: with x* as an entry, (x*)*·x = x² appears, so the closed term set is {±1, ±x, ±x*, ±N, ±x², ±(x*)²}. Counterexample, verified twice in independent exact implementations: x = √3 + i avoids every locus M1–M5, yet its closed pool (145 rays / 390 pairs / 30 triads) is KS-uncolorable; unclosed it is colorable. The identity x² + (x*)² = N holds along the whole lines arg x ≡ ±30° (mod 180°), at every modulus — a positive-dimensional uncolorable locus outside the classification. The resolution, also in this version: the new lines carry no new mechanism at core level and no new flexible family. Along them the ratio x/x* is a primitive sixth root of unity at every modulus, and projective rescaling identifies the lines’ uncolorable content with the known Eisenstein island: the line-stable graph is constant in the modulus away from a finite exceptional set, all 23 of its minimal uncolorable cores (complete enumeration) consist of modulus-independent rays, every core has mechanism flex exactly 0, and all 43 rays of the certified core embed projectively into the closed ω-pool. The pool’s one genuine deformation (flex exactly 1) lives entirely on colorable decoration rays. The uniqueness theorem — the Gould–Aravind circle as the unique positive-dimensional flexible family, scoped to M1–M4 — is unaffected. A complete x²-extended classification of closed-pool identities is recorded as open. The theorem is restated with the unclosed-alphabet hypothesis (under which it is true, and true for all real x); the term-alphabet lemma, correct as literally stated, now carries its scope explicitly. Found by the program’s own adversarial verification gate; every number above is from exact arithmetic with SAT and backtracking engines agreeing. Version 7 (July 2026) — the open problem left by v6 is closed, and the two-mechanism dichotomy is restored. v6 corrected a scope error (with x* as an entry the product x² appears, so the published 80-case classification is incomplete for Hermitian-closed pools) and recorded the complete x²-extended classification as open. This version carries it out. The classification. The closed term set has six types, giving 224 three-term cases; 126 are impossible for every nonzero x, and the rest reduce to the published loci M1–M5 together with exactly four new positive-dimensional loci — x²+(x*)² = ±N (the lines arg x = ±30° and ±60°) and x²+(x*)² = ±1 (two rectangular hyperbolae) — plus eight isolated points, all of which lie on the 60° line. Restricted to the 80 published cases the same computation returns exactly the 54 impossible cases and exactly M1–M5, reproducing the original theorem. The corrected dichotomy, now a theorem rather than an open problem. The closed raw pool is KS-uncolorable if and only if (A) |x|² ∈ {2, 1/2} or x ∈ {±2, ±1/2}, or (B′) x/x* is a primitive third or sixth root of unity. Established by an audit of all 58 realizable locus-membership classes, using the fact that the index-labelled closed graph depends only on which loci x belongs to. Why this is deflationary, and the point of the version. A ratio lemma explains the new uncolorable loci rather than adding a mechanism: projective rescaling by 1/x* carries the degree-one sub-pool isomorphically onto the pool over {0, ±1, ±r} with r = x/x*, multiplying every inner product by 1/N and so preserving orthogonality exactly. Since |r| = 1, the uncolorable cases are precisely those where r is a primitive third or sixth root of unity, and there the sub-pool is the unclosed Eisenstein pool at every modulus. The two hyperbola loci are genuinely new identities but carry no uncolorable content at any point tested; the arg = 45° locus, where r = i has order four and the pool is colorable, shows that being a root of unity is necessary but not sufficient. Consequence for the two-mechanism reading. Hermitian closure does not break the dichotomy reported in arXiv:2603.16988; it relocates one half of it. The literal rule “|x|² ≥ 3 and x not a root of unity implies colorable” fails — x = √3 + i is a counterexample — but that x has x/x* = e^{iπ/3}, and the corrected statement is again exactly two mechanisms: modulus, acting on x; phase, acting on x/x*. We read this as identifying the correct invariant for the phase mechanism rather than as a counterexample to the pattern. Verification scripts x2class_derive.py, x2class_pools.py, x2class_scan.py, x2class_deflate.py and x2class_closure.py accompany this version in the public repository; every colorability verdict was decided by SAT and by an independent backtracker in agreement, in exact arithmetic in the appropriate number field.