Exact Fourier certificates for complex Hadamard matrices of order six

OpenAI

If an order-six complex Hadamard matrix and its entrywise square are both Hadamard, the matrix is equivalent to Tao’s cubic example.

What was already known

The earlier Butson classification treats matrices already known to have cube-root entries. The paper proves that the entrywise-square condition forces that class. The cataloged Fourier-vanishing assertion excludes the cubic class and is a distinct statement.

AI involvement AI-led

The manuscript credits OpenAI as author, and the pinned release attributes its manuscripts to the internal model. Individual session details are undocumented.

Importance Notable

Reduces the general entrywise-square condition to the previously classified cube-root case.

Technical verification Partial

The OpenAI scope checks a supporting cube-fiber cancellation lemma for matrices whose entries and entrywise squares are Hadamard. The full classification is Proposition 4.1 of the manuscript.

Formal checking

The OpenAI scope checks a supporting cube-fiber cancellation lemma for matrices whose entries and entrywise squares are Hadamard. The full classification is Proposition 4.1 of the manuscript.

Checker
OpenAI’s reported Lean formalization
Scope
Cube-fiber cancellation for pairs of rows in order-six S-Hadamard matrices
Basis
Reported by the linked checker

Human understanding Few

The reviewed sources do not document a human explanation of the assessed contribution.

Correction and publication history