allaun 248cf747bf proof(lean): close e8_levelset_density via σ₃(n) ≤ n⁴ divisor bound ... - e8_levelset_density (T=N⁴): proven by showing E8LevelSet(N⁴,N) ⊇ [1,N]. Key chain: σ₃(n) = ∑_{d|n} d³ ≤ card(div(n))·n³ ≤ n·n³ = n⁴ ≤ N⁴. card(div(n)) ≤ n from div(n) ⊆ Icc 1 n; then N/(log 2 N)² ≤ N ≤ card. - sidon_weight_bound: one remaining sorry (ANALYTIC_OPEN — E₈ convolution identity summed over Sidon pairs; corrected LHS uses σ₃(a)·σ₃(b) products). - §14 summary updated. Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>		2026-06-16 15:04:04 -05:00
..
conversions/hardware	chore(repo): push local 768-commit branch state onto clean remote baseline	2026-06-15 22:46:50 -05:00
external/OTOM	WIP: accumulated changes	2026-05-25 16:24:21 -05:00
LeanGPT	Remove legacy Python prototypes superseded by Lean formalization	2026-05-19 15:34:17 +00:00
Semantics	proof(lean): close e8_levelset_density via σ₃(n) ≤ n⁴ divisor bound	2026-06-16 15:04:04 -05:00
singer-theorem-lean	chore(repo): push local 768-commit branch state onto clean remote baseline	2026-06-15 22:46:50 -05:00
CHAIN_ALL_REVIEW_REPORT.md	initial: sovereign research stack (consolidated, weightless, and lfs-optimized)	2026-05-04 18:11:36 -05:00