OAI.MUB6.Certificate.GramData.Block3.entry_11_11: intermediate lemma from OpenAI, The maximum number of mutually unbiased bases in dimension six
OpenOAI.MUB6.Certificate.GramData.Block3.entry_11_11An intermediate lemma of the split of OpenAI's proof of OAI.MUB6.fourier_and_family_bound, carved from OpenAI's openai/math development for this platform. The statement and its proof are OpenAI's (OpenAI, The maximum number of mutually unbiased bases in dimension six, OpenAI Math Release, September 24, 2026, result family 266, github.com/openai/math, Apache License 2.0); in Lean it is the declaration OAI.MUB6.Certificate.GramData.Block3.entry_11_11 of lean/OAI/Analysis/MutuallyUnbiased/GramData/Block3Check12.lean at commit 7ef5c0c, ported to Lean 4.33.1 and Mathlib 0df444a.
The statement, as published (namespace OAI.MUB6.Certificate.GramData.Block3, with open Matrix, open scoped BigOperators):
theorem entry_11_11 : Z 11 11 =
∑ k : Fin 27, lowerUnit entries k 11 * D k * lowerUnit entries k 11
Definitions. The statement is written with OAI.MUB6.Certificate.GramData.Block3.D, OAI.MUB6.Certificate.GramData.Block3.Z and OAI.MUB6.Certificate.GramData.Block3.entries (definitions bundle OAIQ106D001 of this split); OAI.MUB6.Certificate.lowerUnit (definitions bundle OAIQ106D067 of this split).
Used by. The proof of OAI.MUB6.Certificate.GramData.Block3.gram of this split imports it.
import Mathlib import Definitions.Def_OAIQ106D001 import Definitions.Def_OAIQ106D067
section
set_option linter.all false
set_option linter.unusedVariables false
set_option linter.unusedTactic false
set_option linter.unreachableTactic false
namespace OAI
namespace MUB6.Certificate.GramData.Block3
open Matrix
open scoped BigOperators
theorem entry_11_11 : Z 11 11 =
∑ k : Fin 27, lowerUnit entries k 11 * D k * lowerUnit entries k 11 := by
sorry
end MUB6.Certificate.GramData.Block3
end OAI
end