mme_CW_subrank_capacity_lower
ProvedLaser-method lower bound on the subrank capacity of the CW tensor at q = 6.
For the Coppersmith–Winograd tensor T_6, the asymptotic laser-method analysis yields
Combined with the border-rank bound (mme_CW_border_rank_le via mme_degenerates_asymptoticRank_le) and the abstract bridge mme_omega_le_of_subrank_capacity, this yields
Why this constant. at is chosen for the cleanest top-level reduction: it leaves a comfortable margin under and matches the regime where the laser-method bound for T_q becomes effective. The actual sharp value achievable by the canonical CW §7–§8 analysis (via the symmetric tensor square of with refined Salem–Spencer indexing) is somewhat larger; future refinements (Stothers, Vassilevska Williams, Le Gall, Alman–VW) will produce sharper bounds via their own subrank-capacity lower bounds on their own tensors, each as a new theorem node.
Proof status. Open. Recurses into the full Layer-2 abstract laser-method machinery:
-
Block decomposition of : the rank-one support of is 3-graded by the index type , so splits as a sum of "block tensors" indexed by triples of multi-types.
-
Restriction to a Salem–Spencer set: pick with no nontrivial 3-AP; restricting block indices to kills all collisions between block tensors (each pair of distinct surviving blocks shares no factor coordinate), turning the sum into a direct sum.
-
Each surviving block is a matrix-multiplication tensor of explicit multinomial dimensions.
-
Counting: Stirling / multinomial bounds on the number of surviving blocks plus their dimensions give the explicit value lower bound.
-
Bridge from Mathlib's Behrend bound to the -form .
These Layer-2 leaves are themselves paper-agnostic: replacing by any other tensor with a 3-graded support of the right combinatorial profile yields the same machinery.
import Definitions.Def_mme_CW_tensor import Definitions.Def_mme_subrank_capacity open MME universe u
theorem mme_CW_subrank_capacity_lower {K : Type u} [Field K] : (5 : ℝ) / 2 ≤ subrankCapacity (CWObj K 6) := by sorry