Reduced walks and odd torsion
DefinitionAbelianTargets260939824ReducedWalksLet be a simple graph. On graph walks with fixed endpoints, reduced homotopy is the equivalence relation generated by deleting a spur and deleting a closed walk of length four, with these relations compatible with concatenation. Repeated vertices and edges are allowed. A closed walk based at has power equal to the constant walk, and equal to concatenated with .
The odd-involution condition means that an odd closed walk exists with reduced-homotopic to the constant walk. The odd-torsion condition means that an odd closed walk and an integer exist with reduced-homotopic to the constant walk. These express the respective hypotheses of Theorem 1.4 and Proposition 7.1 without introducing a quotient-group axiom.
import Mathlib.Combinatorics.SimpleGraph.Walk.Maps
import Mathlib.Algebra.Ring.Parity
/-!
The reduced walk presentation used by arXiv:2609.39824v1, Section 2.2.
Spurs and closed walks of length four are trivial. Closure under
equivalence and concatenation gives the reduced homotopy relation.
The target hypotheses are expressed using genuine graph walks, without
postulating any quotient-group theorem or any result from the target paper.
-/
set_option autoImplicit false
namespace AbelianTargets
universe v
variable {V : Type v} (H : SimpleGraph V)
/-- Reduced homotopy generated by spur deletion, four-walk deletion,
equivalence, and concatenation. -/
inductive ReducedHomotopic : {a b : V} → H.Walk a b → H.Walk a b → Prop
| refl {a b : V} (p : H.Walk a b) : ReducedHomotopic p p
| symm {a b : V} {p q : H.Walk a b} :
ReducedHomotopic p q → ReducedHomotopic q p
| trans {a b : V} {p q r : H.Walk a b} :
ReducedHomotopic p q → ReducedHomotopic q r → ReducedHomotopic p r
| append {a b c : V} {p q : H.Walk a b} {r s : H.Walk b c} :
ReducedHomotopic p q → ReducedHomotopic r s →
ReducedHomotopic (p.append r) (q.append s)
| spur {a b : V} (h : H.Adj a b) :
ReducedHomotopic (.cons h (.cons h.symm .nil)) .nil
| four {a : V} (p : H.Walk a a) (hp : p.length = 4) :
ReducedHomotopic p .nil
/-- Concatenation of `n` copies of a based closed walk. -/
def loopPower {b : V} (γ : H.Walk b b) : ℕ → H.Walk b b
| 0 => .nil
| n + 1 => γ.append (loopPower γ n)
/-- The odd order-two hypothesis of Theorem 1.4. The walk is closed and
has odd length, and its square represents the reduced identity. -/
def HasOddInvolution (H : SimpleGraph V) : Prop :=
∃ b : V, ∃ γ : H.Walk b b, Odd γ.length ∧
ReducedHomotopic H (loopPower H γ 2) .nil
/-- The odd finite-order hypothesis of Proposition 7.1. Positivity of
the trivializing exponent excludes the vacuous zero-th power. -/
def HasOddTorsion (H : SimpleGraph V) : Prop :=
∃ b : V, ∃ γ : H.Walk b b, Odd γ.length ∧
∃ N : ℕ, 0 < N ∧ ReducedHomotopic H (loopPower H γ N) .nil
end AbelianTargets
Read-back
What the Lean code literally says, in plain math · Codex blind auditor sub-agent (inherited model; exact deployment ID not exposed)
For any type in any universe and any simple graph on , define to be the smallest relation comparing graph walks with the same initial and final vertices that satisfies the following rules for all relevant vertices and walks: every walk is related to itself; relatedness is symmetric and transitive; whenever run from to , run from to , , and , the concatenation of with is related to the concatenation of with ; for every adjacent pair , the walk is related to the empty walk at ; and for every vertex and every closed walk at whose length is exactly , that walk is related to the empty walk at . The length-four rule does not require distinct vertices or edges. For every vertex , every closed walk at , and every natural number , define as the empty walk at , and define as concatenated with . The odd-involution property of means that there exist a vertex and a closed walk at such that the natural number giving its length is odd and , where denotes the empty walk at . The odd-torsion property means that there exist a vertex , a closed walk at of odd length, and a natural number such that . No minimality or separate parity condition is imposed on , and is explicitly excluded. Odd length excludes the empty walk; an empty vertex type, or a graph with no odd closed walks, cannot satisfy either existential property.
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.