AFTD Auto-Formalizing Theoretical Domains

linear_flattening_testable

def

The secant variety σ_r((ℂⁿ)⊗³) is testable by the linear flattening method if there exists a linear flattening L : (ℂⁿ)⊗³ → Mat_{u×v}(ℂ) with potency strictly greater than r.

Statement

def linear_flattening_testable (n : ℕ) (r : ℕ) : Prop
Defined in
arXiv:2610.08504 Sec. 1
Verified
19 Oct 2026
Axioms
none listed
Built on 1
  • 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) =…
Used by 10

Read back from the Lean

The definition linear_flattening_testable n r asserts that there exist natural numbers u and v, and a $\mathbb{C}$-linear map L from the space of 3-tensors Fin n → Fin n → Fin n → ℂ to u × v complex matrices (Matrix (Fin u) (Fin v) ℂ), such that there exists a 3-tensor T : Fin n → Fin n → Fin n → ℂ satisfying: for all vectors x, y, z : Fin n → ℂ, r times the rank of L (tensor3_pure x y z) is strictly less than the rank of L T.

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- A secant variety order r is testable by the linear flattening method on (ℂⁿ)⊗³: some linear flattening achieves potency strictly greater than r. -/
def linear_flattening_testable (n : ℕ) (r : ℕ) : Prop := ∃ (u v : ℕ) (L : (Fin n → Fin n → Fin n → ℂ) →ₗ[ℂ] Matrix (Fin u) (Fin v) ℂ),
    linear_flattening_potency_gt L r
See it in the graphDiscuss this resultChallenge it