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 proof dump shows first superlinear circuit lower bound, but progress stays slow — thomasahle · 2026-11-22
- Fortnow: Fall's dramatic results show P vs NP still far from solved, as OpenAI proof dump yields first superlinear circuit lower bound — thomasahle · 2026-11-22
- One photo, 8 VLAs, only 3 correct: ERQA embodied-reasoning benchmark questioned — giffmana · 2026-11-22
- Fleuret: treat AI as oracles, not explainers — human-comprehensible math will be negligible — francoisfleuret · 2026-11-22
- Vovk paper shows probabilistically nonrandom objects have vanishing universal measure — _onionesque · 2026-11-22
- AI generates a Riemann proof, AI generates the rebuttal—and it scores 100% AI — zetalyrae · 2026-11-22