An ordered semiring certificate gives an exact-rank obstruction
ProvedOAI.MatrixMultiplication.AuxiliarySeparation.catalytic_semiring_obstructionmatrix-multiplicationoai-matmul-modulartensor-rank
For a field , let be the exact rank of the square matrix multiplication coefficient tensor of size , and let . Let be a preordered commutative semiring with nonnegative elements and monotone addition and multiplication. Suppose a monotone function satisfies for natural , and a map satisfies
Assume also that implies in , for all natural . If , , and satisfy , , and , then
These explicit compatibility hypotheses connect an abstract catalytic inequality with actual tensor rank.
Preamble
import Lean.Elab.Tactic.Omega import Mathlib.Algebra.AddTorsor.Basic import Mathlib.Algebra.Algebra.Rat import Mathlib.Algebra.BigOperators.Field import Mathlib.Algebra.BigOperators.Fin import Mathlib.Algebra.BigOperators.Group.Finset.Basic import Mathlib.Algebra.BigOperators.Group.Finset.Piecewise import Mathlib.Algebra.BigOperators.GroupWithZero.Finset import Mathlib.Algebra.BigOperators.Ring.Nat import Mathlib.Algebra.Group.Equiv.Basic import Mathlib.Algebra.Order.AbsoluteValue.Basic import Mathlib.Algebra.Order.Archimedean.Basic import Mathlib.Algebra.Order.BigOperators.Group.Finset import Mathlib.Algebra.Order.BigOperators.Ring.Finset import Mathlib.Algebra.Order.Floor.Ring import Mathlib.Algebra.Order.Floor.Semiring import Mathlib.Algebra.Order.Group.Unbundled.Int import Mathlib.Algebra.Order.Ring.Defs import Mathlib.Algebra.Order.Ring.Rat import Mathlib.Algebra.Polynomial.BigOperators import Mathlib.Algebra.Polynomial.Degree.Lemmas import Mathlib.Algebra.Polynomial.Div import Mathlib.Algebra.Polynomial.Eval.Defs import Mathlib.Algebra.Polynomial.Expand import Mathlib.Algebra.Ring.GeomSum import Mathlib.Analysis.Asymptotics.SpecificAsymptotics import Mathlib.Analysis.Convex.Caratheodory import Mathlib.Analysis.Convex.Cone.Dual import Mathlib.Analysis.Convex.GaugeRescale import Mathlib.Analysis.Convex.Jensen import Mathlib.Analysis.Convex.PartitionOfUnity import Mathlib.Analysis.Convex.Topology import Mathlib.Analysis.Normed.Affine.AddTorsorBases import Mathlib.Analysis.SpecialFunctions.BinaryEntropy import Mathlib.Analysis.SpecialFunctions.Log.Base import Mathlib.Analysis.SpecialFunctions.Log.Basic import Mathlib.Analysis.SpecialFunctions.Log.NegMulLog import Mathlib.Analysis.SpecialFunctions.Pow.Continuity import Mathlib.Analysis.SpecialFunctions.Pow.NNReal import Mathlib.Analysis.SpecialFunctions.Pow.Real import Mathlib.Analysis.SpecialFunctions.Stirling import Mathlib.Analysis.SpecificLimits.Basic import Mathlib.Analysis.SpecificLimits.Normed import Mathlib.Combinatorics.Additive.AP.Three.Defs import Mathlib.Combinatorics.Enumerative.DoubleCounting import Mathlib.Data.Complex.Basic import Mathlib.Data.Fin.Rev import Mathlib.Data.Fintype.BigOperators import Mathlib.Data.Fintype.EquivFin import Mathlib.Data.Fintype.Option import Mathlib.Data.Fintype.Perm import Mathlib.Data.Fintype.Sum import Mathlib.Data.Matrix.Mul import Mathlib.Data.Nat.Choose.Multinomial import Mathlib.Data.Nat.Lattice import Mathlib.Data.Nat.Log import Mathlib.Data.Rat.BigOperators import Mathlib.Data.Rat.Floor import Mathlib.Data.Rat.Lemmas import Mathlib.Data.Real.Basic import Mathlib.Data.Set.Finite.Basic import Mathlib.FieldTheory.IntermediateField.Adjoin.Basic import Mathlib.FieldTheory.IsAlgClosed.AlgebraicClosure import Mathlib.Geometry.Convex.Cone.Pointed import Mathlib.GroupTheory.GroupAction.Quotient import Mathlib.GroupTheory.MonoidLocalization.GrothendieckGroup import Mathlib.GroupTheory.Perm.DomMulAct import Mathlib.LinearAlgebra.Basis.Defs import Mathlib.LinearAlgebra.Dual.Lemmas import Mathlib.LinearAlgebra.FiniteDimensional.Basic import Mathlib.LinearAlgebra.FiniteDimensional.Lemmas import Mathlib.LinearAlgebra.Finsupp.LinearCombination import Mathlib.LinearAlgebra.Lagrange import Mathlib.LinearAlgebra.Matrix.Rank import Mathlib.LinearAlgebra.PiTensorProduct import Mathlib.LinearAlgebra.PiTensorProduct.Basis import Mathlib.LinearAlgebra.StdBasis import Mathlib.LinearAlgebra.TensorProduct.Pi import Mathlib.Logic.Equiv.Fin.Basic import Mathlib.Logic.Equiv.Prod import Mathlib.Logic.Equiv.Sum import Mathlib.Order.Antisymmetrization import Mathlib.Order.ConditionallyCompleteLattice.Basic import Mathlib.RingTheory.Polynomial.DegreeLT import Mathlib.RingTheory.RootsOfUnity.AlgebraicallyClosed import Mathlib.Tactic import Mathlib.Tactic.FieldSimp import Mathlib.Tactic.FinCases import Mathlib.Tactic.FunProp import Mathlib.Tactic.Linarith import Mathlib.Tactic.LinearCombination import Mathlib.Tactic.NormNum import Mathlib.Tactic.Positivity import Mathlib.Tactic.Push import Mathlib.Tactic.Ring import Mathlib.Tactic.SplitIfs import Mathlib.Topology.Algebra.Module.FiniteDimension import Mathlib.Topology.Algebra.Order.Field import Mathlib.Topology.Order.MonotoneConvergence import Definitions.Def_OAI429_GenericRank import Theorems.Thm_OAI_MatrixMultiplication_AuxiliarySeparation_catalytic_power_comparison import Theorems.Thm_OAI_MatrixMultiplication_AuxiliarySeparation_catalytic_rank_bound_at_slack import Theorems.Thm_OAI_MatrixMultiplication_AuxiliarySeparation_coefficient_le_of_nat_mul_bound import Theorems.Thm_OAI_MatrixMultiplication_AuxiliarySeparation_spectral_bound_of_positive_slack import Theorems.Thm_OAI_MatrixMultiplication_Foundation_Tensor_RankAtMost_card_le_of_identity import Definitions.Def_mme_omega set_option autoImplicit false set_option linter.all false open scoped Classical
Formal statement
theorem OAI.MatrixMultiplication.AuxiliarySeparation.catalytic_semiring_obstruction.{u_1, u_2} :
∀ {𝕜 : Type u_1} [inst : Field 𝕜] {S : Type u_2} [inst_1 : CommSemiring S] [inst_2 : Preorder S],
(∀ {a b c e : S}, a ≤ b → c ≤ e → a + c ≤ b + e) →
(∀ {a b c e : S}, a ≤ b → c ≤ e → a * c ≤ b * e) →
(∀ (a : S), 0 ≤ a) →
∀ (ρ : S → ℕ),
Monotone ρ →
(∀ (m : ℕ) (s : S), ρ (↑m * s) ≤ m * ρ s) →
∀ (M : ℕ → S),
(∀ (a b : ℕ), M (a * b) = M a * M b) →
(∀ (a j : ℕ), M (a ^ j) = M a ^ j) →
(∀ (a : ℕ), ρ (M a) = OAI.MatrixMultiplication.AuxiliarySeparation.exactMatrixRank 𝕜 a) →
(∀ (n j g : ℕ),
OAI.MatrixMultiplication.AuxiliarySeparation.exactMatrixRank 𝕜 g ≤ n ^ j →
M g ≤ HPow.hPow (α := S) (↑n) j) →
∀ (D s : S) (d k C : ℕ),
0 < d →
1 ≤ s →
D + M d * s ≤ D + ↑k * s →
D ≤ ↑C * s →
HPow.hPow (α := ℝ) (↑d)
(OAI.MatrixMultiplication.AuxiliarySeparation.exactRankExponent 𝕜) ≤
↑k
:= by sorry
Source