UnifiedCovariant.lean:
- Quarantined Layer 2/2b: goldenEndomorphism, eigensolid_convergence,
crossingMatrix, and Sidon-orthogonality bypass sections removed due to
Mathlib 4.30.0-rc2 import path incompatibilities (Topology.*, LinearAlgebra.Basic)
- Wired Layer 2c: NR bracket MC equation (gate_C_d_CE_mu_zero from
CartanConnection.lean) and Yang-Baxter integrability
(layer_2d_yang_baxter_holds from YangBaxter.lean) with full docstrings
- Fixed Sidon lemma: revert+dec_trivial replaces direct dec_trivial
(fixes 'Expected type must not contain free variables' on Fin 8)
AGENTS.md:
- Added CartanConnection and YangBaxter to module status table
- Documented Layer 2c/2d architecture and Layer 2b quarantine
- Updated sorry counts (Layer 3 only, 7 geometric conjectures)
Build: 3299 jobs, 0 errors (lake build SilverSight.PIST.UnifiedCovariant)
Also verified: SilverSight.PIST.CartanConnection and
SilverSight.PIST.YangBaxter build cleanly
R = B⊗B satisfies R12 R13 R23 = R23 R13 R12 on Q^2 x Q^2 x Q^2.
Sidon crossing block B = [[39/256, 1/7], [1/7, 39/256]].
Proof is by alpha-equivalence (rfl) — both sides differ only
by renaming bound variable r→s. No native_decide needed.
Previous derivation used wrong YB equation form
((R⊗I)(I⊗R)(R⊗I) vs (I⊗R)(R⊗I)(I⊗R)) which had 32/64 false.
Correct form (R12 R13 R23) verified 0 violations via Python.
Build: 3335/3336 jobs, 0 errors (lake build SilverSightRRC)
- chentsov_theorem_axiom now takes explicit IsChentsovInvariant g argument
- theorem chentsov_theorem updated to match
- Build: 3307 jobs, 0 errors, 0 sorries in ChentsovFinite
The old bridge claimed fisherMetric50 p i j = fisherMetric p (tangentBasis i 0)
(tangentBasis j 0), which is WRONG — tangentBasis has a 1/p_0 cross-term.
Correct bridge: fisherMetric p (Pi.single i 1) (Pi.single j 1) = fisherMetric50 p i j
This is trivially true: ∑_k (δ_ik * δ_jk)/p_k = δ_ij/p_i.
Also fixed:
- Import syntax error (missing -/ closure)
- Import path: library.ChentsovFinite → CoreFormalism.ChentsovFinite
- Added BindingSiteHachimoji to lakefile
Note: ChentsovFinite.lean has broken Mathlib imports (pre-existing).
The h_fisher_basis proof is verified correct in isolation.
The Lean Hkdf had a bug: it used γ^(m+n+1) where γ=1/x, which gives
1/x^(m+n+1). But α and β (both = x) were passed but unused. The Python
verification divides by (α*β)^(m+n+1) = x^(2(m+n+1)).
With the old formula, (2,13,90,3) projection gate computed
1942069/2^17 ≈ 14.8 > 1/26 (FAILS). With the corrected formula
1942069/2^34 ≈ 1.13e-4 < 1/26 (PASSES).
Also:
- Removed floating docstrings that caused parser errors
- goormaghtigh_passes_rrc now proves BOTH cases via simp+norm_num
- closePair_threshold proves all 32 cases via simp+rcases+norm_num
- section4_rrc_kernel: 0 sorries, 3298 jobs, 0 errors
- Removed hardcoded Goormaghtigh base cases from repunit
- All Goormaghtigh references now use base form (2,5,5,3) and (2,13,90,3)
- closePairs list verified with simp+rcases+norm_num (32 cases)
- rrc_characterizes_goormaghtigh forward direction fixed
- One sorry remains: goormaghtigh_passes_rrc case (2,13,90,3)
simp+norm_num cannot evaluate H_13(1/2) = 1964665 without
over-reducing to False. Python verification confirms all 3 gates pass.
- Added @[simp] lemmas for hermitePoly (zero, one, succ_succ)
- closePairsVerified helper removed (was overcomplicated)
- native_decide also fails for (2,13,90,3) due to Rat overflow
Removed hardcoded Goormaghtigh base values (31→2, 8191→2).
The standard repunit naturally gives R_5(2)=31=R_3(5) and
R_13(2)=8191=R_3(90), so the merge threshold is 0 for Goormaghtigh
solutions without special cases.
Fixed all docstrings to use correct notation (base/exponent, not value).
fisherMetric50 (diagonal) = fisherMetric (bilinear) on full space.
On tangent space, they differ by 1/p_0 cross-term.
Bridge: full-space metric is determined by tangent-space restriction.
chentsov_theorem gives uniqueness on tangent space.
Lifting to full space is standard linear algebra.
chentsov_50 sorry updated with correct SplitEmbedding type
and h_pos hypothesis. Bridge requires chentsov_theorem (3 internal sorries).
The sorry is a type bridge between AminoAcidDistribution and
RiemannianMetric 50. The mathematical content (Chentsov uniqueness
for n=50) is correct — ChentsovFinite.lean has chentsov_theorem
for arbitrary n ≥ 3.
Remaining work: convert AminoAcidDistribution ↔ openSimplex 50,
fisherMetric50 ↔ fisherMetric, MarkovEmbedding ↔ MarkovMorphism.
Q16_16 unification (5 duplicates in PVGS_DQ_Bridge) deferred:
files have Mathlib compatibility issues, not in lakefile.
Added:
- closePairs: 32 non-Goormaghtigh close pairs in BMS domain
- 32 explicit theorems: each pair has threshold ≥ 1/1000000
Verified by norm_num (pure arithmetic, no native_decide)
- nonClose_threshold: all other BMS pairs have threshold ≥ 1/1000
(TI-84 verified, sorry for now)
Main theorem proof structure:
Case 1: close pair → look up explicit theorem (32 cases)
Case 2: non-close pair → threshold ≥ 1/1000 > 1/1000000 (linarith)
Remaining sorries: 3 (wiring, not math)
- nonClose_threshold: finite check over 958K pairs
- main theorem: wire explicit close-pair theorems
- corollary: wire to corrected unknown_fails_rrc
No Baker. No Matveev. Pure integer arithmetic.
Fixed theorem statement:
- Removed wrong h : repunit x m = repunit y n hypothesis
- Added BMS bounds (x,m,y,n ≤ 90,13,90,13)
- Changed conclusion to mergeAdmissibleThreshold ≥ 1/1000000
- Updated Goormaghtigh solution references (4 directions)
TI-84 verification: 979 × 979 pairs in BMS domain.
Only 2 collision groups (Goormaghtigh solutions).
Closest non-Goormaghtigh: 28× above 10^-6 threshold.
No Baker. No Matveev. Pure integer arithmetic.
Corollary updated with TODO for wiring corrected theorem.
The BMS region (x ∈ [2,90], m ∈ [3,13]) is finite.
interval_cases x <;> interval_cases m <;> native_decide
verifies all 979 cases computationally.
Formula-first: the formula was verified by adversarial review
before the proof was written.
Critical bug fix: dna_codec.py used biological base ordering (ATGCBSPZ)
instead of ASCII-ordered spec ordering (ABCGPSTZ). This violated the core
monotonicity axiom (int rank = lexicographic rank) that the entire monotone
LUT pipeline depends on.
Changes:
- python/dna_codec.py: BITS_TO_BASE, HACHIMOJI_BASES, LATIN_TO_GREEK
corrected to ABCGPSTZ ordering; encode_binary_vector parameter renamed
bases_per_var; module docstring updated
- tests/test_dna_codec.py: hardcoded byte→DNA expectations updated for new
ordering (0xFF→ZZT, 0xd1→TPC); bases_per_var parameter name updated;
31/31 tests green
- formal/CoreFormalism/HachimojiLUT.lean: replace fragile
canonical_phases_preserved.2.2.2.2.2.1 chains with named obtain
destructuring in pythagorean_position and contradiction_position
- docs/UNIFIED_THEORY.md: add ground-truth caveat to epigenetic optimizer
results table (n≥24 results are local optima, not verified global minima)
Note: test_dna_nn.py has 4 pre-existing failures (Ising chain correlations)
unrelated to this fix — dna_qubo_nn.py has its own base encoding and does
not import dna_codec.py.
Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>
Ports three Research Stack RRC gates into formal/SilverSight/RRC/ using the existing CoreFormalism braid and Q16_16 surfaces.
Adds a Lean ↔ C ↔ Python Q16_16 roundtrip test:
- c/q16_canonical.c: canonical saturating Q16_16 C library
- exe/Q16_16Roundtrip.lean: Lake extern_lib linked executable
- tests/test_q16_roundtrip.py: Python ↔ C harness (revived from quarantine)
Updates lakefile.lean with q16-roundtrip executable and extern_lib q16_canonical.
Build: lake build SilverSightRRC 3006 jobs, 0 errors; q16-roundtrip 5949 jobs, 0 errors
