Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Uniqueness and vertex lists of presentation-word paths

Definition
AT260939824_WordPathHelpers

by username · Oct 19, 2026 · Mathlib c5ea003 (Lean v4.30.0)

arxiv-2609-39824-positive

For the presentation graph with base m∈Nm\in\mathbb Nm∈N, a fixed letter and starting vertex determine at most one endpoint. Consequently a word www and initial vertex determine both the endpoint and full vertex list of any word path realizing www. For such a path PPP,

∣vertices⁡(P)∣=∣w∣+1,|\operatorname{vertices}(P)|=|w|+1,∣vertices(P)∣=∣w∣+1,

so the vertex list is nonempty. If PPP and QQQ are composable word paths, then

vertices⁡(P∗Q)=dropLast⁡(vertices⁡(P)) + ⁣ ⁣+ vertices⁡(Q).\operatorname{vertices}(P*Q)= \operatorname{dropLast}(\operatorname{vertices}(P))\,\mathbin{+\!\!+}\, \operatorname{vertices}(Q).vertices(P∗Q)=dropLast(vertices(P))++vertices(Q).

This concatenation formula includes the common endpoint once and is used to move between word deformations and finite vertex rows.

Definition code
import Definitions.Def_AT260939824_CompressedWords
import Definitions.Def_AT260939824_DigitPathRealization
import Definitions.Def_AT260939824_IntervalCarriers
import Init
import Lean.Elab.Tactic.Omega
import Mathlib.Algebra.BigOperators.Group.List.Basic
import Mathlib.Algebra.Group.Conj
import Mathlib.Combinatorics.SimpleGraph.Maps
import Mathlib.Combinatorics.SimpleGraph.Walk.Maps
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Int.Interval
import Mathlib.Data.List.Basic
import Mathlib.Data.Nat.Log
import Mathlib.Tactic.Positivity
import Mathlib.Tactic.Ring

set_option autoImplicit false

/-!
# Determinism and exact vertex rows of directed carrier word paths

The elementary directed steps determine their endpoint. Consequently an
edge word has a unique literal vertex row from a specified start, and
concatenation removes exactly one copy of the shared endpoint.
-/

namespace AbelianTargets.IntervalCarriers

theorem LetterStep.unique {m : ℕ} {s : BSLetter} {x y z : Vertex}
    (h : LetterStep m s x y) (h' : LetterStep m s x z) : y = z := by
  cases s with
  | a => exact h.trans h'.symm
  | t => exact h.trans h'.symm
  | tInv =>
      have hy₁ := congrArg Prod.fst h
      have hy₂ := congrArg Prod.snd h
      have hz₁ := congrArg Prod.fst h'
      have hz₂ := congrArg Prod.snd h'
      apply Prod.ext <;> dsimp [LetterStep,VerticalStep] at * <;> omega

theorem WordPath.endpoint_eq {m : ℕ} {x y z : Vertex} {w : List BSLetter}
    (p : WordPath m x w y) (q : WordPath m x w z) : y = z := by
  induction p generalizing z with
  | nil x => cases q; rfl
  | @cons s x u y w h p ih =>
      cases q with
      | @cons _ _ v _ _ h' q =>
          have huv := h.unique h'
          subst v
          exact ih q

theorem WordPath.vertices_eq {m : ℕ} {x y z : Vertex} {w : List BSLetter}
    (p : WordPath m x w y) (q : WordPath m x w z) : p.vertices = q.vertices := by
  induction p generalizing z with
  | nil x => cases q; rfl
  | @cons s x u y w h p ih =>
      cases q with
      | @cons _ _ v _ _ h' q =>
          have huv := h.unique h'
          subst v
          simp only [WordPath.vertices]
          exact congrArg (List.cons x) (ih q)

@[simp] theorem WordPath.vertices_length {m : ℕ} {x y : Vertex} {w : List BSLetter}
    (p : WordPath m x w y) : p.vertices.length = w.length+1 := by
  induction p with
  | nil x => rfl
  | cons h p ih => simp only [WordPath.vertices,List.length_cons,ih]

theorem WordPath.vertices_ne_nil {m : ℕ} {x y : Vertex} {w : List BSLetter}
    (p : WordPath m x w y) : p.vertices ≠ [] := by
  intro h
  have hh := p.vertices_length
  rw [h] at hh
  simp only [List.length_nil] at hh
  omega

@[simp] theorem WordPath.vertices_append {m : ℕ} {x y z : Vertex} {w u : List BSLetter}
    (p : WordPath m x w y) (q : WordPath m y u z) :
    (p.append q).vertices = p.vertices.dropLast ++ q.vertices := by
  induction p with
  | nil x => rfl
  | @cons s x v y w h p ih =>
      simp only [WordPath.append,WordPath.vertices,ih]
      rw [List.dropLast_cons_of_ne_nil p.vertices_ne_nil,List.cons_append]

end AbelianTargets.IntervalCarriers
Source
Ruijun Wang, Continuous graph homomorphisms of higher dimensional abelian group actions, arXiv:2609.39824v1 (30 September 2026), Sections 2–7, supporting construction for Theorem 1.4 and Proposition 7.1; https://arxiv.org/html/2609.39824v1. Formalization-specific infrastructure in the import closure; individual helper assertions are not represented as separately numbered paper theorems. Original Lean module AbelianTargets/WordPathHelpers.lean, selected declaration lines 13-23, 25-34, 36-46, 48-52, 54-60, 62-69; SHA-256 f0af8ece0b3d3ac110e16e5f257352425bfdde6cc5426e2fb9a621878b5bc909. Selected spans are from the final generated manifest. The original source snapshot is local; no public repository URL or commit was available.

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