AFTD Auto-Formalizing Theoretical Domains

good_slopes_fiber15_anchored_rigidity

theoremverified

Let S be a set of points over the residues modulo 15 containing (0,0) and (1,14). If the form y+4x is surjective on S, and the forms y+7x, y+11x and y+13x are each injective on S, then this is impossible.

Statement

theorem good_slopes_fiber15_anchored_rigidity (S : Set (ZMod 15 × ZMod 15))
    (h0 : (0, 0) ∈ S) (h1 : (1, 14) ∈ S)
    (h4 : ∀ t, ∃ p ∈ S, good_slopes_fiber15_form 4 p = t)
    (h7 : Set.InjOn (good_slopes_fiber15_form 7) S)
    (h11 : Set.InjOn (good_slopes_fiber15_form 11) S)
    (h13 : Set.InjOn (good_slopes_fiber15_form 13) S) : False
Source
Normalized four-direction rigidity used in the fiber analysis of OP-1027; arXiv:2611.04551, Question 10.2.
Verified
11 Nov 2026
Axioms
Classical.choiceQuot.soundpropext
Built on 1
Used by 1

The proof, explained

To show that the given conditions on S are inconsistent, the proof selects two points p, q in S where the surjective form y+4x takes values 6 and 12, respectively. Because the values of y+4x at (0, 0) and (1, 14) are 0 and 3, p and q are distinct from both anchor points; the injectivity of the other three forms then excludes several values for each form at p and q. A finite search (verified by decide) shows these restrictions uniquely determine p = (2, 13) and q = (14, 1). Finally, evaluating the form y+11x at these two points produces the identical value 5 mod 15, contradicting the injectivity of y+11x on S.

  1. Any point p satisfying the linear conditions is uniquely forced to be (2, 13). automation

    Because the domain (ZMod 15) x (ZMod 15) has only 225 points, Lean verifies by exhaustive computation over all 225 pairs that (2, 13) is the only point satisfying y+4x = 6 and avoiding the forbidden values for the other three forms.

    lines 1–6

    private theorem good_slopes_fiber15_force_six : ∀ p : ZMod 15 × ZMod 15,
        good_slopes_fiber15_form 4 p = 6 →
        good_slopes_fiber15_form 7 p ≠ 0 → good_slopes_fiber15_form 7 p ≠ 6 →
        good_slopes_fiber15_form 13 p ≠ 0 → good_slopes_fiber15_form 13 p ≠ 12 →
        good_slopes_fiber15_form 11 p ≠ 0 → good_slopes_fiber15_form 11 p ≠ 10 →
        p = (2, 13) := by decide
  2. Any point p satisfying the linear conditions is uniquely forced to be (14, 1). automation

    Similarly, exhaustive computation over all 225 pairs verifies that (14, 1) is the unique point with y+4x = 12 that avoids the specified values for the other forms.

    lines 8–13

    private theorem good_slopes_fiber15_force_twelve : ∀ p : ZMod 15 × ZMod 15,
        good_slopes_fiber15_form 4 p = 12 →
        good_slopes_fiber15_form 7 p ≠ 0 → good_slopes_fiber15_form 7 p ≠ 6 →
        good_slopes_fiber15_form 13 p ≠ 0 → good_slopes_fiber15_form 13 p ≠ 12 →
        good_slopes_fiber15_form 11 p ≠ 0 → good_slopes_fiber15_form 11 p ≠ 10 →
        p = (14, 1) := by decide
  3. There exist points p, q in S such that y+4x takes value 6 at p and value 12 at q.

    By the surjectivity of y+4x on S (hypothesis h4), there exist points p in S mapping to 6 and q in S mapping to 12.

    lines 21–22

      obtain ⟨p, hp, hp4⟩ := h4 6
      obtain ⟨q, hq, hq4⟩ := h4 12
  4. Neither p nor q can be (0, 0) or (1, 14). automation

    Evaluating y+4x at (0, 0) gives 0, and at (1, 14) gives 14 + 4 = 18 = 3 modulo 15. Since y+4x evaluates to 6 at p and 12 at q, neither point can coincide with (0, 0) or (1, 14).

    lines 23–30

      have p0 : p ≠ (0, 0) := by
        intro h; subst p; revert hp4; decide
      have p1 : p ≠ (1, 14) := by
        intro h; subst p; revert hp4; decide
      have q0 : q ≠ (0, 0) := by
        intro h; subst q; revert hq4; decide
      have q1 : q ≠ (1, 14) := by
        intro h; subst q; revert hq4; decide
  5. The values of y+7x, y+13x, and y+11x at p avoid the values of these forms at (0, 0) and (1, 14).

    Since p is distinct from (0, 0) and (1, 14), and all three points belong to S, injectivity of y+7x (h7), y+13x (h13), and y+11x (h11) on S prevents the forms from taking the values they achieve at (0, 0) or (1, 14). Specifically, the form values at (0, 0) are 0 for all forms, and at (1, 14) they are 6 for y+7x, 12 for y+13x, and 10 for y+11x.

    lines 31–42

      have hp7a : good_slopes_fiber15_form 7 p ≠ 0 := by
        intro h; apply p0; apply h7 hp h0; simpa [good_slopes_fiber15_form] using h
      have hp7b : good_slopes_fiber15_form 7 p ≠ 6 := by
        intro h; apply p1; apply h7 hp h1; simpa only [show good_slopes_fiber15_form 7 (1, 14) = 6 by decide] using h
      have hp13a : good_slopes_fiber15_form 13 p ≠ 0 := by
        intro h; apply p0; apply h13 hp h0; simpa [good_slopes_fiber15_form] using h
      have hp13b : good_slopes_fiber15_form 13 p ≠ 12 := by
        intro h; apply p1; apply h13 hp h1; simpa only [show good_slopes_fiber15_form 13 (1, 14) = 12 by decide] using h
      have hp11a : good_slopes_fiber15_form 11 p ≠ 0 := by
        intro h; apply p0; apply h11 hp h0; simpa [good_slopes_fiber15_form] using h
      have hp11b : good_slopes_fiber15_form 11 p ≠ 10 := by
        intro h; apply p1; apply h11 hp h1; simpa only [show good_slopes_fiber15_form 11 (1, 14) = 10 by decide] using h
  6. The values of y+7x, y+13x, and y+11x at q also avoid the values achieved at (0, 0) and (1, 14).

    By the identical argument using q instead of p, since q is distinct from (0, 0) and (1, 14), injectivity of the three forms ensures that their values at q cannot be 0 or 6 for y+7x, 0 or 12 for y+13x, and 0 or 10 for y+11x.

    lines 43–54

      have hq7a : good_slopes_fiber15_form 7 q ≠ 0 := by
        intro h; apply q0; apply h7 hq h0; simpa [good_slopes_fiber15_form] using h
      have hq7b : good_slopes_fiber15_form 7 q ≠ 6 := by
        intro h; apply q1; apply h7 hq h1; simpa only [show good_slopes_fiber15_form 7 (1, 14) = 6 by decide] using h
      have hq13a : good_slopes_fiber15_form 13 q ≠ 0 := by
        intro h; apply q0; apply h13 hq h0; simpa [good_slopes_fiber15_form] using h
      have hq13b : good_slopes_fiber15_form 13 q ≠ 12 := by
        intro h; apply q1; apply h13 hq h1; simpa only [show good_slopes_fiber15_form 13 (1, 14) = 12 by decide] using h
      have hq11a : good_slopes_fiber15_form 11 q ≠ 0 := by
        intro h; apply q0; apply h11 hq h0; simpa [good_slopes_fiber15_form] using h
      have hq11b : good_slopes_fiber15_form 11 q ≠ 10 := by
        intro h; apply q1; apply h11 hq h1; simpa only [show good_slopes_fiber15_form 11 (1, 14) = 10 by decide] using h
  7. The points p and q are forced to be (2, 13) and (14, 1) respectively.

    Applying the uniqueness lemma good_slopes_fiber15_force_six to p using the established conditions yields p = (2, 13). Applying good_slopes_fiber15_force_twelve to q yields q = (14, 1).

    lines 55–56

    uses good_slopes_fiber15_force_six, good_slopes_fiber15_force_twelve

      have hpf := good_slopes_fiber15_force_six p hp4 hp7a hp7b hp13a hp13b hp11a hp11b
      have hqf := good_slopes_fiber15_force_twelve q hq4 hq7a hq7b hq13a hq13b hq11a hq11b
  8. A contradiction arises because y+11x takes the same value at p and q. automation

    Direct calculation shows that (y+11x)(2, 13) = 13 + 22 = 35 = 5 modulo 15 and (y+11x)(14, 1) = 1 + 154 = 155 = 5 modulo 15, so the form y+11x takes the same value at p and q. By the injectivity of y+11x on S (h11), this requires p = q. But p = (2, 13) and q = (14, 1) are distinct, which is impossible.

    lines 57–62

      have heq : good_slopes_fiber15_form 11 p = good_slopes_fiber15_form 11 q := by
        rw [hpf, hqf]; decide
      have hpq := h11 hp hq heq
      rw [hpf, hqf] at hpq
      revert hpq
      decide
good_slopes_fiber15_force_six
Any point p modulo 15 with y+4x = 6, y+7x not in {0,6}, y+13x not in {0,12}, and y+11x not in {0,10} must be (2, 13).
good_slopes_fiber15_force_twelve
Any point p modulo 15 with y+4x = 12, y+7x not in {0,6}, y+13x not in {0,12}, and y+11x not in {0,10} must be (14, 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

private theorem good_slopes_fiber15_force_six : ∀ p : ZMod 15 × ZMod 15,    good_slopes_fiber15_form 4 p = 6 →    good_slopes_fiber15_form 7 p ≠ 0 → good_slopes_fiber15_form 7 p ≠ 6 →    good_slopes_fiber15_form 13 p ≠ 0 → good_slopes_fiber15_form 13 p ≠ 12 →    good_slopes_fiber15_form 11 p ≠ 0 → good_slopes_fiber15_form 11 p ≠ 10 →    p = (2, 13) := by decideprivate theorem good_slopes_fiber15_force_twelve : ∀ p : ZMod 15 × ZMod 15,    good_slopes_fiber15_form 4 p = 12 →    good_slopes_fiber15_form 7 p ≠ 0 → good_slopes_fiber15_form 7 p ≠ 6 →    good_slopes_fiber15_form 13 p ≠ 0 → good_slopes_fiber15_form 13 p ≠ 12 →    good_slopes_fiber15_form 11 p ≠ 0 → good_slopes_fiber15_form 11 p ≠ 10 →    p = (14, 1) := by decidetheorem good_slopes_fiber15_anchored_rigidity (S : Set (ZMod 15 × ZMod 15))    (h0 : (0, 0) ∈ S) (h1 : (1, 14) ∈ S)    (h4 : ∀ t, ∃ p ∈ S, good_slopes_fiber15_form 4 p = t)    (h7 : Set.InjOn (good_slopes_fiber15_form 7) S)    (h11 : Set.InjOn (good_slopes_fiber15_form 11) S)    (h13 : Set.InjOn (good_slopes_fiber15_form 13) S) : False := by  obtain ⟨p, hp, hp4⟩ := h4 6  obtain ⟨q, hq, hq4⟩ := h4 12  have p0 : p ≠ (0, 0) := by    intro h; subst p; revert hp4; decide  have p1 : p ≠ (1, 14) := by    intro h; subst p; revert hp4; decide  have q0 : q ≠ (0, 0) := by    intro h; subst q; revert hq4; decide  have q1 : q ≠ (1, 14) := by    intro h; subst q; revert hq4; decide  have hp7a : good_slopes_fiber15_form 7 p ≠ 0 := by    intro h; apply p0; apply h7 hp h0; simpa [good_slopes_fiber15_form] using h  have hp7b : good_slopes_fiber15_form 7 p ≠ 6 := by    intro h; apply p1; apply h7 hp h1; simpa only [show good_slopes_fiber15_form 7 (1, 14) = 6 by decide] using h  have hp13a : good_slopes_fiber15_form 13 p ≠ 0 := by    intro h; apply p0; apply h13 hp h0; simpa [good_slopes_fiber15_form] using h  have hp13b : good_slopes_fiber15_form 13 p ≠ 12 := by    intro h; apply p1; apply h13 hp h1; simpa only [show good_slopes_fiber15_form 13 (1, 14) = 12 by decide] using h  have hp11a : good_slopes_fiber15_form 11 p ≠ 0 := by    intro h; apply p0; apply h11 hp h0; simpa [good_slopes_fiber15_form] using h  have hp11b : good_slopes_fiber15_form 11 p ≠ 10 := by    intro h; apply p1; apply h11 hp h1; simpa only [show good_slopes_fiber15_form 11 (1, 14) = 10 by decide] using h  have hq7a : good_slopes_fiber15_form 7 q ≠ 0 := by    intro h; apply q0; apply h7 hq h0; simpa [good_slopes_fiber15_form] using h  have hq7b : good_slopes_fiber15_form 7 q ≠ 6 := by    intro h; apply q1; apply h7 hq h1; simpa only [show good_slopes_fiber15_form 7 (1, 14) = 6 by decide] using h  have hq13a : good_slopes_fiber15_form 13 q ≠ 0 := by    intro h; apply q0; apply h13 hq h0; simpa [good_slopes_fiber15_form] using h  have hq13b : good_slopes_fiber15_form 13 q ≠ 12 := by    intro h; apply q1; apply h13 hq h1; simpa only [show good_slopes_fiber15_form 13 (1, 14) = 12 by decide] using h  have hq11a : good_slopes_fiber15_form 11 q ≠ 0 := by    intro h; apply q0; apply h11 hq h0; simpa [good_slopes_fiber15_form] using h  have hq11b : good_slopes_fiber15_form 11 q ≠ 10 := by    intro h; apply q1; apply h11 hq h1; simpa only [show good_slopes_fiber15_form 11 (1, 14) = 10 by decide] using h  have hpf := good_slopes_fiber15_force_six p hp4 hp7a hp7b hp13a hp13b hp11a hp11b  have hqf := good_slopes_fiber15_force_twelve q hq4 hq7a hq7b hq13a hq13b hq11a hq11b  have heq : good_slopes_fiber15_form 11 p = good_slopes_fiber15_form 11 q := by    rw [hpf, hqf]; decide  have hpq := h11 hp hq heq  rw [hpf, hqf] at hpq  revert hpq  decide
See it in the graphDiscuss this resultChallenge it