Six mutually unbiased complex Hadamard matrices of order six
OpenRybinAI2026.P16.six_mutually_unbiased_hadamardsThis is the open dimension-six existence problem in unnormalized Hadamard coordinates, not an established existence theorem.
There exist six complex matrices of order six, indexed by , satisfying
for every matrix and every entry, and satisfying
for every pair of column indices. All three conditions concern the same six matrices. Entries are arbitrary complex numbers; no restriction to roots of unity, Fourier families, tensor products, or separately dephased representatives is imposed.
This formulation removes the computational basis and clears the normalization denominators from the remaining equations. The overlaps are required for the fifteen unordered pairs; conjugate-transpose symmetry recovers the reverse orders. The assertion retains the unresolved existence content of the seven-basis problem.
Formalization Note. The column Gram convention is used, matching the mission. For square matrices this is equivalent to the row Gram convention in equation (5.5) of the source. The cross-Gram condition is the entrywise modulus part of equation (5.16); its orthogonality follows from the individual Hadamard identities.
import Mathlib.LinearAlgebra.Matrix.ConjTranspose import Mathlib.Data.Complex.Basic open Matrix open scoped ComplexConjugate Matrix
theorem RybinAI2026.P16.six_mutually_unbiased_hadamards :
∃ H : Fin 6 → Matrix (Fin 6) (Fin 6) ℂ,
(∀ r, (H r)ᴴ * H r = (6 : ℂ) • (1 : Matrix (Fin 6) (Fin 6) ℂ)) ∧
(∀ r i j, Complex.normSq (H r i j) = 1) ∧
(∀ r s, r < s → ∀ i j,
Complex.normSq (((H r)ᴴ * H s) i j) = 6) := by sorry