cycle_power_floor_map
def
The map from ZMod n to ZMod N sending a vertex u to the residue class of floor(u.val*N/n).
Statement
def cycle_power_floor_map (n N : ℕ) (u : ZMod n) : ZMod N- Source
- arXiv:2610.15635, Proposition 3.2, with induced floor embedding from Lemma 3.1 and cover restriction from Lemma 2.1. This formalizes the published upper bound serving OP-205 / RT-1; no new research result is claimed.
- Verified
- 27 Oct 2026
- Axioms
- none listed
- Used by 3
- simple_graph_equivalence_covering_number_cycle_power_large_upperFor every natural k at least one and natural n at least max(2*k+2, twice the square of k), the equivalence covering number of the k-th…
- simple_graph_has_equivalence_cover_cycle_power_large_upperFor natural k at least one and n at least max(2k+2,twice the square of k), the k-th cycle power on n vertices has an equivalence cover…
- cycle_power_floor_map_inducedFor natural n,N,k,K with n positive, N at least n, k*N at most K*n, and (K+1)*n at most (k+1)*N, the balanced floor map from ZMod n to…
Lean source view module on GitHub
open Finset set_option maxHeartbeats 1000000 set_option maxRecDepth 4000 def cycle_power_floor_map (n N : ℕ) (u : ZMod n) : ZMod N := ((u.val*N/n : ℕ) : ZMod N)