good_slopes
def
Given 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 ∈ ℤ/nℤ such that x ↦ f(x) + mx is bijective (Function.Bijective).
Statement
def good_slopes (n : ℕ) [NeZero n] (f : Equiv.Perm (ZMod n)) : Finset (ZMod n)- Defined in
- arXiv:2611.04551 Section 2
- Verified
- 04 Nov 2026
- Axioms
- none listed
- Used by 13
- good_slopes_gap_tight_mod_45There exists a non-extremal permutation f of ℤ/45ℤ with exactly 18 good slopes, demonstrating that the gap bound φ(45)(q - 2)/(q - 1) = 18…
- 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_missing_prime_squarefreeLet n be squarefree and nonzero, let the prime p divide n, and let f be a permutation modulo n. Then some residue modulo p is missed by…
- good_slopes_gap_mod_105Every non-extremal permutation f of ℤ/105ℤ satisfies |D_{105}(f)| ≤ 40: (good_slopes 105 f).card ≤ 40.
- is_extremal_permGiven n with [NeZero n], a permutation f of ℤ/nℤ is extremal if the number of its good slopes (the cardinality of good_slopes n f) equals…
- good_slopes_missing_prime105For a permutation modulo 105 and each prime divisor p, some residue modulo p is not attained by any good slope.
- good_slopes_refl_threeThe identity permutation of ℤ/3ℤ has exactly 2 good slopes: (good_slopes 3 (Equiv.refl (ZMod 3))).card = 2.
- 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…
- good_slopes_gap105_from_rectangleA permutation modulo 105 has at most 40 good slopes if any hypothetical excess produces a 35-point fiber with the stated rectangle and…
- good_slopes_unit_cover_mod105For every permutation modulo 105, a unit c exists such that adding c to each good slope yields a unit modulo 105.
- zero_mem_good_slopesZero 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_gap_three_coprime_from_fiber_boundsLet k be a nonzero natural number coprime to 3 and let f be a non-extremal permutation modulo 3k. Suppose there are L units modulo k and 0…
- good_slopes_gap_tight_mod_15There exists a non-extremal permutation f of ℤ/15ℤ with exactly 6 good slopes, demonstrating that the gap bound φ(15)(q - 2)/(q - 1) = 6…
Read back from the Lean
For a non-zero natural number n and a permutation f of ZMod n, good_slopes n f is the finite set of all elements m : ZMod n such that the function x ↦ f x + m * x (from ZMod n to ZMod n) is bijective.
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The finite set of good slopes m in ZMod n for a permutation f. -/ def good_slopes (n : ℕ) [NeZero n] (f : Equiv.Perm (ZMod n)) : Finset (ZMod n) := Finset.univ.filter (fun m => Function.Bijective (fun x => f x + m * x))