AFTD Auto-Formalizing Theoretical Domains

qutrit_source_two_cubics_no_common_plane

theoremverified

Two explicit cubic maximal minors of the source vectors cannot both vanish on a complex two-dimensional plane.

Statement

theorem qutrit_source_two_cubics_no_common_plane :
  ∀ (a : ℂ) (u v : Fin 3 → ℂ), LinearIndependent ℂ ![u, v] →
    ∃ c d : ℂ,
      let x := c*u 0+d*v 0
      let y := c*u 1+d*v 1
      let z := c*u 2+d*v 2
      x*(x*x-3*y*y) ≠ 0 ∨
        x*x*y + a*x*x*z + y*y*y - a*y*y*z - y*z*z/18 ≠ 0
Source
Helper for OP-693, using the rank-four PPT source from https://arxiv.org/abs/1405.4502 and the normal-completion context https://arxiv.org/abs/0903.0090.
Verified
12 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
Used by 1

The proof, explained

The theorem states that two cubic forms cannot simultaneously vanish on any complex two-dimensional subspace. Assuming for contradiction that both forms vanish on the plane spanned by independent vectors u, v ∈ ℂ³, the first cubic x(x² - 3y²) = x(x - √3 y)(x + √3 y) yields a one-variable polynomial that vanishes identically, forcing the plane to satisfy x = k y for some scalar k with k = 0 or k² = 3. An auxiliary lemma shows that under this condition, the 2 × 2 minor determinant u₁ v₂ - u₂ v₁ cannot vanish, which allows choosing coefficients on the plane to set y = 1 and z = 0, so x = k. Evaluating the second cubic form at this point simplifies to k² + 1 = 0, contradicting both k = 0 (yielding 1 = 0) and k² = 3 (yielding 4 = 0).

  1. Under the assumption that u₁ v₂ - u₂ v₁ = 0, the first components of both vectors vanish: u₁ = 0 and v₁ = 0.

    Suppose for contradiction that u₁ v₂ - u₂ v₁ = 0. By linear independence of u and v, any linear combination s • u + t • v = 0 forces s = 0 and t = 0. We evaluate the combination v₁ • u - u₁ • v coordinatewise: for coordinate 0, v₁ u₀ - u₁ v₀ = v₁ (k u₁) - u₁ (k v₁) = 0; for coordinate 1, v₁ u₁ - u₁ v₁ = 0; for coordinate 2, v₁ u₂ - u₁ v₂ = -(u₁ v₂ - u₂ v₁) = 0. Thus v₁ • u - u₁ • v = 0, which by linear independence forces v₁ = 0 and -u₁ = 0, so u₁ = 0.

    lines 9–22

    uses LinearIndependent.pair_iff.mp, Pi.add_apply, Pi.smul_apply, smul_eq_mul, Pi.zero_apply

      intro hd
      have hpair := LinearIndependent.pair_iff.mp hli
      have hz1 : (v 1) • u + (-u 1) • v = 0 := by
        ext i
        fin_cases i <;> simp only [Pi.add_apply, Pi.smul_apply, smul_eq_mul, Pi.zero_apply]
        · change v 1 * u 0 + (-u 1) * v 0 = 0
          rw [hu, hv]; ring
        · change v 1 * u 1 + (-u 1) * v 1 = 0
          ring
        · change v 1 * u 2 + (-u 1) * v 2 = 0
          linear_combination -hd
      have hfirst := hpair (v 1) (-u 1) hz1
      have hv1 : v 1=0 := hfirst.1
      have hu1 : u 1=0 := by simpa using hfirst.2
  2. The second components of both vectors also vanish: u₂ = 0 and v₂ = 0.

    Since u₁ = 0 and v₁ = 0, the relations u₀ = k u₁ and v₀ = k v₁ imply that u₀ = 0 and v₀ = 0 as well. We now form the linear combination v₂ • u - u₂ • v. At coordinate 0, v₂ u₀ - u₂ v₀ = 0; at coordinate 1, v₂ u₁ - u₂ v₁ = 0; at coordinate 2, v₂ u₂ - u₂ v₂ = 0. Hence v₂ • u - u₂ • v = 0, and linear independence implies v₂ = 0 and u₂ = 0.

    lines 23–34

    uses Pi.add_apply, Pi.smul_apply, smul_eq_mul, Pi.zero_apply

      have hz2 : (v 2) • u + (-u 2) • v = 0 := by
        ext i
        fin_cases i <;> simp only [Pi.add_apply, Pi.smul_apply, smul_eq_mul, Pi.zero_apply]
        · change v 2 * u 0 + (-u 2) * v 0 = 0
          rw [hu, hv, hu1, hv1]; ring
        · change v 2 * u 1 + (-u 2) * v 1 = 0
          rw [hu1, hv1]; ring
        · change v 2 * u 2 + (-u 2) * v 2 = 0
          ring
      have hsecond := hpair (v 2) (-u 2) hz2
      have hv2 : v 2=0 := hsecond.1
      have hu2 : u 2=0 := by simpa using hsecond.2
  3. All components of u vanish, which contradicts linear independence and establishes u₁ v₂ - u₂ v₁ ≠ 0. automation

    Since u₀ = 0, u₁ = 0, and u₂ = 0, the vector u is identically zero. Thus 1 • u + 0 • v = 0, which by linear independence forces 1 = 0. This arithmetic contradiction refutes the hypothesis that the determinant vanished.

    lines 35–39

      have hz3 : (1 : ℂ) • u + (0 : ℂ) • v = 0 := by
        ext i
        fin_cases i <;> simp [hu, hu1, hu2]
      have := hpair 1 0 hz3
      norm_num at this
  4. Assuming both cubics vanish on the plane, the first cubic factors over ℂ as x(x - s y)(x + s y) with s = √3.

    We assume for contradiction that both cubic polynomials vanish identically on the plane spanned by u and v, so that both cubics evaluate to zero at (x, y, z) = c u + d v for all c, d ∈ ℂ. Defining s = √3 ∈ ℂ, we have s² = 3 since (√3)² = 3 in ℝ. The first cubic then factors algebraically as x(x² - 3y²) = x(x - s y)(x + s y).

    lines 49–59

    uses Real.sq_sqrt, pow_two

      by_contra hcontra
      dsimp only at hcontra
      push_neg at hcontra
      let s : ℂ := Real.sqrt 3
      have hs : s*s=3 := by
        dsimp [s]
        have hh : (Real.sqrt 3)^2 = 3 := Real.sq_sqrt (by norm_num)
        have hh' : (Real.sqrt 3 : ℂ)^2 = (3 : ℂ) := by exact_mod_cast hh
        simpa [pow_two] using hh'
      have hfact (x y : ℂ) : x*(x-s*y)*(x+s*y)=x*(x*x-3*y*y) := by
        linear_combination (-x*y*y) * hs
  5. The product polynomial Xₚ(Xₚ - s Yₚ)(Xₚ + s Yₚ) is the zero polynomial in ℂ[T], where Xₚ(T) = u₀ + T v₀ and Yₚ(T) = u₁ + T v₁.

    Setting c = 1 and d = t parameterizes a line on the plane with coordinates x = Xₚ(t) = u₀ + t v₀ and y = Yₚ(t) = u₁ + t v₁. By hypothesis, the factored cubic vanishes for every t ∈ ℂ. Because a polynomial over an infinite field that vanishes everywhere must be identically zero (Polynomial.funext), the polynomial identity Xₚ(Xₚ - s Yₚ)(Xₚ + s Yₚ) = 0 holds in ℂ[T].

    lines 60–70

    uses Polynomial.funext, one_mul, Polynomial.eval_mul, Polynomial.eval_sub, Polynomial.eval_add, Polynomial.eval_C, Polynomial.eval_X, Polynomial.eval_zero

      let Xp : Polynomial ℂ := C (u 0) + X * C (v 0)
      let Yp : Polynomial ℂ := C (u 1) + X * C (v 1)
      have hpoly : Xp * (Xp - C s * Yp) * (Xp + C s * Yp) = 0 := by
        apply Polynomial.funext
        intro t
        have hq := (hcontra 1 t).1
        simp only [one_mul] at hq
        simp only [Polynomial.eval_mul, Polynomial.eval_sub, Polynomial.eval_add,
          Polynomial.eval_C, Polynomial.eval_X, Polynomial.eval_zero, Xp, Yp]
        rw [hfact]
        exact hq
  6. At least one of the three linear factors Xₚ, Xₚ - s Yₚ, or Xₚ + s Yₚ is zero.

    Because the polynomial ring ℂ[T] is an integral domain, a product of polynomials is zero only if at least one factor is zero (mul_eq_zero.mp).

    lines 71–74

    uses mul_eq_zero.mp, Or.imp_right, Or.inl, Or.inr

      have hlin : Xp = 0 ∨ Xp - C s * Yp = 0 ∨ Xp + C s * Yp = 0 := by
        rcases mul_eq_zero.mp hpoly with h | h
        · exact mul_eq_zero.mp h |>.imp_right Or.inl
        · exact Or.inr (Or.inr h)
  7. There exists a scalar k ∈ ℂ with k = 0 or k² = 3 such that u₀ = k u₁ and v₀ = k v₁.

    We evaluate the vanishing polynomial factor at T = 0 and T = 1 using congrArg: if Xₚ = 0, then u₀ = 0 and v₀ = 0, giving k = 0 with u₀ = 0 • u₁ and v₀ = 0 • v₁; if Xₚ - s Yₚ = 0, evaluating at 0 and 1 gives u₀ = s u₁ and v₀ = s v₁, so k = s with k² = s² = 3; if Xₚ + s Yₚ = 0, evaluating gives u₀ = -s u₁ and v₀ = -s v₁, so k = -s with k² = (-s)² = 3. In all cases, u₀ = k u₁ and v₀ = k v₁ with k = 0 ∨ k² = 3.

    lines 75–93

    uses congrArg, Or.inl, Or.inr

      have hplane : ∃ k : ℂ, u 0 = k*u 1 ∧ v 0 = k*v 1 ∧ (k=0 ∨ k*k=3) := by
        rcases hlin with h | h | h
        · have h0 := congrArg (fun P : Polynomial ℂ => P.eval 0) h
          have h1 := congrArg (fun P : Polynomial ℂ => P.eval 1) h
          simp [Xp] at h0 h1
          refine ⟨0, by simpa using h0, ?_, Or.inl rfl⟩
          simpa [h0] using h1
        · have h0 := congrArg (fun P : Polynomial ℂ => P.eval 0) h
          have h1 := congrArg (fun P : Polynomial ℂ => P.eval 1) h
          simp [Xp, Yp] at h0 h1
          refine ⟨s, by linear_combination h0, ?_, Or.inr hs⟩
          linear_combination h1 - h0
        · have h0 := congrArg (fun P : Polynomial ℂ => P.eval 0) h
          have h1 := congrArg (fun P : Polynomial ℂ => P.eval 1) h
          simp [Xp, Yp] at h0 h1
          refine ⟨-s, by linear_combination h0, ?_, Or.inr ?_⟩
          · linear_combination h1 - h0
          · linear_combination hs
      obtain ⟨k, hu, hv, hk⟩ := hplane
  8. There exist coefficients c, d ∈ ℂ producing the point (x, y, z) = (k, 1, 0) on the plane.

    Because u₀ = k u₁ and v₀ = k v₁ with u, v linearly independent, the helper lemma in767_cubicproof_plane_yz_det_ne_zero guarantees that the determinant D = u₁ v₂ - u₂ v₁ is non-zero. By Cramer's rule, setting c = v₂ / D and d = -u₂ / D solves c u₁ + d v₁ = 1 and c u₂ + d v₂ = 0, so y = 1 and z = 0. The first coordinate is then x = c u₀ + d v₀ = k(c u₁ + d v₁) = k.

    lines 94–110

    uses in767_cubicproof_plane_yz_det_ne_zero

      let D : ℂ := u 1*v 2-u 2*v 1
      have hD : D ≠ 0 := in767_cubicproof_plane_yz_det_ne_zero u v k hu hv hli
      let c : ℂ := v 2 / D
      let d : ℂ := -u 2 / D
      have hy : c*u 1 + d*v 1 = 1 := by
        dsimp [c,d]
        field_simp [hD]
        dsimp [D]
        ring
      have hz : c*u 2 + d*v 2 = 0 := by
        dsimp [c,d]
        field_simp [hD]
        dsimp [D]
        ring
      have hx : c*u 0 + d*v 0 = k := by
        rw [hu,hv]
        linear_combination k*hy
  9. Evaluating the second cubic at (k, 1, 0) yields an arithmetic contradiction, refuting the assumption. automation

    By the contradiction hypothesis, the second cubic must vanish at (k, 1, 0). Substituting x = k, y = 1, z = 0 simplifies the cubic to k² + 1 = 0. If k = 0, this gives 1 = 0. If k² = 3, subtracting k² = 3 gives 4 = 0. In both cases, norm_num derives False.

    lines 111–116

      have hp := (hcontra c d).2
      rw [hx,hy,hz] at hp
      rcases hk with rfl | hk
      · norm_num at hp
      · have hh : (4 : ℂ) = 0 := by linear_combination hp - hk
        norm_num at hh
  10. The theorem follows directly from the helper lemma.

    Given a parameter a and linearly independent vectors u, v spanning a plane, invoking in767_cubicproof_cubic_pair_no_common_plane directly proves that the two cubics cannot both vanish on the plane.

    lines 126–127

    uses in767_cubicproof_cubic_pair_no_common_plane

      intro a u v hli
      exact in767_cubicproof_cubic_pair_no_common_plane a u v hli
LinearIndependent.pair_iff.mp
For a pair of vectors ![u, v], linear independence implies that any linear relation s • u + t • v = 0 requires s = 0 and t = 0.
Pi.add_apply
Function addition is defined pointwise: (f + g)(i) = f(i) + g(i).
Pi.smul_apply
Scalar multiplication of a function is defined pointwise: (a • f)(i) = a • f(i).
smul_eq_mul
In a ring, scalar multiplication by an element of the ring coincides with ring multiplication: a • b = a * b.
Pi.zero_apply
The zero function evaluates to zero at every index: 0(i) = 0.
Real.sq_sqrt
The square of the square root of a non-negative real number x equals x: (√x)² = x for x ≥ 0.
pow_two
Squaring an element is equivalent to multiplying it by itself: a² = a * a.
Polynomial.funext
Over an infinite integral domain, two polynomials that evaluate to the same value at every element of the domain are equal.
one_mul
Multiplying any element by 1 on the left leaves it unchanged: 1 * a = a.
Polynomial.eval_mul
Polynomial evaluation preserves multiplication: eval x (p * q) = (eval x p) * (eval x q).
Polynomial.eval_sub
Polynomial evaluation preserves subtraction: eval x (p - q) = eval x p - eval x q.
Polynomial.eval_add
Polynomial evaluation preserves addition: eval x (p + q) = eval x p + eval x q.
Polynomial.eval_C
Evaluating a constant polynomial C(a) at any point yields the constant a.
Polynomial.eval_X
Evaluating the variable polynomial X at a point x yields x.
Polynomial.eval_zero
Evaluating the zero polynomial at any point yields zero.
mul_eq_zero.mp
In an integral domain, a product of two elements is zero only if at least one factor is zero.
Or.imp_right
If a proposition b implies c, then the disjunction a ∨ b implies a ∨ c.
Or.inl
Given a proof of a, concludes the disjunction a ∨ b.
Or.inr
Given a proof of b, concludes the disjunction a ∨ b.
congrArg
A function applied to equal inputs yields equal outputs: if a₁ = a₂, then f(a₁) = f(a₂).
in767_cubicproof_plane_yz_det_ne_zero
For linearly independent vectors u, v ∈ ℂ³ satisfying u₀ = k u₁ and v₀ = k v₁, the determinant u₁ v₂ - u₂ v₁ is non-zero.
in767_cubicproof_cubic_pair_no_common_plane
For any complex parameter a and linearly independent vectors u, v ∈ ℂ³, there exists a linear combination where at least one of the two cubic forms does not vanish.

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

open Matrix Polynomialopen scoped BigOperators Matrix ComplexOrderset_option backward.isDefEq.respectTransparency falseset_option linter.unusedSimpArgs falseprivate lemma in767_cubicproof_plane_yz_det_ne_zero    (u v : Fin 3 → ℂ) (k : ℂ)    (hu : u 0 = k*u 1) (hv : v 0 = k*v 1)    (hli : LinearIndependent ℂ ![u,v]) : u 1 * v 2 - u 2 * v 1 ≠ 0 := by  intro hd  have hpair := LinearIndependent.pair_iff.mp hli  have hz1 : (v 1) • u + (-u 1) • v = 0 := by    ext i    fin_cases i <;> simp only [Pi.add_apply, Pi.smul_apply, smul_eq_mul, Pi.zero_apply]    · change v 1 * u 0 + (-u 1) * v 0 = 0      rw [hu, hv]; ring    · change v 1 * u 1 + (-u 1) * v 1 = 0      ring    · change v 1 * u 2 + (-u 1) * v 2 = 0      linear_combination -hd  have hfirst := hpair (v 1) (-u 1) hz1  have hv1 : v 1=0 := hfirst.1  have hu1 : u 1=0 := by simpa using hfirst.2  have hz2 : (v 2) • u + (-u 2) • v = 0 := by    ext i    fin_cases i <;> simp only [Pi.add_apply, Pi.smul_apply, smul_eq_mul, Pi.zero_apply]    · change v 2 * u 0 + (-u 2) * v 0 = 0      rw [hu, hv, hu1, hv1]; ring    · change v 2 * u 1 + (-u 2) * v 1 = 0      rw [hu1, hv1]; ring    · change v 2 * u 2 + (-u 2) * v 2 = 0      ring  have hsecond := hpair (v 2) (-u 2) hz2  have hv2 : v 2=0 := hsecond.1  have hu2 : u 2=0 := by simpa using hsecond.2  have hz3 : (1 : ℂ) • u + (0 : ℂ) • v = 0 := by    ext i    fin_cases i <;> simp [hu, hu1, hu2]  have := hpair 1 0 hz3  norm_num at thisprivate lemma in767_cubicproof_cubic_pair_no_common_plane    (a : ℂ) (u v : Fin 3 → ℂ) (hli : LinearIndependent ℂ ![u, v]) :    ∃ c d : ℂ,      let x := c*u 0+d*v 0      let y := c*u 1+d*v 1      let z := c*u 2+d*v 2      x*(x*x-3*y*y) ≠ 0 ∨        x*x*y + a*x*x*z + y*y*y - a*y*y*z - y*z*z/18 ≠ 0 := by  by_contra hcontra  dsimp only at hcontra  push_neg at hcontra  let s : ℂ := Real.sqrt 3  have hs : s*s=3 := by    dsimp [s]    have hh : (Real.sqrt 3)^2 = 3 := Real.sq_sqrt (by norm_num)    have hh' : (Real.sqrt 3 : ℂ)^2 = (3 : ℂ) := by exact_mod_cast hh    simpa [pow_two] using hh'  have hfact (x y : ℂ) : x*(x-s*y)*(x+s*y)=x*(x*x-3*y*y) := by    linear_combination (-x*y*y) * hs  let Xp : Polynomial ℂ := C (u 0) + X * C (v 0)  let Yp : Polynomial ℂ := C (u 1) + X * C (v 1)  have hpoly : Xp * (Xp - C s * Yp) * (Xp + C s * Yp) = 0 := by    apply Polynomial.funext    intro t    have hq := (hcontra 1 t).1    simp only [one_mul] at hq    simp only [Polynomial.eval_mul, Polynomial.eval_sub, Polynomial.eval_add,      Polynomial.eval_C, Polynomial.eval_X, Polynomial.eval_zero, Xp, Yp]    rw [hfact]    exact hq  have hlin : Xp = 0 ∨ Xp - C s * Yp = 0 ∨ Xp + C s * Yp = 0 := by    rcases mul_eq_zero.mp hpoly with h | h    · exact mul_eq_zero.mp h |>.imp_right Or.inl    · exact Or.inr (Or.inr h)  have hplane : ∃ k : ℂ, u 0 = k*u 1 ∧ v 0 = k*v 1 ∧ (k=0 ∨ k*k=3) := by    rcases hlin with h | h | h    · have h0 := congrArg (fun P : Polynomial ℂ => P.eval 0) h      have h1 := congrArg (fun P : Polynomial ℂ => P.eval 1) h      simp [Xp] at h0 h1      refine ⟨0, by simpa using h0, ?_, Or.inl rfl⟩      simpa [h0] using h1    · have h0 := congrArg (fun P : Polynomial ℂ => P.eval 0) h      have h1 := congrArg (fun P : Polynomial ℂ => P.eval 1) h      simp [Xp, Yp] at h0 h1      refine ⟨s, by linear_combination h0, ?_, Or.inr hs⟩      linear_combination h1 - h0    · have h0 := congrArg (fun P : Polynomial ℂ => P.eval 0) h      have h1 := congrArg (fun P : Polynomial ℂ => P.eval 1) h      simp [Xp, Yp] at h0 h1      refine ⟨-s, by linear_combination h0, ?_, Or.inr ?_⟩      · linear_combination h1 - h0      · linear_combination hs  obtain ⟨k, hu, hv, hk⟩ := hplane  let D : ℂ := u 1*v 2-u 2*v 1  have hD : D ≠ 0 := in767_cubicproof_plane_yz_det_ne_zero u v k hu hv hli  let c : ℂ := v 2 / D  let d : ℂ := -u 2 / D  have hy : c*u 1 + d*v 1 = 1 := by    dsimp [c,d]    field_simp [hD]    dsimp [D]    ring  have hz : c*u 2 + d*v 2 = 0 := by    dsimp [c,d]    field_simp [hD]    dsimp [D]    ring  have hx : c*u 0 + d*v 0 = k := by    rw [hu,hv]    linear_combination k*hy  have hp := (hcontra c d).2  rw [hx,hy,hz] at hp  rcases hk with rfl | hk  · norm_num at hp  · have hh : (4 : ℂ) = 0 := by linear_combination hp - hk    norm_num at hhtheorem qutrit_source_two_cubics_no_common_plane :  ∀ (a : ℂ) (u v : Fin 3 → ℂ), LinearIndependent ℂ ![u, v] →    ∃ c d : ℂ,      let x := c*u 0+d*v 0      let y := c*u 1+d*v 1      let z := c*u 2+d*v 2      x*(x*x-3*y*y) ≠ 0 ∨        x*x*y + a*x*x*z + y*y*y - a*y*y*z - y*z*z/18 ≠ 0 := by  intro a u v hli  exact in767_cubicproof_cubic_pair_no_common_plane a u v hli
See it in the graphDiscuss this resultChallenge it