zero_mem_good_slopes
Zero is always a good slope of every permutation of ℤ/nℤ, since x ↦ f(x) + 0·x = f(x) is a permutation; in particular D_n(f) is nonempty: (good_slopes n f).Nonempty.
Statement
theorem zero_mem_good_slopes (n : ℕ) [NeZero n] (f : Equiv.Perm (ZMod n)) : (0 : ZMod n) ∈ good_slopes n f- Source
- step towards good_slopes_gap_mod_105
- Verified
- 08 Nov 2026
- Axioms
Classical.choiceQuot.soundpropext- Built on 2
- 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…
- good_slopes_mem_iffA slope m is good for the permutation f of ℤ/nℤ exactly when x ↦ f(x) + m·x is a bijection of ℤ/nℤ: m ∈ D_n(f) ↔ Function.Bijective (fun x…
- Used by 2
- good_slopes_unit_cover_squarefreeFor every nonzero squarefree modulus and permutation, some unit can be added to all its good slopes to make them units.
- good_slopes_gap_mod_105Every non-extremal permutation f of ℤ/105ℤ satisfies |D_{105}(f)| ≤ 40: (good_slopes 105 f).card ≤ 40.
The proof, explained
By definition, an element m ∈ ℤ/nℤ belongs to good_slopes n f if and only if the map x ↦ f(x) + m · x is a bijection on ℤ/nℤ. Setting m = 0, the linear term 0 · x vanishes, leaving the map f itself. Since f is a permutation, it is already bijective, which shows that 0 is always a good slope.
The condition that 0 is in good_slopes n f reduces to the bijectivity of f.
By definition (good_slopes_mem_iff), 0 is a good slope if and only if the map x ↦ f(x) + 0 · x is bijective. Using zero_mul (0 · x = 0) and add_zero (f(x) + 0 = f(x)), this map simplifies to f itself.
uses
good_slopes_mem_iff,zero_mul,add_zerorw [good_slopes_mem_iff] simp only [zero_mul, add_zero]
The permutation f is bijective.
Since f is assumed to be a permutation of ℤ/nℤ (an element of Equiv.Perm (ZMod n)), it is bijective by definition (f.bijective).
exact f.bijective
good_slopes_mem_iff- A slope m is in good_slopes n f if and only if x ↦ f(x) + m · x is a bijection.
zero_mul- Multiplying zero by any ring element gives zero: 0 · a = 0.
add_zero- Adding zero to any element leaves it unchanged: a + 0 = 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
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.
/-- Non-vacuity witness for good_slopes: 0 is always a good slope. -/theorem zero_mem_good_slopes (n : ℕ) [NeZero n] (f : Equiv.Perm (ZMod n)) : (0 : ZMod n) ∈ good_slopes n f := by rw [good_slopes_mem_iff] simp only [zero_mul, add_zero] exact f.bijective