linear_flattening_testable_mono_dim
Testability is monotone in the tensor dimension: if σ_r((ℂⁿ)⊗³) is testable by linear flattenings and n ≤ m, then so is σ_r((ℂᵐ)⊗³).
Statement
theorem linear_flattening_testable_mono_dim {n m r : ℕ} (hnm : n ≤ m)
(h : linear_flattening_testable n r) : linear_flattening_testable m r- Source
- step towards linear_flattening_testable_even_step
- Verified
- 23 Oct 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- linear_flattening_testable_succ_dimTestability is monotone in the tensor dimension at fixed order: if a linear flattening on (ℂⁿ)⊗³ has potency greater than r, then so does…
- linear_flattening_testableThe secant variety σ_r((ℂⁿ)⊗³) is testable by the linear flattening method if there exists a linear flattening L : (ℂⁿ)⊗³ → Mat_{u×v}(ℂ)…
The proof, explained
The proof proceeds by induction on m ≥ n, starting at m = n. The base case m = n is immediate from the hypothesis. The inductive step from k to k + 1 is established by applying the one-step dimension enlargement theorem (`linear_flattening_testable_succ_dim`).
The claim holds in the base case m = n.
We induct on m ≥ n using `Nat.le_induction`. In the base case m = n, the goal is to show that linear-flattening testability holds in dimension n, which is precisely the hypothesis h.
uses
Nat.le_inductioninduction m, hnm using Nat.le_induction with | base => exact h
If testability holds in dimension k (with k ≥ n), then it holds in dimension k + 1.
Applying the one-step dimension increment lemma `linear_flattening_testable_succ_dim` to the induction hypothesis ih establishes testability in dimension k + 1, completing the induction.
uses
linear_flattening_testable_succ_dim| succ k hk ih => exact linear_flattening_testable_succ_dim ih
Nat.le_induction- Induction principle for natural numbers: to prove a property for all n ≥ m, it suffices to prove it for m and prove that it carries from k to k + 1 for all k ≥ m.
linear_flattening_testable_succ_dim- If the variety σ_r((ℂⁿ)⊗³) is testable by linear flattenings, then so is σ_r((ℂⁿ⁺¹)⊗³).
Written by a model (gemini-3.8-flash) from the Lean proof and the goal states Lean reported at each step. Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.
Lean source view module on GitHub
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- General dimension monotonicity for linear-flattening testability at a fixed order, obtained by iterating the one-step padding lemma. -/theorem linear_flattening_testable_mono_dim {n m r : ℕ} (hnm : n ≤ m) (h : linear_flattening_testable n r) : linear_flattening_testable m r := by induction m, hnm using Nat.le_induction with | base => exact h | succ k hk ih => exact linear_flattening_testable_succ_dim ih