AFTD Auto-Formalizing Theoretical Domains

zero_mem_standardized_laplacian_polygon_four

theoremverified

The origin zero belongs to the standardized Laplacian polygon S_4.

Statement

theorem zero_mem_standardized_laplacian_polygon_four : (0 : ℂ) ∈ standardized_laplacian_polygon_four
Source
arXiv:2610.14100 Sec. 2
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 =…

Read back from the Lean

The complex number $0$ belongs to standardized_laplacian_polygon_four, which is defined as the convex hull over $\mathbb{R}$ of the union of two sets of complex numbers: 1. The set of values $\frac{1}{4} \sum_{m=0}^k (1 - (-i)^m)$ as $k$ ranges over Fin 4 (i.e., $k \in \{0, 1, 2, 3\}$). 2. The set of complex conjugates of those same values.

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

The proof, explained

By definition, the standardized Laplacian polygon $S_4$ is the convex hull of two families of vertices in $\mathbb{C}$. Since every set is contained in its convex hull, it suffices to show that $0$ is one of the generating vertices. Evaluating the first vertex family at index $k = 0$ yields the single term $\frac{1}{4}(1 - (-i)^0) = 0$.

  1. It suffices to show that $0$ belongs to the first family of generating vertices of $S_4$.

    Unfolding the definition shows that $S_4$ is defined as the real convex hull of the union of two vertex sets. By `subset_convexHull`, any set is a subset of its convex hull, so it suffices to show that $0$ belongs to the union; choosing the left component reduces the goal to showing that $0$ is among the vertices $\frac{1}{4} \sum_{m=0}^k (1 - (-i)^m)$ for $k \in \{0, 1, 2, 3\}$.

    lines 3–5

    uses subset_convexHull

      unfold standardized_laplacian_polygon_four
      apply subset_convexHull
      left
  2. The vertex corresponding to index $k = 0$ equals $0$, completing the proof.

    Choosing $k = 0 \in \operatorname{Fin} 4$ (with the bound $0 < 4$ checked by decidability), the sum consists of the single term $m = 0$. Since $1 - (-i)^0 = 1 - 1 = 0$, the expression simplifies to $\frac{1}{4} \cdot 0 = 0$.

    lines 6–7

      use ⟨0, by decide⟩
      simp
subset_convexHull
Every subset of a real topological vector space (or module) is contained in its convex hull: $s \subseteq \operatorname{convexHull}(\mathbb{R}, s)$.

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

/-- The origin zero lies in the standardized Laplacian polygon S_4. -/theorem zero_mem_standardized_laplacian_polygon_four : (0 : ℂ) ∈ standardized_laplacian_polygon_four := by  unfold standardized_laplacian_polygon_four  apply subset_convexHull  left  use ⟨0, by decide⟩  simp
See it in the graphDiscuss this resultChallenge it