AFTD Auto-Formalizing Theoretical Domains

standardized_laplacian_polygon_four_mem_of_ineqs

theoremverified

Any complex number z satisfying |Im(z)| ≤ 1/4, |Im(z)| ≤ Re(z), and Re(z) + |Im(z)| ≤ 1 belongs to the standardized Laplacian polygon S_4.

Statement

theorem standardized_laplacian_polygon_four_mem_of_ineqs (z : ℂ)
    (h_im_le : |z.im| ≤ (1 : ℝ) / 4)
    (h_left : |z.im| ≤ z.re)
    (h_right : z.re + |z.im| ≤ 1) :
    z ∈ standardized_laplacian_polygon_four
Source
step towards standardized_laplacian_order_four_polygon_conjecture
Verified
24 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
  • standardized_laplacian_polygon_fourThe polygon S_4 is the convex hull in the complex plane ℂ of the vertices λ_k and their complex conjugates for k ∈ Fin 4, where λ_k =…
Used by 3

The proof, explained

The standardized Laplacian polygon S_4 is defined as the convex hull of a generator set of complex points. The region defined by |Im(z)| ≤ 1/4, |Im(z)| ≤ Re(z), and Re(z) + |Im(z)| ≤ 1 is a symmetric hexagon with vertices 0, 1/4 ± I/4, 3/4 ± I/4, and 1, all of which are shown to belong to the generator set. By splitting on the sign of Im(z) and further partitioning each half along Re(z) ± 3*Im(z) = 1, any point in the region is expressed as an explicit convex combination of three generator vertices, proving it lies in S_4.

  1. Any convex combination of three points from the generator set belongs to the standardized Laplacian polygon S_4.

    Unfolding the definition of standardized_laplacian_polygon_four as the real convex hull of the generator set, we apply mem_convexHull_of_exists_fintype with weights w0, w1, w2 and points p0, p1, p2 indexed by Fin 3. The requirements that the weights are non-negative, sum to 1, and the points belong to the generator set are checked by case analysis on Fin 3 and summing via Fin.sum_univ_three.

    lines 17–25

    uses mem_convexHull_of_exists_fintype, Fin.sum_univ_three

      change z ∈ convexHull ℝ standardized_laplacian_polygon_four_mem_of_ineqs_gen
      rw [hz]
      refine mem_convexHull_of_exists_fintype (s := standardized_laplacian_polygon_four_mem_of_ineqs_gen)
        (x := w0 • p0 + w1 • p1 + w2 • p2)
        ![w0, w1, w2] ![p0, p1, p2] ?_ ?_ ?_ ?_
      · intro i; fin_cases i <;> simp [hw0, hw1, hw2]
      · simp [Fin.sum_univ_three, hsum]
      · intro i; fin_cases i <;> simp [hp0, hp1, hp2]
      · simp [Fin.sum_univ_three]
  2. The points 0, 1/4 + I/4, and 3/4 + I/4 belong to the generator set.

    Each point is shown to belong to the first component of the generator set by choosing k = 0, k = 1, and k = 2 in Fin 4, respectively. Expanding the partial sums using Finset.sum_range_succ and simplifying algebraically yields the respective coordinates.

    lines 27–38

    uses Finset.sum_range_succ

    lemma standardized_laplacian_polygon_four_mem_of_ineqs_p0 :
        (0 : ℂ) ∈ standardized_laplacian_polygon_four_mem_of_ineqs_gen := by
      left; use ⟨0, by decide⟩; simp
    
    lemma standardized_laplacian_polygon_four_mem_of_ineqs_p1 :
        (1/4 : ℂ) + Complex.I / 4 ∈ standardized_laplacian_polygon_four_mem_of_ineqs_gen := by
      left; use ⟨1, by decide⟩; simp [Finset.sum_range_succ]; ring
    
    lemma standardized_laplacian_polygon_four_mem_of_ineqs_p2 :
        (3/4 : ℂ) + Complex.I / 4 ∈ standardized_laplacian_polygon_four_mem_of_ineqs_gen := by
      left; use ⟨2, by decide⟩; simp [Finset.sum_range_succ]; ring
    
  3. The point 1 belongs to the generator set.

    Choosing k = 3 in Fin 4, the partial sum of 1 - (-Complex.I)^m for m from 0 to 3 is expanded with Finset.sum_range_succ. Rewriting (-Complex.I)^3 as -(-Complex.I) via Complex.I_sq causes the imaginary terms to cancel, simplifying the sum to 1.

    lines 39–49

    uses Finset.sum_range_succ, Complex.I_sq

    lemma standardized_laplacian_polygon_four_mem_of_ineqs_p3 :
        (1 : ℂ) ∈ standardized_laplacian_polygon_four_mem_of_ineqs_gen := by
      left; use ⟨3, by decide⟩
      simp [Finset.sum_range_succ]
      have : (-Complex.I) ^ 3 = -(-Complex.I) := by
        calc (-Complex.I) ^ 3 = (-Complex.I) ^ 2 * (-Complex.I) := by ring
        _ = (Complex.I ^ 2) * (-Complex.I) := by ring
        _ = -1 * (-Complex.I) := by rw [Complex.I_sq]
        _ = -(-Complex.I) := by ring
      rw [this]; ring
    
  4. The points 3/4 - I/4 and 1/4 - I/4 belong to the generator set.

    These points lie in the second component of the generator set, formed by complex conjugates (star) of the partial sums. Evaluating the partial sums at k = 2 and k = 1 produces 3/4 + I/4 and 1/4 + I/4, whose complex conjugates are 3/4 - I/4 and 1/4 - I/4.

    lines 50–63

    uses Finset.sum_range_succ

    lemma standardized_laplacian_polygon_four_mem_of_ineqs_p4 :
        (3/4 : ℂ) - Complex.I / 4 ∈ standardized_laplacian_polygon_four_mem_of_ineqs_gen := by
      right; use ⟨2, by decide⟩
      have h : (1 / (4 : ℂ)) * ∑ m ∈ Finset.range (2 + 1), (1 - (-Complex.I) ^ m) = 3/4 + Complex.I/4 := by
        simp [Finset.sum_range_succ]; ring
      rw [h]; simp; ring
    
    lemma standardized_laplacian_polygon_four_mem_of_ineqs_p5 :
        (1/4 : ℂ) - Complex.I / 4 ∈ standardized_laplacian_polygon_four_mem_of_ineqs_gen := by
      right; use ⟨1, by decide⟩
      have h : (1 / (4 : ℂ)) * ∑ m ∈ Finset.range (1 + 1), (1 - (-Complex.I) ^ m) = 1/4 + Complex.I/4 := by
        simp [Finset.sum_range_succ]; ring
      rw [h]; simp; ring
    
  5. When Im(z) ≥ 0, the hypotheses simplify to Im(z) ≤ 1/4, Im(z) ≤ Re(z), and Re(z) + Im(z) ≤ 1.

    Assuming Im(z) ≥ 0, abs_of_nonneg simplifies |Im(z)| to Im(z) across all three given inequalities.

    lines 70–72

    uses abs_of_nonneg

      by_cases h_im : 0 ≤ z.im
      · have h_abs : |z.im| = z.im := abs_of_nonneg h_im
        rw [h_abs] at h_im_le h_left h_right
  6. If Im(z) ≥ 0 and Re(z) + 3 * Im(z) ≤ 1, then z belongs to S_4 as a convex combination of 0, 1/4 + I/4, and 1.

    We express z as a convex combination of p0 = 0, p1 = 1/4 + Complex.I/4, and p3 = 1 with weights 1 - Re(z) - 3 * Im(z), 4 * Im(z), and Re(z) - Im(z). Linear arithmetic shows each weight is non-negative and ring arithmetic verifies they sum to 1. Applying standardized_laplacian_polygon_four_mem_of_ineqs_combo_three and checking that real and imaginary parts match via Complex.ext places z in S_4.

    lines 73–81

    uses standardized_laplacian_polygon_four_mem_of_ineqs_combo_three, standardized_laplacian_polygon_four_mem_of_ineqs_p0, standardized_laplacian_polygon_four_mem_of_ineqs_p1, standardized_laplacian_polygon_four_mem_of_ineqs_p3, Complex.ext

        by_cases h_split : z.re + 3 * z.im ≤ 1
        · refine standardized_laplacian_polygon_four_mem_of_ineqs_combo_three
            0 ((1/4 : ℂ) + Complex.I / 4) 1
            standardized_laplacian_polygon_four_mem_of_ineqs_p0
            standardized_laplacian_polygon_four_mem_of_ineqs_p1
            standardized_laplacian_polygon_four_mem_of_ineqs_p3
            (1 - z.re - 3 * z.im) (4 * z.im) (z.re - z.im)
            (by linarith) (by linarith) (by linarith) (by ring) ?_
          apply Complex.ext <;> (simp; ring)
  7. If Im(z) ≥ 0 and Re(z) + 3 * Im(z) > 1, then z belongs to S_4 as a convex combination of 1/4 + I/4, 3/4 + I/4, and 1.

    We express z as a convex combination of p1 = 1/4 + Complex.I/4, p2 = 3/4 + Complex.I/4, and p3 = 1 with weights 2 * (1 - Re(z) - Im(z)), 2 * (Re(z) + 3 * Im(z) - 1), and 1 - 4 * Im(z). Linear and ring arithmetic establish that the weights are non-negative and sum to 1. Applying standardized_laplacian_polygon_four_mem_of_ineqs_combo_three and matching components via Complex.ext proves z ∈ S_4.

    lines 82–89

    uses standardized_laplacian_polygon_four_mem_of_ineqs_combo_three, standardized_laplacian_polygon_four_mem_of_ineqs_p1, standardized_laplacian_polygon_four_mem_of_ineqs_p2, standardized_laplacian_polygon_four_mem_of_ineqs_p3, Complex.ext

        · refine standardized_laplacian_polygon_four_mem_of_ineqs_combo_three
            ((1/4 : ℂ) + Complex.I / 4) ((3/4 : ℂ) + Complex.I / 4) 1
            standardized_laplacian_polygon_four_mem_of_ineqs_p1
            standardized_laplacian_polygon_four_mem_of_ineqs_p2
            standardized_laplacian_polygon_four_mem_of_ineqs_p3
            (2 * (1 - z.re - z.im)) (2 * (z.re + 3 * z.im - 1)) (1 - 4 * z.im)
            (by linarith) (by linarith) (by linarith) (by ring) ?_
          apply Complex.ext <;> (simp; ring)
  8. When Im(z) < 0, the hypotheses simplify to -Im(z) ≤ 1/4, -Im(z) ≤ Re(z), and Re(z) - Im(z) ≤ 1.

    When Im(z) is not non-negative, linear arithmetic gives Im(z) < 0. Then abs_of_neg rewrites |Im(z)| as -Im(z) across all three inequalities.

    lines 90–92

    uses abs_of_neg

      · have h_im_neg : z.im < 0 := by linarith
        have h_abs : |z.im| = -z.im := abs_of_neg h_im_neg
        rw [h_abs] at h_im_le h_left h_right
  9. If Im(z) < 0 and Re(z) - 3 * Im(z) ≤ 1, then z belongs to S_4 as a convex combination of 0, 1/4 - I/4, and 1.

    We express z as a convex combination of p0 = 0, p5 = 1/4 - Complex.I/4, and p3 = 1 with weights 1 - Re(z) + 3 * Im(z), -4 * Im(z), and Re(z) + Im(z). The weights are verified non-negative by linear arithmetic and sum to 1 by ring arithmetic. Applying standardized_laplacian_polygon_four_mem_of_ineqs_combo_three and equating components with Complex.ext yields z ∈ S_4.

    lines 93–101

    uses standardized_laplacian_polygon_four_mem_of_ineqs_combo_three, standardized_laplacian_polygon_four_mem_of_ineqs_p0, standardized_laplacian_polygon_four_mem_of_ineqs_p5, standardized_laplacian_polygon_four_mem_of_ineqs_p3, Complex.ext

        by_cases h_split : z.re - 3 * z.im ≤ 1
        · refine standardized_laplacian_polygon_four_mem_of_ineqs_combo_three
            0 ((1/4 : ℂ) - Complex.I / 4) 1
            standardized_laplacian_polygon_four_mem_of_ineqs_p0
            standardized_laplacian_polygon_four_mem_of_ineqs_p5
            standardized_laplacian_polygon_four_mem_of_ineqs_p3
            (1 - z.re + 3 * z.im) (-4 * z.im) (z.re + z.im)
            (by linarith) (by linarith) (by linarith) (by ring) ?_
          apply Complex.ext <;> (simp; ring)
  10. If Im(z) < 0 and Re(z) - 3 * Im(z) > 1, then z belongs to S_4 as a convex combination of 1/4 - I/4, 3/4 - I/4, and 1.

    We express z as a convex combination of p5 = 1/4 - Complex.I/4, p4 = 3/4 - Complex.I/4, and p3 = 1 with weights 2 * (1 - Re(z) + Im(z)), 2 * (Re(z) - 3 * Im(z) - 1), and 1 + 4 * Im(z). Non-negativity and unit sum follow from linear and ring arithmetic. Applying standardized_laplacian_polygon_four_mem_of_ineqs_combo_three and verifying real and imaginary parts with Complex.ext concludes z ∈ S_4.

    lines 102–109

    uses standardized_laplacian_polygon_four_mem_of_ineqs_combo_three, standardized_laplacian_polygon_four_mem_of_ineqs_p5, standardized_laplacian_polygon_four_mem_of_ineqs_p4, standardized_laplacian_polygon_four_mem_of_ineqs_p3, Complex.ext

        · refine standardized_laplacian_polygon_four_mem_of_ineqs_combo_three
            ((1/4 : ℂ) - Complex.I / 4) ((3/4 : ℂ) - Complex.I / 4) 1
            standardized_laplacian_polygon_four_mem_of_ineqs_p5
            standardized_laplacian_polygon_four_mem_of_ineqs_p4
            standardized_laplacian_polygon_four_mem_of_ineqs_p3
            (2 * (1 - z.re + z.im)) (2 * (z.re - 3 * z.im - 1)) (1 + 4 * z.im)
            (by linarith) (by linarith) (by linarith) (by ring) ?_
          apply Complex.ext <;> (simp; ring)
mem_convexHull_of_exists_fintype
A point in a vector space belongs to the convex hull of a set if it can be expressed as a finite convex combination of elements of that set.
Fin.sum_univ_three
The sum of a function over the three-element type Fin 3 equals f 0 + f 1 + f 2.
Finset.sum_range_succ
The sum of a function over the range of n + 1 equals the sum over the range of n plus the term at n.
Complex.I_sq
The square of the imaginary unit Complex.I is -1.
abs_of_nonneg
The absolute value of a non-negative real number is the number itself.
abs_of_neg
The absolute value of a strictly negative real number is its negation.
Complex.ext
Two complex numbers are equal if and only if their real parts and imaginary parts are respectively equal.
standardized_laplacian_polygon_four_mem_of_ineqs_combo_three
Any convex combination of three points in the generator set belongs to the standardized Laplacian polygon S_4.
standardized_laplacian_polygon_four_mem_of_ineqs_p0
The point 0 belongs to the generator set standardized_laplacian_polygon_four_mem_of_ineqs_gen.
standardized_laplacian_polygon_four_mem_of_ineqs_p1
The point 1/4 + Complex.I / 4 belongs to the generator set standardized_laplacian_polygon_four_mem_of_ineqs_gen.
standardized_laplacian_polygon_four_mem_of_ineqs_p2
The point 3/4 + Complex.I / 4 belongs to the generator set standardized_laplacian_polygon_four_mem_of_ineqs_gen.
standardized_laplacian_polygon_four_mem_of_ineqs_p3
The point 1 belongs to the generator set standardized_laplacian_polygon_four_mem_of_ineqs_gen.
standardized_laplacian_polygon_four_mem_of_ineqs_p4
The point 3/4 - Complex.I / 4 belongs to the generator set standardized_laplacian_polygon_four_mem_of_ineqs_gen.
standardized_laplacian_polygon_four_mem_of_ineqs_p5
The point 1/4 - Complex.I / 4 belongs to the generator set standardized_laplacian_polygon_four_mem_of_ineqs_gen.

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 Complexabbrev standardized_laplacian_polygon_four_mem_of_ineqs_gen : Set ℂ :=  { (1 / (4 : ℂ)) * ∑ m ∈ Finset.range (k + 1), (1 - (-Complex.I) ^ m) | k : Fin 4 } ∪  { star ((1 / (4 : ℂ)) * ∑ m ∈ Finset.range (k + 1), (1 - (-Complex.I) ^ m)) | k : Fin 4 }lemma standardized_laplacian_polygon_four_mem_of_ineqs_combo_three    (p0 p1 p2 : ℂ)    (hp0 : p0 ∈ standardized_laplacian_polygon_four_mem_of_ineqs_gen)    (hp1 : p1 ∈ standardized_laplacian_polygon_four_mem_of_ineqs_gen)    (hp2 : p2 ∈ standardized_laplacian_polygon_four_mem_of_ineqs_gen)    (w0 w1 w2 : ℝ)    (hw0 : 0 ≤ w0) (hw1 : 0 ≤ w1) (hw2 : 0 ≤ w2)    (hsum : w0 + w1 + w2 = 1)    {z : ℂ} (hz : z = w0 • p0 + w1 • p1 + w2 • p2) :    z ∈ standardized_laplacian_polygon_four := by  change z ∈ convexHull ℝ standardized_laplacian_polygon_four_mem_of_ineqs_gen  rw [hz]  refine mem_convexHull_of_exists_fintype (s := standardized_laplacian_polygon_four_mem_of_ineqs_gen)    (x := w0 • p0 + w1 • p1 + w2 • p2)    ![w0, w1, w2] ![p0, p1, p2] ?_ ?_ ?_ ?_  · intro i; fin_cases i <;> simp [hw0, hw1, hw2]  · simp [Fin.sum_univ_three, hsum]  · intro i; fin_cases i <;> simp [hp0, hp1, hp2]  · simp [Fin.sum_univ_three]lemma standardized_laplacian_polygon_four_mem_of_ineqs_p0 :    (0 : ℂ) ∈ standardized_laplacian_polygon_four_mem_of_ineqs_gen := by  left; use ⟨0, by decide⟩; simplemma standardized_laplacian_polygon_four_mem_of_ineqs_p1 :    (1/4 : ℂ) + Complex.I / 4 ∈ standardized_laplacian_polygon_four_mem_of_ineqs_gen := by  left; use ⟨1, by decide⟩; simp [Finset.sum_range_succ]; ringlemma standardized_laplacian_polygon_four_mem_of_ineqs_p2 :    (3/4 : ℂ) + Complex.I / 4 ∈ standardized_laplacian_polygon_four_mem_of_ineqs_gen := by  left; use ⟨2, by decide⟩; simp [Finset.sum_range_succ]; ringlemma standardized_laplacian_polygon_four_mem_of_ineqs_p3 :    (1 : ℂ) ∈ standardized_laplacian_polygon_four_mem_of_ineqs_gen := by  left; use ⟨3, by decide⟩  simp [Finset.sum_range_succ]  have : (-Complex.I) ^ 3 = -(-Complex.I) := by    calc (-Complex.I) ^ 3 = (-Complex.I) ^ 2 * (-Complex.I) := by ring    _ = (Complex.I ^ 2) * (-Complex.I) := by ring    _ = -1 * (-Complex.I) := by rw [Complex.I_sq]    _ = -(-Complex.I) := by ring  rw [this]; ringlemma standardized_laplacian_polygon_four_mem_of_ineqs_p4 :    (3/4 : ℂ) - Complex.I / 4 ∈ standardized_laplacian_polygon_four_mem_of_ineqs_gen := by  right; use ⟨2, by decide⟩  have h : (1 / (4 : ℂ)) * ∑ m ∈ Finset.range (2 + 1), (1 - (-Complex.I) ^ m) = 3/4 + Complex.I/4 := by    simp [Finset.sum_range_succ]; ring  rw [h]; simp; ringlemma standardized_laplacian_polygon_four_mem_of_ineqs_p5 :    (1/4 : ℂ) - Complex.I / 4 ∈ standardized_laplacian_polygon_four_mem_of_ineqs_gen := by  right; use ⟨1, by decide⟩  have h : (1 / (4 : ℂ)) * ∑ m ∈ Finset.range (1 + 1), (1 - (-Complex.I) ^ m) = 1/4 + Complex.I/4 := by    simp [Finset.sum_range_succ]; ring  rw [h]; simp; ring/-- Any complex number z satisfying |Im(z)| ≤ 1/4, |Im(z)| ≤ Re(z), and Re(z) + |Im(z)| ≤ 1 belongs to the standardized Laplacian polygon S_4. -/theorem standardized_laplacian_polygon_four_mem_of_ineqs (z : ℂ)    (h_im_le : |z.im| ≤ (1 : ℝ) / 4)    (h_left : |z.im| ≤ z.re)    (h_right : z.re + |z.im| ≤ 1) :    z ∈ standardized_laplacian_polygon_four := by  by_cases h_im : 0 ≤ z.im  · have h_abs : |z.im| = z.im := abs_of_nonneg h_im    rw [h_abs] at h_im_le h_left h_right    by_cases h_split : z.re + 3 * z.im ≤ 1    · refine standardized_laplacian_polygon_four_mem_of_ineqs_combo_three        0 ((1/4 : ℂ) + Complex.I / 4) 1        standardized_laplacian_polygon_four_mem_of_ineqs_p0        standardized_laplacian_polygon_four_mem_of_ineqs_p1        standardized_laplacian_polygon_four_mem_of_ineqs_p3        (1 - z.re - 3 * z.im) (4 * z.im) (z.re - z.im)        (by linarith) (by linarith) (by linarith) (by ring) ?_      apply Complex.ext <;> (simp; ring)    · refine standardized_laplacian_polygon_four_mem_of_ineqs_combo_three        ((1/4 : ℂ) + Complex.I / 4) ((3/4 : ℂ) + Complex.I / 4) 1        standardized_laplacian_polygon_four_mem_of_ineqs_p1        standardized_laplacian_polygon_four_mem_of_ineqs_p2        standardized_laplacian_polygon_four_mem_of_ineqs_p3        (2 * (1 - z.re - z.im)) (2 * (z.re + 3 * z.im - 1)) (1 - 4 * z.im)        (by linarith) (by linarith) (by linarith) (by ring) ?_      apply Complex.ext <;> (simp; ring)  · have h_im_neg : z.im < 0 := by linarith    have h_abs : |z.im| = -z.im := abs_of_neg h_im_neg    rw [h_abs] at h_im_le h_left h_right    by_cases h_split : z.re - 3 * z.im ≤ 1    · refine standardized_laplacian_polygon_four_mem_of_ineqs_combo_three        0 ((1/4 : ℂ) - Complex.I / 4) 1        standardized_laplacian_polygon_four_mem_of_ineqs_p0        standardized_laplacian_polygon_four_mem_of_ineqs_p5        standardized_laplacian_polygon_four_mem_of_ineqs_p3        (1 - z.re + 3 * z.im) (-4 * z.im) (z.re + z.im)        (by linarith) (by linarith) (by linarith) (by ring) ?_      apply Complex.ext <;> (simp; ring)    · refine standardized_laplacian_polygon_four_mem_of_ineqs_combo_three        ((1/4 : ℂ) - Complex.I / 4) ((3/4 : ℂ) - Complex.I / 4) 1        standardized_laplacian_polygon_four_mem_of_ineqs_p5        standardized_laplacian_polygon_four_mem_of_ineqs_p4        standardized_laplacian_polygon_four_mem_of_ineqs_p3        (2 * (1 - z.re + z.im)) (2 * (z.re - 3 * z.im - 1)) (1 + 4 * z.im)        (by linarith) (by linarith) (by linarith) (by ring) ?_      apply Complex.ext <;> (simp; ring)
See it in the graphDiscuss this resultChallenge it