OAI.MatrixMultiplication.complex_alpha_gt_93_div_200
OpenThe theorem states that the complex dual matrix multiplication exponent complexAlpha is strictly greater than 93/200. Here complexAlpha is defined as the supremum of the set of real k in the closed interval [0,1] for which rectangularOmega over the complex numbers equals 2. The quantity rectangularOmega(ℂ,k) is the infimum of all exponents τ that are admissible for multiplying an n × ⌈n^k⌉ matrix by an ⌈n^k⌉ × n matrix over ℂ. A real τ is admissible when, for every ε > 0, there is a constant C > 0 such that for every n ≥ 1 some correct straight-line arithmetic program computes the product of all such matrices using at most C·n^(τ+ε) gates, where constants and inputs cost nothing and each addition, subtraction or multiplication of earlier registers costs one. Equivalently, some k in [0,1] with k > 93/200 has rectangularOmega(ℂ,k) = 2.
-- Generated from openai/math @ adc7f1241b42e322a6451854ab7e4b4c146bf78a -- Source: lean/ComparatorChallenges/MatrixMultiplication.lean; bytes 3783..3881 -- Kind: theorem; original declaration names and bodies preserved. -- Source groups are independent. Target: Lean 4.33.1; see compilation.json. import Mathlib import Definitions.Def_MatrixMultiplication namespace OAI namespace MatrixMultiplication
theorem complex_alpha_gt_93_div_200 :
(93 : ℝ) / 200 < Arithmetic.complexAlpha := by
sorry
end MatrixMultiplication
end OAI
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.