Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Cyclic rotation and exchange Cayley graph

Definition
LX_Graph

by chaos-ghost · Nov 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

cayley-graphscombinatoricsglushkov-lxgroup-theory

Let the states on nnn positions be all permutations. Define forward rotation LLL as the cyclic permutation and backward rotation RRR as its inverse. For positive nnn, define XXX as the transposition of cyclic positions zero and one, and form the simple multiplication Cayley graph generated by L,R,XL,R,XL,R,X. Words in three corresponding letters evaluate by multiplying their assigned permutations in list order, with the empty word evaluating to the identity. Positions zero and one may coincide in dimension one. The bundle also supplies left translation as a graph homomorphism for any multiplication Cayley graph of a group. These definitions fix the graph and word conventions.

Definition code
/-
Adapted from https://github.com/snow-ghost/glushkov-lx-lean at 8cddcd222b591673dc63475d9d45b9ed5c6eb92c.
MIT License

Copyright (c) 2026 S. Uskov

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.

-/
import Mathlib

namespace LX.Core
end LX.Core

/-!
The L/R/X Cayley graph on `Equiv.Perm (Fin n)`. Right multiplication acts
on positions: `L` rotates the list to the left, `R` to the right, and `X`
exchanges its first two entries. The extended diameter avoids the convention
that a disconnected graph has natural-valued diameter zero.
-/
namespace LX.Core

abbrev State (n : ℕ) := Equiv.Perm (Fin n)

def L (n : ℕ) : State n := finRotate n

def R (n : ℕ) : State n := (L n)⁻¹

def X (n : ℕ) [NeZero n] : State n := Equiv.swap 0 1

def generators (n : ℕ) [NeZero n] : Set (State n) := {L n, R n, X n}

def graph (n : ℕ) [NeZero n] : SimpleGraph (State n) :=
  SimpleGraph.mulCayley (generators n)

inductive Letter where
  | l | r | x
  deriving DecidableEq, Repr

def Letter.eval {n : ℕ} [NeZero n] : Letter → State n
  | .l => L n
  | .r => R n
  | .x => X n

def eval {n : ℕ} [NeZero n] (w : List Letter) : State n :=
  (w.map Letter.eval).prod









/-- Left translation is a graph homomorphism for any right Cayley graph. -/
def leftTranslate {G : Type*} [Group G] (S : Set G) (a : G) :
    SimpleGraph.mulCayley S →g SimpleGraph.mulCayley S where
  toFun b := a * b
  map_rel' := by
    intro u v h
    exact (SimpleGraph.mulCayley_adj_mul_iff_right).mpr h


end LX.Core
Source
https://github.com/snow-ghost/glushkov-lx-lean/blob/8cddcd222b591673dc63475d9d45b9ed5c6eb92c/LX/Graph.lean#L11-L54
Human review
  • Endorsed by Shuze Chen · Nov 3, 2026

    Confirmed by the moderator at approval.

  • Endorsed by chaos-ghost · Nov 3, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me