Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Physical token configurations and cursor execution

Definition
LX_PhysicalModel

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

cayley-graphscombinatoricsglushkov-lxgroup-theory

On a positive cycle, a physical configuration consists of a permutation assigning token labels to positions and a cursor position. A forward or backward rotation moves only the cursor by one cyclic step. An exchange swaps the tokens at the cursor and its successor. A word executes its letters from left to right; the empty word leaves the configuration unchanged. Initially the token permutation is the identity and the cursor is zero. The visible permutation is the physical token permutation multiplied by the forward rotation raised to the cursor representative. These definitions separate physical token motion from the visible coordinate frame.

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
import Definitions.Def_LX_Graph

namespace LX.Core
end LX.Core
namespace LX.Core.AffineLift
end LX.Core.AffineLift
namespace LX.Core.PhysicalModel
end LX.Core.PhysicalModel

/-! Physical positions, a paid cursor, and literal L/R/X words.
Every physical operation is proved to induce the same visible generator.
A realized balanced lift ends at the original target in its exact orientation. -/
namespace LX.Core.PhysicalModel
open scoped Fin.IntCast Fin.NatCast Fin.CommRing
open AffineLift

structure Configuration (n : ℕ) where
  tokens : State n
  cursor : Fin n

variable {n : ℕ} [NeZero n]

def visible (s : Configuration n) : State n := s.tokens * L n ^ s.cursor.val



def step (a : Letter) (s : Configuration n) : Configuration n :=
  match a with
  | .l => ⟨s.tokens, s.cursor + 1⟩
  | .r => ⟨s.tokens, s.cursor - 1⟩
  | .x => ⟨s.tokens * Equiv.swap s.cursor (s.cursor + 1), s.cursor⟩



def run : List Letter → Configuration n → Configuration n
  | [], s => s
  | a :: w, s => run w (step a s)



def initial : Configuration n := ⟨1, 0⟩




end LX.Core.PhysicalModel
Source
https://github.com/snow-ghost/glushkov-lx-lean/blob/8cddcd222b591673dc63475d9d45b9ed5c6eb92c/LX/PhysicalModel.lean#L11-L61

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