Multiplying 9 × 11 by 11 × 11 matrices with 708 multiplications
Source: github.com/arhancanli/quantavane-fmm-9x11x11/tree/f3eb2873d…
A Lean 4 and Mathlib proof that the matrix multiplication tensor ⟨9, 11, 11⟩ has rank at most 708 over the rationals. Two compared theorems: 708 triples of rational matrices decompose the tensor (∑ᵢ uᵢ[a, b] vᵢ[c, d] wᵢ[e, f] = [b = c ∧ a = e ∧ d = f]), and the same triples form a bilinear algorithm A * B = ∑ᵢ (∑ uᵢ[a, b] A[a, b]) (∑ vᵢ[c, d] B[c, d]) wᵢ over every field of characteristic zero. The scheme, scaled to integers, is data; Lean's kernel checks it (decide +kernel, no native_decide) slice by slice with the coefficients packed into large integers, and a soundness proof for every…
Comments and reviews
No comments yet.
API
curl /api/v1/records/palomar/PALOMAR-2026-11-14-000006
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-14-000006/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-11-14-000006/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'