AFTD Auto-Formalizing Theoretical Domains

linear_flattening_testable_of_potency_gt

theoremverified

If a linear flattening L : (ℂⁿ)⊗³ → Mat_{u×v}(ℂ) has potency strictly greater than r, then (ℂⁿ)⊗³ is testable at order r by the linear flattening method.

Statement

theorem linear_flattening_testable_of_potency_gt {n u v : ℕ}
    (L : (Fin n → Fin n → Fin n → ℂ) →ₗ[ℂ] Matrix (Fin u) (Fin v) ℂ) (r : ℕ)
    (h : linear_flattening_potency_gt L r) :
    linear_flattening_testable n r
Source
step towards linear_flattening_testable_order_gap_four
Verified
23 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • linear_flattening_testableThe secant variety σ_r((ℂⁿ)⊗³) is testable by the linear flattening method if there exists a linear flattening L : (ℂⁿ)⊗³ → Mat_{u×v}(ℂ)…
  • 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

By definition, a tensor space (ℂⁿ)⊗³ is testable at order r if there exist matrix dimensions u, v and a linear flattening L of potency strictly greater than r. The theorem follows immediately by using the given dimensions, linear map L, and hypothesis h as witnesses for the existential definition.

  1. The tensor space (ℂⁿ)⊗³ is testable at order r by the linear flattening method.

    By definition, `linear_flattening_testable n r` is an existential quantifier asserting the existence of matrix dimensions u, v and a linear flattening L whose potency exceeds r. Providing the given dimensions u and v, the map L, and the hypothesis h directly witnesses this existential statement.

    line 5

        linear_flattening_testable n r := ⟨u, v, L, h⟩

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 tensor space (ℂⁿ)⊗³ is testable at order r if there exists an explicit linear flattening L achieving potency strictly greater than r. -/theorem linear_flattening_testable_of_potency_gt {n u v : ℕ}    (L : (Fin n → Fin n → Fin n → ℂ) →ₗ[ℂ] Matrix (Fin u) (Fin v) ℂ) (r : ℕ)    (h : linear_flattening_potency_gt L r) :    linear_flattening_testable n r := ⟨u, v, L, h⟩
See it in the graphDiscuss this resultChallenge it