OpenAI's Lean Formalization Proves Weaker Bound for Mutually Unbiased Bases in Dimension Six
MarioKrenn6240 · x · 2026-10-07
OpenAI's math repo on GitHub contains a Lean formalization related to the claim that at most three mutually unbiased bases exist in C^6. Notably, the formalization only proves a weaker bound of five members, not the paper's bound of three. It also establishes a cancellation lemma for order-six complex Hadamard matrices, illustrating both the progress and limits of AI-assisted math formalization.
More from Research
- OpenAI proves matrix multiplication solvable in O(n^2.25) operations — but no algorithm yet — Pascallisch · 2026-10-07
- Melanie Mitchell fires back: cites recent LLM research, two NeurIPS papers — MelMitchell1 · 2026-10-07
- Integer multiplication faster than N log N? Algorithm fans call it "cursed" — QuintinPope5 · 2026-10-07
- OpenAI Researcher Surprised AI Lab Math Results So Far All Hold Up — willdepue · 2026-10-07
- Frontier LLMs as simulators of human biologists will land faster than 'virtual cells' — CatAstro_Piyush · 2026-10-07
- AI claims progress on 90 of 500 major open math problems, including partial Riemann Hypothesis results — DavidSKrueger · 2026-10-07