Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

OAI.MUB6.Certificate.GramAssembly.Block3.rows_eval: intermediate lemma from OpenAI, The maximum number of mutually unbiased bases in dimension six

Proved
OAI.MUB6.Certificate.GramAssembly.Block3.rows_eval

by dbenbenn · Nov 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

openai-math

An 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.GramAssembly.Block3.rows_eval of lean/OAI/Analysis/MutuallyUnbiased/GramAssembly/Block3.lean at commit 7ef5c0c, ported to Lean 4.33.1 and Mathlib 0df444a.

The statement, as published (namespace OAI.MUB6.Certificate.GramAssembly.Block3, with open scoped BigOperators):

theorem rows_eval (i : Fin 27) (x : Fin 2886 → ℝ) :
    Integer.Sparse.eval (rows i) x =
      ∑ j : Fin 27, (weights i j : ℝ) * Integer.Sparse.eval (entries i j) x

Definitions. The statement is written with OAI.MUB6.Certificate.Integer.Sparse.eval (definitions bundle OAIQ106D000 of this split); OAI.MUB6.Certificate.GramAssembly.Block3.weights (definitions bundle OAIQ106D001 of this split); OAI.MUB6.Certificate.GramAssembly.Block3.entries and OAI.MUB6.Certificate.GramAssembly.Block3.rows (definitions bundle OAIQ106D142 of this split).

Used by. The proof of OAI.MUB6.Certificate.GramAssembly.Block3.polynomial_interpretation of this split imports it.

Preamble
import Mathlib
import Lean.Elab.Tactic.Omega
import Definitions.Def_OAIQ106D142
Formal statement
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.GramAssembly.Block3

open scoped BigOperators

theorem rows_eval (i : Fin 27) (x : Fin 2886 → ℝ) :
    Integer.Sparse.eval (rows i) x =
      ∑ j : Fin 27, (weights i j : ℝ) * Integer.Sparse.eval (entries i j) x := by
  sorry

end MUB6.Certificate.GramAssembly.Block3

end OAI
end
Source
OpenAI, The maximum number of mutually unbiased bases in dimension six, OpenAI Math Release, September 24, 2026, https://github.com/openai/math (result family 266; paper: https://github.com/openai/math/blob/7ef5c0cc5ca4b0e072b7a050fca09ab24bc6fa3a/preprints/The-maximum-number-of-mutually-unbiased-bases-in-dimension-six-September-24-2026/The-maximum-number-of-mutually-unbiased-bases-in-dimension-six-September-24-2026.pdf; Apache License 2.0); Lean: https://github.com/openai/math/blob/7ef5c0cc5ca4b0e072b7a050fca09ab24bc6fa3a/lean/OAI/Analysis/MutuallyUnbiased/GramAssembly/Block3.lean (declaration OAI.MUB6.Certificate.GramAssembly.Block3.rows_eval)

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me