AFTD Auto-Formalizing Theoretical Domains

linear_flattening_even_potency_induction

theoremverified

If the secant variety σ_6((ℂ⁴)⊗³) is testable by linear flattenings, and if for all even k ≥ 4 testability of σ_{2k-2}((ℂᵏ)⊗³) implies testability of σ_{2(k+2)-2}((ℂ^{k+2})⊗³), then σ_{2n-2}((ℂⁿ)⊗³) is testable for all even n ≥ 4.

Statement

theorem linear_flattening_even_potency_induction
    (h4 : linear_flattening_testable 4 6)
    (hstep : ∀ k, 4 ≤ k → Even k → linear_flattening_testable k (2 * k - 2) → linear_flattening_testable (k + 2) (2 * (k + 2) - 2)) :
    ∀ n, 4 ≤ n → Even n → linear_flattening_testable n (2 * n - 2)
Source
step towards op100_linear_flattening_potency_gt_even
Verified
20 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • 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 reparametrizes even integers n ≥ 4 as n = 4 + 2d for d ∈ ℕ. It first establishes by induction on d that linear flattening testability holds for all dimensions 4 + 2d and ranks 2(4 + 2d) - 2: the base case d = 0 is given by the hypothesis at n = 4, and the inductive step applies the step hypothesis at k = 4 + 2d. Finally, any even n ≥ 4 is written as n = 4 + 2(r - 2) where n = 2r, and the result follows by evaluating the inductive lemma at d = r - 2.

  1. The testability condition holds in the base case d = 0, corresponding to dimension 4 and secant order 6.

    We state an auxiliary lemma H asserting that linear flattening testability holds for all dimensions 4 + 2d and secant orders 2(4 + 2d) - 2, to be proved by induction on d ∈ ℕ. For the base case d = 0, the dimension simplifies to 4 + 2 · 0 = 4 and the secant order to 2(4) - 2 = 6, which is supplied directly by the base hypothesis h4.

    lines 6–10

      have H : ∀ d : ℕ, linear_flattening_testable (4 + 2 * d) (2 * (4 + 2 * d) - 2) := by
        intro d
        induction d with
        | zero =>
          exact h4
  2. For every d ∈ ℕ, if testability holds for 4 + 2d, then it holds for 4 + 2(d + 1).

    In the inductive step, assuming the induction hypothesis ih for d, we apply the step hypothesis hstep with k = 4 + 2d. The requirements that 4 ≤ k and that k is even (witnessed by 2 + d since 4 + 2d = (2 + d) + (2 + d)) are discharged by linear arithmetic (omega). Applying hstep to ih establishes testability for dimension k + 2 = 4 + 2(d + 1) and secant order 2(k + 2) - 2, completing the induction for H.

    lines 11–13

        | succ d ih =>
          have hstep_app := hstep (4 + 2 * d) (by omega) ⟨2 + d, by omega⟩ ih
          exact hstep_app
  3. Any even natural number n ≥ 4 can be expressed as 4 + 2(r - 2), where n = 2r.

    Given an even integer n ≥ 4, the definition of evenness yields a natural number r such that n = 2r. Linear arithmetic (omega) verifies that since n ≥ 4, the identity n = 4 + 2(r - 2) holds.

    lines 14–16

      intro n hn heven
      obtain ⟨r, hr⟩ := heven
      have : n = 4 + 2 * (r - 2) := by omega
  4. Substituting n = 4 + 2(r - 2) reduces the main goal to the auxiliary lemma evaluated at d = r - 2.

    Rewriting n with the identity n = 4 + 2(r - 2) transforms the goal into the statement of H at d = r - 2. Applying H(r - 2) closes the proof.

    lines 17–18

      rw [this]
      exact H (r - 2)

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

/-- Induction principle for even numbers n ≥ 4 tailored to linear flattening testability: testability at 4 6 and the step from k to k+2 imply testability for all even n ≥ 4. -/theorem linear_flattening_even_potency_induction    (h4 : linear_flattening_testable 4 6)    (hstep : ∀ k, 4 ≤ k → Even k → linear_flattening_testable k (2 * k - 2) → linear_flattening_testable (k + 2) (2 * (k + 2) - 2)) :    ∀ n, 4 ≤ n → Even n → linear_flattening_testable n (2 * n - 2) := by  have H : ∀ d : ℕ, linear_flattening_testable (4 + 2 * d) (2 * (4 + 2 * d) - 2) := by    intro d    induction d with    | zero =>      exact h4    | succ d ih =>      have hstep_app := hstep (4 + 2 * d) (by omega) ⟨2 + d, by omega⟩ ih      exact hstep_app  intro n hn heven  obtain ⟨r, hr⟩ := heven  have : n = 4 + 2 * (r - 2) := by omega  rw [this]  exact H (r - 2)
See it in the graphDiscuss this resultChallenge it