mirror of
https://github.com/allaunthefox/Research-Stack.git
synced 2026-08-13 19:50:34 +00:00
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> |
||
|---|---|---|
| .. | ||
| conversions/hardware | ||
| external/OTOM | ||
| LeanGPT | ||
| Semantics | ||
| CHAIN_ALL_REVIEW_REPORT.md | ||