The Matolcsi-Ruzsa-Weiner Fourier-vanishing conjecture for complex Hadamard matrices of order six
For a complex Hadamard matrix of order six (, ) and with , let . Orthogonality forces . In their Fourier approach to mutually unbiased bases in dimension six, Matolcsi, Ruzsa and Weiner (2013, Conjecture 2.3) conjectured a further vanishing at the charge , with one exceptional equivalence class, Tao's cubic matrix ; Maxwell and Brierley proved it for the Karlsson family. Does hold for every coordinate permutation and every not equivalent to Tao's matrix?
- Result
- Proved(see note)
- Status
- Candidate (review pending)
- AI contribution
- AI-discovered
- Method
- Computation
- Field
- Complex Hadamard matrices of order six
- Posed by
- Mate Matolcsi, Imre Z. Ruzsa and Mihaly Weiner (Conjecture 2.3, Australas. J. Combin. 55, 2013)
- Year posed
- 2013
- Years open
- 13y
- Solved
- 2026-09-24
- Model
- Unreleased internal OpenAI model
- Vendor
- OpenAI
- Collaborators
- —
- Verification
- Lean-checked, statement unaudited
- Publication
- Announced
- Collection
- OpenAI math release (October 2026), version adc7f12
- Significance
- 12 / 100
- Disclosed cost
- —
- Wikipedia
- No dedicated article
What was actually shown
Theorem 1.1: every complex Hadamard matrix of order six not equivalent to Tao's cubic matrix has for every permutation of . Theorem 1.2, by a second exact certificate and Weiner's completion theorem, excludes seven mutually unbiased bases in , giving . It does not prove the further Matolcsi-Matszangosz-Varga-Weiner conditions for MUB triplets or the bound , which is the companion's computer-assisted claim.
What the AI did
The release README says every result in openai/math was produced by an unreleased internal OpenAI model with a fixed procedure, on average about three hours of ChatGPT Pro thinking compute per result. This result is not one of the README's two exceptions (the Hodge conjecture for CM abelian varieties and the Re(s) > 11/12 zero-free region). The manuscript is authored 'OpenAI' and names no human author. The proof is an exact invariant-moment certificate in integer and rational arithmetic, with a standard-library Python verifier included in the manuscript folder.
Verification
No independent mathematician has checked this yet. Checked here: Theorem 1.1 of the manuscript was read against MRW Conjecture 2.3; the manuscript notes its normalization divides the conjecture's sums by six, which does not affect vanishing. The verifier was not re-run here. Lean: lean/ComparatorChallenges/MUBSix.json exists with solution_module OAI.Analysis.MutuallyUnbiased.Main, whose file exists at the pinned commit; this challenge is not in lean/formalization.yaml. The statement MUBSix.lean was read here: its first conjunct says that for every 6x6 complex matrix with unimodular entries and that is not equivalent (row and column permutations and unit phases) to the cube-root matrix with Tao's exponent pattern, the normalized character sum vanishes at every permutation of . This states the headline; the second conjunct is the bound of five bases. Not rebuilt here. Permitted axioms: propext, Quot.sound, Classical.choice.