AFTD Auto-Formalizing Theoretical Domains

five_point_zero_sum_circuit_length_barrier

theoremverified

In the zero-sum kernel of the explicit five box points (1,1),(1,0),(0,1),(-2,0),(0,-2), there exists an atom of length five while every atom with at most three nonzero coordinates has length at most four. Thus domination by the largest three-support circuit fails already for a five-point support. This does not refute the box maximum conjecture.

Statement

theorem five_point_zero_sum_circuit_length_barrier :
    ∃ x : Fin 5 → ℤ,
      (∀ i, 0 ≤ x i) ∧ x ≠ 0 ∧
      x 0 + x 1 = 2*x 3 ∧ x 0 + x 2 = 2*x 4 ∧
      (∀ 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) ∧
      (∑ i, x i) = 5 ∧
      (∀ z : Fin 5 → ℤ, (∀ i, 0 ≤ z i) → z ≠ 0 →
        z 0 + z 1 = 2*z 3 → z 0 + z 2 = 2*z 4 →
        (∀ y : Fin 5 → ℤ, (∀ i, 0 ≤ y i) → (∀ i, y i ≤ z i) →
          y 0 + y 1 = 2*y 3 → y 0 + y 2 = 2*y 4 → y = 0 ∨ y = z) →
        (Finset.univ.filter (fun i => z i ≠ 0)).card ≤ 3 → (∑ i, z i) ≤ 4)
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

The proof, explained

The proof exhibits the all-ones vector x = (1, 1, 1, 1, 1) as an atom of length 5 in the zero-sum kernel of the five given points. Atomicity of x follows from five_point_zero_sum_unit_atom, which classifies all {0, 1}-valued solutions. Finally, using five_point_zero_sum_atom_classification, any atom with support size at most 3 must be one of three explicit vectors of lengths 4, 3, and 3, while the all-ones vector is ruled out by having support size 5.

  1. It suffices to show that the all-ones vector x = (1, 1, 1, 1, 1) satisfies the seven conditions of the theorem.

    We instantiate the existential quantifier with the candidate witness x = (1, 1, 1, 1, 1), which decomposes the theorem into verifying that x is non-negative, non-zero, belongs to the kernel, is an atom, has coordinate sum 5, and that all atoms with support size at most 3 have sum at most 4.

    line 17

      refine ⟨![1,1,1,1,1], ?_, ?_, ?_, ?_, ?_, ?_, ?_⟩
  2. The vector x is non-negative, non-zero, and satisfies the kernel equations x₀ + x₁ = 2x₃ and x₀ + x₂ = 2x₄.

    Evaluating the vector on each of the five indices shows that each coordinate is 1 ≥ 0, x is not the zero vector, and both kernel equations hold because 1 + 1 = 2 × 1.

    lines 18–21

      · intro i; fin_cases i <;> norm_num
      · decide
      · decide
      · decide
  3. x is an atom in the zero-sum kernel: any non-negative integer subvector 0 ≤ y ≤ x in the kernel is either 0 or x.

    Since 0 ≤ y ≤ x = (1, 1, 1, 1, 1), each entry of y satisfies yᵢ ≤ 1. The classification lemma five_point_zero_sum_unit_atom directly implies that any such kernel vector bounded by 1 must be either 0 or (1, 1, 1, 1, 1) = x.

    lines 22–23

    uses five_point_zero_sum_unit_atom

      · intro y hy hle hz1 hz2
        exact five_point_zero_sum_unit_atom y hy (by intro i; have hh := hle i; fin_cases i <;> simpa using hh) hz1 hz2
  4. The length (coordinate sum) of x is 5.

    The sum of coordinates is 1 + 1 + 1 + 1 + 1 = 5, verified by direct evaluation.

    line 24

      · decide
  5. Every atom with at most three non-zero coordinates has coordinate sum at most 4.

    Let z be an atom whose support contains at most 3 non-zero coordinates. By five_point_zero_sum_atom_classification, z must be one of (2, 0, 0, 1, 1), (0, 2, 0, 1, 0), (0, 0, 2, 0, 1), or (1, 1, 1, 1, 1). For the first three candidate atoms, their coordinate sums are 4, 3, and 3, each of which is ≤ 4. In the remaining case z = (1, 1, 1, 1, 1), all five coordinates are equal to 1, meaning its support has size 5; this contradicts the hypothesis that its support size is at most 3.

    lines 25–33

    uses five_point_zero_sum_atom_classification

      · intro z hz hne hz1 hz2 hmin hsmall
        rcases five_point_zero_sum_atom_classification z hz hne hz1 hz2 hmin with rfl | rfl | rfl | rfl
        · decide
        · decide
        · decide
        · have hh : (![1,1,1,1,1] : Fin 5 → ℤ) = (fun _ => 1) := by
            funext i; fin_cases i <;> rfl
          rw [hh] at hsmall
          norm_num at hsmall
five_point_zero_sum_unit_atom
Any non-negative integer vector y in ℤ⁵ with entries bounded by 1 satisfying y₀ + y₁ = 2y₃ and y₀ + y₂ = 2y₄ is either the zero vector or the all-ones vector (1, 1, 1, 1, 1).
five_point_zero_sum_atom_classification
Every non-zero, non-negative minimal solution (atom) in the zero-sum kernel is equal to one of the four vectors (2, 0, 0, 1, 1), (0, 2, 0, 1, 0), (0, 0, 2, 0, 1), or (1, 1, 1, 1, 1).

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_circuit_length_barrier :    ∃ x : Fin 5 → ℤ,      (∀ i, 0 ≤ x i) ∧ x ≠ 0 ∧      x 0 + x 1 = 2*x 3 ∧ x 0 + x 2 = 2*x 4 ∧      (∀ 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) ∧      (∑ i, x i) = 5 ∧      (∀ z : Fin 5 → ℤ, (∀ i, 0 ≤ z i) → z ≠ 0 →        z 0 + z 1 = 2*z 3 → z 0 + z 2 = 2*z 4 →        (∀ y : Fin 5 → ℤ, (∀ i, 0 ≤ y i) → (∀ i, y i ≤ z i) →          y 0 + y 1 = 2*y 3 → y 0 + y 2 = 2*y 4 → y = 0 ∨ y = z) →        (Finset.univ.filter (fun i => z i ≠ 0)).card ≤ 3 → (∑ i, z i) ≤ 4) := by  refine ⟨![1,1,1,1,1], ?_, ?_, ?_, ?_, ?_, ?_, ?_⟩  · intro i; fin_cases i <;> norm_num  · decide  · decide  · decide  · intro y hy hle hz1 hz2    exact five_point_zero_sum_unit_atom y hy (by intro i; have hh := hle i; fin_cases i <;> simpa using hh) hz1 hz2  · decide  · intro z hz hne hz1 hz2 hmin hsmall    rcases five_point_zero_sum_atom_classification z hz hne hz1 hz2 hmin with rfl | rfl | rfl | rfl    · decide    · decide    · decide    · have hh : (![1,1,1,1,1] : Fin 5 → ℤ) = (fun _ => 1) := by        funext i; fin_cases i <;> rfl      rw [hh] at hsmall      norm_num at hsmall
See it in the graphDiscuss this resultChallenge it