AFTD Auto-Formalizing Theoretical Domains

good_slopes_fiber55_nine_neighbor_example

theoremverified

There are 55 points over Z/55 containing the two standard anchors with all seven displayed directions good; these directions belong to the nine-neighbor set tested in experiment 27575, disproving the suggested strengthening to at most six of those nine directions.

Statement

theorem good_slopes_fiber55_nine_neighbor_example :
    ∃ S : Finset (ZMod 55 × ZMod 55), S.card = 55 ∧ (0,0) ∈ S ∧ (1,54) ∈ S ∧
      ∀ a ∈ ({23,34,16,21,26,31,36} : Finset (ZMod 55)),
        (S.image fun p => p.2 + a*p.1).card = 55
Source
Counterexample identified in computation 27575 for the OP-1027 fiber investigation.
Verified
15 Nov 2026
Axioms
Classical.choiceQuot.soundpropext

The proof, explained

The theorem provides a counterexample to the suggested bound by exhibiting an explicit 55-element set S ⊆ (ℤ/55ℤ)² containing the anchor points (0,0) and (1,54). The goal is reduced to verifying that each of the seven candidate slopes a ∈ {23, 34, 16, 21, 26, 31, 36} is good, which is then confirmed for every slope by exhaustive finite computation (`decide`) showing that the projection (x, y) ↦ y + ax takes 55 distinct values.

  1. We exhibit an explicit candidate subset S ⊆ (ℤ/55ℤ)² having 55 elements and containing the anchor points (0, 0) and (1, 54).

    Lines 8–64 define S as a concrete collection of 55 coordinate pairs in ℤ/55ℤ × ℤ/55ℤ. Line 65 provides S as the witness for the existential quantifier, discharging the requirements that |S| = 55, (0, 0) ∈ S, and (1, 54) ∈ S by finite computational evaluation (`decide`). This leaves only the condition that each of the seven candidate slopes is good.

    lines 8–65

      let S : Finset (ZMod 55 × ZMod 55) := {
        (0, 0),
        (1, 8),
        (1, 51),
        (1, 54),
        (2, 5),
        (3, 53),
        (4, 23),
        (4, 38),
        (5, 32),
        (6, 17),
        (7, 20),
        (8, 7),
        (9, 27),
        (9, 52),
        (10, 53),
        (11, 31),
        (12, 16),
        (12, 45),
        (13, 25),
        (13, 32),
        (14, 5),
        (15, 46),
        (16, 52),
        (17, 42),
        (18, 15),
        (20, 5),
        (20, 33),
        (20, 45),
        (24, 28),
        (24, 41),
        (25, 41),
        (26, 40),
        (33, 40),
        (34, 50),
        (35, 44),
        (36, 12),
        (37, 21),
        (39, 11),
        (39, 41),
        (40, 17),
        (44, 1),
        (44, 18),
        (44, 37),
        (45, 5),
        (45, 31),
        (45, 46),
        (46, 28),
        (47, 37),
        (49, 0),
        (49, 7),
        (49, 15),
        (49, 27),
        (52, 27),
        (52, 46),
        (52, 52)
      }
      refine ⟨S, by decide, by decide, by decide, ?_⟩
  2. The universal claim over the set of seven slopes reduces to seven independent cases.

    We introduce an arbitrary slope a and the hypothesis that a belongs to the set {23, 34, 16, 21, 26, 31, 36}. Rewriting with `Finset.mem_insert` and `Finset.mem_singleton` unfolds membership in this finite set into a disjunction of seven equalities (a = 23 ∨ a = 34 ∨ ⋯ ∨ a = 36). A case split on these disjunctions produces seven separate goals, one for each specific value of a.

    lines 66–68

    uses Finset.mem_insert, Finset.mem_singleton

      intro a ha
      simp only [Finset.mem_insert, Finset.mem_singleton] at ha
      rcases ha with rfl | rfl | rfl | rfl | rfl | rfl | rfl
  3. For each of the seven slopes, the linear projection has 55 distinct values on S. automation

    For each of the seven cases (a = 23, 34, 16, 21, 26, 31, 36), the decision procedure (`decide`) evaluates the image {y + a * x : (x, y) ∈ S} ⊆ ℤ/55ℤ by exhaustive calculation and confirms that its cardinality is 55, completing the proof.

    line 69

      all_goals decide
Finset.mem_insert
An element belongs to `insert b s` if and only if it equals `b` or belongs to `s`.
Finset.mem_singleton
An element belongs to the singleton set `{a}` if and only if it equals `a`.

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

set_option maxHeartbeats 10000000set_option maxRecDepth 15000theorem good_slopes_fiber55_nine_neighbor_example :    ∃ S : Finset (ZMod 55 × ZMod 55), S.card = 55 ∧ (0,0) ∈ S ∧ (1,54) ∈ S ∧      ∀ a ∈ ({23,34,16,21,26,31,36} : Finset (ZMod 55)),        (S.image fun p => p.2 + a*p.1).card = 55 := by  let S : Finset (ZMod 55 × ZMod 55) := {    (0, 0),    (1, 8),    (1, 51),    (1, 54),    (2, 5),    (3, 53),    (4, 23),    (4, 38),    (5, 32),    (6, 17),    (7, 20),    (8, 7),    (9, 27),    (9, 52),    (10, 53),    (11, 31),    (12, 16),    (12, 45),    (13, 25),    (13, 32),    (14, 5),    (15, 46),    (16, 52),    (17, 42),    (18, 15),    (20, 5),    (20, 33),    (20, 45),    (24, 28),    (24, 41),    (25, 41),    (26, 40),    (33, 40),    (34, 50),    (35, 44),    (36, 12),    (37, 21),    (39, 11),    (39, 41),    (40, 17),    (44, 1),    (44, 18),    (44, 37),    (45, 5),    (45, 31),    (45, 46),    (46, 28),    (47, 37),    (49, 0),    (49, 7),    (49, 15),    (49, 27),    (52, 27),    (52, 46),    (52, 52)  }  refine ⟨S, by decide, by decide, by decide, ?_⟩  intro a ha  simp only [Finset.mem_insert, Finset.mem_singleton] at ha  rcases ha with rfl | rfl | rfl | rfl | rfl | rfl | rfl  all_goals decide
See it in the graphDiscuss this resultChallenge it