Lemma 5.1: five recursive fourth-power constituent values
Openmme_stothers_lemma51_recursive_valuesLet be an arbitrary field and let satisfy . Put
Write
For each row and every fixed real with , the cyclic symmetrization of the corresponding literal constituent of has tau-value at least .
This strict-lower-base form is the source-faithful encoding of the five limiting exponential-rate bounds in Davie--Stothers Lemma 5.1. The cyclic symmetrization represents the cube in the platform's normalization . The strict inequality is essential: the platform predicate requires a constant-relative finite witness, whereas the paper's pruning argument may lose a subexponential factor and therefore need not attain the limiting base itself.
import Definitions.Def_mme_stothers_fourth_data open MME universe u set_option autoImplicit false
theorem mme_stothers_lemma51_recursive_values
{K : Type u} [Field K] (tau : Real)
(htauLower : 2 ≤ 3 * tau) (htauUpper : 3 * tau ≤ 3) :
(∀ V : Real, 0 ≤ V →
V < MME.StothersFourth.classValue 6 tau 5 →
HasTauValueAtLeast
(cyclicSymmetrization
(MME.StothersFourth.cwFourthConstituent K 6 1 1 6)) tau V) ∧
(∀ V : Real, 0 ≤ V →
V < MME.StothersFourth.classValue 6 tau 6 →
HasTauValueAtLeast
(cyclicSymmetrization
(MME.StothersFourth.cwFourthConstituent K 6 1 2 5)) tau V) ∧
(∀ V : Real, 0 ≤ V →
V < MME.StothersFourth.classValue 6 tau 7 →
HasTauValueAtLeast
(cyclicSymmetrization
(MME.StothersFourth.cwFourthConstituent K 6 1 3 4)) tau V) ∧
(∀ V : Real, 0 ≤ V →
V < MME.StothersFourth.classValue 6 tau 8 →
HasTauValueAtLeast
(cyclicSymmetrization
(MME.StothersFourth.cwFourthConstituent K 6 2 2 4)) tau V) ∧
(∀ V : Real, 0 ≤ V →
V < MME.StothersFourth.classValue 6 tau 9 →
HasTauValueAtLeast
(cyclicSymmetrization
(MME.StothersFourth.cwFourthConstituent K 6 2 3 3)) tau V) := by
sorryRead-back
What the Lean code literally says, in plain math · gpt-5.6-sol
For every universe level , every type equipped with a field structure (with no further restriction on the field), and every real number such that , the following five assertions hold simultaneously. Put , , and , where these are real powers, and put , , , , and ; these are exactly the five threshold entries at zero-based indices , and the hypotheses on make and positive, so the displayed denominators are nonzero. To define the tensors occurring in the assertions, let be the standard basis of , let , and form the modewise Kronecker product , with exactly these parentheses. Give a standard-basis coordinate grade when , grade when , and grade otherwise. In each of the three mode spaces of , the tensor-product basis is indexed by , and that basis vector has grade . For , let be the tensor obtained from by projecting mode onto the span of its grade- basis vectors, mode onto the span of its grade- basis vectors, and mode onto the span of its grade- basis vectors, with those three spans themselves serving as the new mode spaces. If denotes the mode reindexing whose new mode order is , then define , where has new mode order . Now, for each real , (i) implies ; (ii) implies ; (iii) implies ; (iv) implies ; and (v) implies . Here literally means the conjunction of (so the conclusion repeats the nonnegativity already assumed in each implication) with the following condition: for every real , there are arbitrarily large natural numbers for which there exist a natural number and natural-number families indexed by such that the recursively formed modewise direct sum of the matrix-multiplication tensors is a restriction of the -fold modewise Kronecker power —that is, there are three -linear maps from the respective mode spaces of to those of that direct sum whose tensor-product map sends the tensor of exactly to the direct-sum tensor—and , with each natural product cast to a real number before taking the real power. “Arbitrarily large” is the literal meaning of the filter-frequently quantifier here: for every natural lower bound, at least one such at or above it exists; it does not say that every sufficiently large works. The definition allows , whose tensor power is the unit tensor object, allows , whose direct sum is the zero tensor object and whose numerical sum is empty, allows every dimension to be zero, and places no upper bound on . In particular, all five outer quantifiers include (each above is positive under the stated hypotheses), and for positive the case is permitted by the literal definition.
Confirmed by the mission captain (proposal self-audit).