oai-math-revised beta

Browse › Mathematical physics › 266 Exactly three mutually unbiased bases in dimension six

Exact Fourier certificates for complex Hadamard matrices of order six

OpenAI · September 24, 2026

Lean

Open PDFCite Report a problem Add a reference or comment Interested in working on this Start a discussion

Edit NOTES.md · Existing issues · Source on GitHub

Abstract

We prove the Fourier-vanishing conjecture of Matolcsi, Ruzsa, and Weiner: every complex Hadamard matrix of order six outside Tao's cubic equivalence class has a vanishing character sum at every permutation of $(1,1,1,-1,-1,-1)$. We also give an exact certificate excluding seven mutually unbiased bases in ℂ6; by Weiner's completion theorem, this yields an upper bound of five. Both certificates use only integer and rational arithmetic, and the complete verifier is included.

If the PDF does not display here, open it directly: Open PDF.

Notes

No notes yet. Add a reference, a comment or your name with the buttons above, or edit NOTES.md on GitHub.

Automatically collected notes (unreviewed)

work in progress

Collected automatically by AI tools (Claude Opus 5.5 and GPT-6 Astra, 2026-10-21) and not checked by a person. May be wrong or incomplete. Report an error.

Follow-up works

Comments and discussion

Formalization

  • OpenAI math release, Lean scope note for family 266 (lean/docs/266.md, 2026). The release's Lean development proves the Fourier vanishing statement for order-six Hadamard matrices not equivalent to Tao's matrix, a family bound of five, and a supporting cube-fiber cancellation lemma (MUBSix.lean, HadamardCubeFiber.lean), distinguishing these from the companion paper's exclusion of four arbitrary bases. [family-level]
  • Google DeepMind formal-conjectures, FormalConjectures/OpenQuantumProblems/13.lean (GitHub, accessed 2026-10-21). Marks the variant mutuallyUnbiasedBases_dim6_bounds.variants.upper_five (μ(6) ≤ 5) research solved with a formal_proof link to the release's Lean proof and cites this preprint, while leaving the dimension-six maximum open with sorry. [cites earlier version] [family-level]

Possibly relevant literature (found by the agent, not checked)

Digests and expositions

News and blogs

Elsewhere

Independent sites; their content is not reviewed here.

Cite

@misc{OAI:Exact-Fourier-certificates-for-complex-Hadamard-matrices-of-order-six-September-24-2026,
  author = {{OpenAI}},
  title = {{Exact Fourier certificates for complex Hadamard matrices of order six}},
  howpublished = {OpenAI Math Release preprint
                  \href{https://github.com/openai/math/blob/main/preprints/Exact-Fourier-certificates-for-complex-Hadamard-matrices-of-order-six-September-24-2026/Exact-Fourier-certificates-for-complex-Hadamard-matrices-of-order-six-September-24-2026.pdf}{OAI:Exact-Fourier-certificates-for-complex-Hadamard-matrices-of-order-six-September-24-2026}},
  year = {2026}
}

From OpenAI's README for this paper:

Verification

Run the two invariant-moment certificates with Python 3.8 or later, using only the standard library and with assertions enabled (no -O or PYTHONOPTIMIZE):

python3 verification/run.py

The wrapper checks the verifier checksum before running it. Success is a zero exit with the three output lines printed in Appendix A of the PDF. The cubic character counts are separately specified by finite sums and loops in the paper.

Lean formalization

OpenAI provides Lean files for this family: lean/docs/266.md. The Lean statements have not been checked by people against the paper's claims.

Family 266: Exactly three mutually unbiased bases in dimension six

Proves $N(6)=3$, resolving Zauner's dimension-six mutually unbiased bases conjecture: three such bases exist in ℂ6, but four cannot. The exclusion is a complete certified computation under the stated binary64 arithmetic and compiler conditions. An independent companion proves the Matolcsi–Ruzsa–Weiner Fourier-vanishing conjecture for order-six complex Hadamard matrices outside Tao's cubic equivalence class.

Other papers in this family: