good_slopes_refl_three
The identity permutation of ℤ/3ℤ has exactly 2 good slopes: (good_slopes 3 (Equiv.refl (ZMod 3))).card = 2.
Statement
theorem good_slopes_refl_three : (good_slopes 3 (Equiv.refl (ZMod 3))).card = 2- Source
- arXiv:2611.04551 Section 2
- Verified
- 05 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 1
- good_slopesGiven a natural number n with n ≠ 0 (via [NeZero n]) and a permutation f of ℤ/nℤ, good_slopes n f is the finite set (Finset) of elements m…
Read back from the Lean
The set of good_slopes for $n = 3$ with respect to the identity permutation on $\mathbb{Z}/3\mathbb{Z}$ has cardinality 2.
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
The identity permutation on $\mathbb{Z}/3\mathbb{Z}$ induces the linear map $x \mapsto (1 + m)x$ for each slope $m \in \mathbb{Z}/3\mathbb{Z}$. This map is bijective precisely when $1 + m \not\equiv 0 \pmod 3$, which leaves $m = 0$ and $m = 1$. Because the domain is finite, the property is decidable, and the proof proceeds by exhaustive computation via `decide`.
The set of good slopes for the identity permutation on ℤ/3ℤ has cardinality 2. automation
A slope $m \in \mathbb{Z}/3\mathbb{Z}$ is good for the identity permutation if the map $x \mapsto x + m \cdot x = (1 + m)x$ is bijective. Since $\mathbb{Z}/3\mathbb{Z}$ has only 3 elements, bijectivity can be determined by testing all elements for each of $m \in \{0, 1, 2\}$. The map is bijective for $m = 0$ (the identity map) and $m = 1$ ($x \mapsto 2x$), but not for $m = 2$ ($x \mapsto 3x = 0$). The `decide` tactic checks these finite cases computationally and establishes that exactly 2 slopes are good.
theorem good_slopes_refl_three : (good_slopes 3 (Equiv.refl (ZMod 3))).card = 2 := by decide
- The proof is performed entirely by Lean's computational reflection (`decide`), which evaluates the finite set operations and bijectivity tests by direct computation in the kernel.
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
Choose a tactic — a marked line — to see the goals Lean had before and after it, as in Lean’s infoview. Step with ← → or j k.
/-- The identity permutation on ZMod 3 has exactly 2 good slopes. -/theorem good_slopes_refl_three : (good_slopes 3 (Equiv.refl (ZMod 3))).card = 2 := by decide