AFTD Auto-Formalizing Theoretical Domains

linear_flattening_testable_of_rank_le

theoremverified

If a linear flattening L on (ℂⁿ)⊗³ satisfies rank L(x ⊗ y ⊗ z) ≤ ρ for all x, y, z and rank L(T) > r * ρ for some tensor T, then the secant variety σ_r((ℂⁿ)⊗³) is testable by the linear flattening method.

Statement

theorem linear_flattening_testable_of_rank_le (n u v : ℕ)
    (L : (Fin n → Fin n → Fin n → ℂ) →ₗ[ℂ] Matrix (Fin u) (Fin v) ℂ) (r ρ : ℕ)
    (hρ : ∀ x y z : Fin n → ℂ, (L (tensor3_pure x y z)).rank ≤ ρ)
    (T : Fin n → Fin n → Fin n → ℂ)
    (hT : r * ρ < (L T).rank) :
    linear_flattening_testable n r
Source
step towards op100_linear_flattening_potency_gt_even
Verified
20 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 3
  • linear_flattening_testableThe secant variety σ_r((ℂⁿ)⊗³) is testable by the linear flattening method if there exists a linear flattening L : (ℂⁿ)⊗³ → Mat_{u×v}(ℂ)…
  • tensor3_pureThe pure tensor x ⊗ y ⊗ z in ℂⁿ ⊗ ℂⁿ ⊗ ℂⁿ, with entries x_i y_j z_k.
  • linear_flattening_potency_gtA linear flattening L : ℂⁿ ⊗ ℂⁿ ⊗ ℂⁿ → Mat_{u×v}(ℂ) has potency greater than r: some tensor T has rank L(T) > r · ρ(L), where ρ(L) =…

The proof, explained

To prove that the secant variety σ_r((ℂⁿ)⊗³) is testable by linear flattenings, we witness the existential claim directly using the given dimensions u and v, linear map L, and tensor T. For any pure tensor x ⊗ y ⊗ z, the hypothesis rank L(x ⊗ y ⊗ z) ≤ ρ is scaled by r to obtain r * rank L(x ⊗ y ⊗ z) ≤ r * ρ. Transitivity with the assumed strict inequality r * ρ < rank L(T) completes the proof.

  1. The secant variety σ_r((ℂⁿ)⊗³) is testable by linear flattenings (linear_flattening_testable n r).

    By definition, linear_flattening_testable requires finding matrix dimensions u and v, a linear map L to matrices, and a tensor T such that r * rank L(x ⊗ y ⊗ z) < rank L(T) for all vectors x, y, z. We supply the given u, v, L, and T. For arbitrary x, y, and z, scaling the rank upper bound (hρ x y z) by r using Nat.mul_le_mul_left gives r * rank L(x ⊗ y ⊗ z) ≤ r * ρ. Chaining this inequality with the strict bound r * ρ < rank L(T) (hypothesis hT) via lt_of_le_of_lt concludes the required strict inequality.

    line 7

    uses lt_of_le_of_lt, Nat.mul_le_mul_left

        linear_flattening_testable n r := ⟨u, v, L, T, fun x y z => lt_of_le_of_lt (Nat.mul_le_mul_left r (hρ x y z)) hT⟩
lt_of_le_of_lt
If a ≤ b and b < c in a preorder, then a < c.
Nat.mul_le_mul_left
Multiplying both sides of an inequality n ≤ m of natural numbers on the left by k preserves the inequality: k * n ≤ k * m.

Written by a model (gemini-3.8-flash) from the Lean source alone (no goal states were available). Lean verified the proof; this explanation is a reading aid and is not itself machine-checked.

Lean source view module on GitHub

/-- A sufficient condition for secant variety testability by linear flattenings: if rank L(x ⊗ y ⊗ z) ≤ ρ for all pure tensors and rank L(T) > r * ρ for some tensor T, then σ_r is testable. -/theorem linear_flattening_testable_of_rank_le (n u v : ℕ)    (L : (Fin n → Fin n → Fin n → ℂ) →ₗ[ℂ] Matrix (Fin u) (Fin v) ℂ) (r ρ : ℕ)    (hρ : ∀ x y z : Fin n → ℂ, (L (tensor3_pure x y z)).rank ≤ ρ)    (T : Fin n → Fin n → Fin n → ℂ)    (hT : r * ρ < (L T).rank) :    linear_flattening_testable n r := ⟨u, v, L, T, fun x y z => lt_of_le_of_lt (Nat.mul_le_mul_left r (hρ x y z)) hT⟩
See it in the graphDiscuss this resultChallenge it