AFTD Auto-Formalizing Theoretical Domains

five_point_zero_sum_atom_classification

theoremverified

For the five planar box points (1,1),(1,0),(0,1),(-2,0),(0,-2), every nonzero nonnegative integer atom in their zero-sum kernel has multiplicity vector exactly one of (2,0,0,1,1),(0,2,0,1,0),(0,0,2,0,1),(1,1,1,1,1). Atomicity is stated explicitly in coordinatewise subvector form.

Statement

theorem five_point_zero_sum_atom_classification (x : Fin 5 → ℤ)
    (hx : ∀ i, 0 ≤ x i) (hne : x ≠ 0)
    (hz1 : x 0 + x 1 = 2*x 3) (hz2 : x 0 + x 2 = 2*x 4)
    (hmin : ∀ y : Fin 5 → ℤ, (∀ i, 0 ≤ y i) → (∀ i, y i ≤ x i) →
      y 0 + y 1 = 2*y 3 → y 0 + y 2 = 2*y 4 → y = 0 ∨ y = x) :
    x = ![2,0,0,1,1] ∨ x = ![0,2,0,1,0] ∨
    x = ![0,0,2,0,1] ∨ x = ![1,1,1,1,1]
Source
Supporting lemma or explicit route obstruction for OP-197 / arXiv:2610.16562 Conjecture1, deep session2. The abstract two-ray fact and finite obstruction are not claimed novel or research-level; no part is the full box conjecture. The five-point kernel has columns (1,1),(1,0),(0,1),(-2,0),(0,-2).
Verified
28 Oct 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 2
  • TotalPreorderA total preorder: a preorder where ≤ is total (complete). This is weaker than LinearOrder — it does NOT require antisymmetry or…
  • LinearOrder.toTotalPreorderEvery LinearOrder is a TotalPreorder.
Used by 1

The proof, explained

The theorem classifies the atoms (minimal nonzero nonnegative integer vectors) in the zero-sum kernel for five planar points by case analysis on the first coordinate x 0. When x 0 ≥ 2 or x 0 = 1, parity and the linear balance equations force x to dominate (2,0,0,1,1) or (1,1,1,1,1) respectively, so atomicity forces equality. When x 0 = 0, the nonzeroness of x ensures that either x 3 > 0 or x 4 > 0, which similarly forces x to equal (0,2,0,1,0) or (0,0,2,0,1).

  1. Each component of x is nonnegative: x 0 ≥ 0, x 1 ≥ 0, x 2 ≥ 0, x 3 ≥ 0, and x 4 ≥ 0.

    Specialise the hypothesis hx, which states that every component of x is nonnegative, to each index in {0, 1, 2, 3, 4} to record these individual inequalities as hypotheses h0 through h4.

    lines 12–16

      have h0 := hx 0
      have h1 := hx 1
      have h2 := hx 2
      have h3 := hx 3
      have h4 := hx 4
  2. If x 0 ≥ 2, then x = (2, 0, 0, 1, 1).

    When x 0 ≥ 2, the balance conditions x 0 + x 1 = 2 * x 3 and x 0 + x 2 = 2 * x 4 together with the nonnegativity of x 1 and x 2 force 2 * x 3 ≥ 2 and 2 * x 4 ≥ 2, so x 3 ≥ 1 and x 4 ≥ 1. Thus the vector (2, 0, 0, 1, 1) is coordinatewise bounded above by x. Because (2, 0, 0, 1, 1) is nonzero and satisfies both balance equations, the atomicity hypothesis hmin requires it to equal x.

    lines 17–22

    uses Or.inl

      by_cases hbig : 2 ≤ x 0
      · have hsub : ∀ i, (![2,0,0,1,1] : Fin 5 → ℤ) i ≤ x i := by
          intro i; fin_cases i <;> dsimp at * <;> omega
        have hh := hmin ![2,0,0,1,1] (by intro i; fin_cases i <;> norm_num) hsub (by decide) (by decide)
        have hh0 : (![2,0,0,1,1] : Fin 5 → ℤ) ≠ 0 := by decide
        exact Or.inl ((hh.resolve_left hh0).symm)
  3. If x 0 = 1, then x = (1, 1, 1, 1, 1).

    When x 0 = 1, the balance conditions become 1 + x 1 = 2 * x 3 and 1 + x 2 = 2 * x 4. Parity forces x 1 and x 2 to be odd, so nonnegativity yields x 1 ≥ 1 and x 2 ≥ 1. This in turn gives 2 * x 3 ≥ 2 and 2 * x 4 ≥ 2, implying x 3 ≥ 1 and x 4 ≥ 1. Therefore (1, 1, 1, 1, 1) ≤ x coordinatewise. Since this vector is a nonzero solution to the balance equations, atomicity forces x = (1, 1, 1, 1, 1).

    lines 23–28

    uses Or.inr

      by_cases hone : x 0 = 1
      · have hsub : ∀ i, (![1,1,1,1,1] : Fin 5 → ℤ) i ≤ x i := by
          intro i; fin_cases i <;> dsimp at * <;> omega
        have hh := hmin ![1,1,1,1,1] (by intro i; fin_cases i <;> norm_num) hsub (by decide) (by decide)
        have hh0 : (![1,1,1,1,1] : Fin 5 → ℤ) ≠ 0 := by decide
        exact Or.inr (Or.inr (Or.inr ((hh.resolve_left hh0).symm)))
  4. In the remaining cases, x 0 = 0.

    Since x 0 ≥ 0, but neither x 0 ≥ 2 nor x 0 = 1 holds, linear integer arithmetic forces x 0 = 0.

    line 29

      have hz0 : x 0 = 0 := by omega
  5. If x 0 = 0 and x 3 > 0, then x = (0, 2, 0, 1, 0).

    With x 0 = 0 and x 3 ≥ 1, the first balance equation gives x 1 = 2 * x 3 ≥ 2. Combined with the nonnegativity of x 2 and x 4, this means (0, 2, 0, 1, 0) ≤ x coordinatewise. Since (0, 2, 0, 1, 0) is nonzero and satisfies the balance equations, atomicity forces x = (0, 2, 0, 1, 0).

    lines 30–35

    uses Or.inl, Or.inr

      by_cases hb : 0 < x 3
      · have hsub : ∀ i, (![0,2,0,1,0] : Fin 5 → ℤ) i ≤ x i := by
          intro i; fin_cases i <;> dsimp at * <;> omega
        have hh := hmin ![0,2,0,1,0] (by intro i; fin_cases i <;> norm_num) hsub (by decide) (by decide)
        have hh0 : (![0,2,0,1,0] : Fin 5 → ℤ) ≠ 0 := by decide
        exact Or.inr (Or.inl ((hh.resolve_left hh0).symm))
  6. When x 0 = 0 and x 3 ≤ 0, the coordinate x 4 must be strictly positive.

    Suppose for contradiction that x 4 ≤ 0. Then x 3 = 0 and x 4 = 0 by nonnegativity. Substituting x 0 = 0, x 3 = 0, and x 4 = 0 into the balance equations gives x 1 = 0 and x 2 = 0, which would mean x = 0 everywhere, contradicting the assumption hne that x ≠ 0. Hence x 4 > 0.

    lines 36–40

      have hc : 0 < x 4 := by
        by_contra hh
        have hzero : x = 0 := by
          funext i; fin_cases i <;> dsimp at * <;> omega
        exact hne hzero
  7. When x 0 = 0, x 3 = 0, and x 4 > 0, then x = (0, 0, 2, 0, 1).

    With x 0 = 0 and x 4 ≥ 1, the second balance equation gives x 2 = 2 * x 4 ≥ 2. Thus (0, 0, 2, 0, 1) ≤ x coordinatewise. Since (0, 0, 2, 0, 1) is nonzero and satisfies the balance equations, atomicity forces x = (0, 0, 2, 0, 1).

    lines 41–45

    uses Or.inl, Or.inr

      have hsub : ∀ i, (![0,0,2,0,1] : Fin 5 → ℤ) i ≤ x i := by
        intro i; fin_cases i <;> dsimp at * <;> omega
      have hh := hmin ![0,0,2,0,1] (by intro i; fin_cases i <;> norm_num) hsub (by decide) (by decide)
      have hh0 : (![0,0,2,0,1] : Fin 5 → ℤ) ≠ 0 := by decide
      exact Or.inr (Or.inr (Or.inl ((hh.resolve_left hh0).symm)))
Or.inl
Given a proof of P, produces a proof of the disjunction P ∨ Q.
Or.inr
Given a proof of Q, produces a proof of the disjunction P ∨ Q.

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 Finsetset_option maxHeartbeats 1000000set_option maxRecDepth 4000theorem five_point_zero_sum_atom_classification (x : Fin 5 → ℤ)    (hx : ∀ i, 0 ≤ x i) (hne : x ≠ 0)    (hz1 : x 0 + x 1 = 2*x 3) (hz2 : x 0 + x 2 = 2*x 4)    (hmin : ∀ y : Fin 5 → ℤ, (∀ i, 0 ≤ y i) → (∀ i, y i ≤ x i) →      y 0 + y 1 = 2*y 3 → y 0 + y 2 = 2*y 4 → y = 0 ∨ y = x) :    x = ![2,0,0,1,1] ∨ x = ![0,2,0,1,0] ∨    x = ![0,0,2,0,1] ∨ x = ![1,1,1,1,1] := by  have h0 := hx 0  have h1 := hx 1  have h2 := hx 2  have h3 := hx 3  have h4 := hx 4  by_cases hbig : 2 ≤ x 0  · have hsub : ∀ i, (![2,0,0,1,1] : Fin 5 → ℤ) i ≤ x i := by      intro i; fin_cases i <;> dsimp at * <;> omega    have hh := hmin ![2,0,0,1,1] (by intro i; fin_cases i <;> norm_num) hsub (by decide) (by decide)    have hh0 : (![2,0,0,1,1] : Fin 5 → ℤ) ≠ 0 := by decide    exact Or.inl ((hh.resolve_left hh0).symm)  by_cases hone : x 0 = 1  · have hsub : ∀ i, (![1,1,1,1,1] : Fin 5 → ℤ) i ≤ x i := by      intro i; fin_cases i <;> dsimp at * <;> omega    have hh := hmin ![1,1,1,1,1] (by intro i; fin_cases i <;> norm_num) hsub (by decide) (by decide)    have hh0 : (![1,1,1,1,1] : Fin 5 → ℤ) ≠ 0 := by decide    exact Or.inr (Or.inr (Or.inr ((hh.resolve_left hh0).symm)))  have hz0 : x 0 = 0 := by omega  by_cases hb : 0 < x 3  · have hsub : ∀ i, (![0,2,0,1,0] : Fin 5 → ℤ) i ≤ x i := by      intro i; fin_cases i <;> dsimp at * <;> omega    have hh := hmin ![0,2,0,1,0] (by intro i; fin_cases i <;> norm_num) hsub (by decide) (by decide)    have hh0 : (![0,2,0,1,0] : Fin 5 → ℤ) ≠ 0 := by decide    exact Or.inr (Or.inl ((hh.resolve_left hh0).symm))  have hc : 0 < x 4 := by    by_contra hh    have hzero : x = 0 := by      funext i; fin_cases i <;> dsimp at * <;> omega    exact hne hzero  have hsub : ∀ i, (![0,0,2,0,1] : Fin 5 → ℤ) i ≤ x i := by    intro i; fin_cases i <;> dsimp at * <;> omega  have hh := hmin ![0,0,2,0,1] (by intro i; fin_cases i <;> norm_num) hsub (by decide) (by decide)  have hh0 : (![0,0,2,0,1] : Fin 5 → ℤ) ≠ 0 := by decide  exact Or.inr (Or.inr (Or.inl ((hh.resolve_left hh0).symm)))
See it in the graphDiscuss this resultChallenge it