Research-Stack/0-Core-Formalism/lean
Devin AI 2da4377798 feat(lean): prove greedy_sidon_sqrt injection argument
The k(k-1)/2 ≤ sup(S) bound now has the full injection proof:
- Defined pairs = offDiag.filter(fun p => p.1 > p.2)
- Proved diff is injective on pairs (via sidon_diff_injective)
- Proved diff maps pairs into Finset.Icc 1 (S.sup id)
- Applied card_le_card_of_injOn to get |pairs| ≤ S.sup id
- Final calc chain: k(k-1)/2 = |pairs| ≤ |Icc 1 sup| = sup

Only remaining sorry: |offDiag.filter(>)| = k(k-1)/2
(offDiag involution σ(a,b)=(b,a) bijects filter(>) with filter(<))

Build: 3210 jobs, 0 errors
Co-Authored-By: Allaun Silverfox <bigdataiscoming+9i37y6j2@protonmail.com>
2026-06-15 21:51:47 +00:00
..
conversions/hardware WIP: accumulated changes 2026-05-25 16:24:21 -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 feat(lean): prove greedy_sidon_sqrt injection argument 2026-06-15 21:51:47 +00:00
CHAIN_ALL_REVIEW_REPORT.md initial: sovereign research stack (consolidated, weightless, and lfs-optimized) 2026-05-04 18:11:36 -05:00