Commit 2025-11-25 09:29 aef322b8

View on Github →

feat(Combinatorics/SimpleGraph): split Walk.lean into 5 files (#31573) Split into 5 files in a new Walks subfolder:

  • Basic.lean: basic definitions and theorems about them, without modifying the walks: Walk, Nil, length, support, darts, edges, edgeSet
  • Traversal.lean: access parts of a walk: getVert, snd, penultimate, firstDart, lastDart
  • Operations.lean: similar to the existing WalkDecomp.lean, this file defines operations on walks: copy, append, concat, reverse, drop, take, tail, dropLast. The name of the file matches SimpleGraph/Operations.lean which defines operations on graphs.
  • Maps.lean: operations that map the walk to another graph: map, mapLe, transfer, induce, toDeleteEdges, toDeleteEdge. The name of the file matches SimpleGraph/Maps.lean which defines maps on graphs.
  • Subwalks.lean: the definition of IsSubwalk and theorems about it Deprecates the original Walk.lean module.

Estimated changes

deleted inductive SimpleGraph.Walk.Nil
deleted theorem SimpleGraph.Walk.adj_snd
deleted theorem SimpleGraph.Walk.copy_nil
deleted theorem SimpleGraph.Walk.map_cons
deleted theorem SimpleGraph.Walk.map_copy
deleted theorem SimpleGraph.Walk.map_id
deleted theorem SimpleGraph.Walk.map_map
deleted theorem SimpleGraph.Walk.map_nil
deleted theorem SimpleGraph.Walk.nil_copy
deleted theorem SimpleGraph.Walk.nil_nil
deleted theorem SimpleGraph.Walk.snd_cons
deleted theorem SimpleGraph.Walk.tail_nil
deleted inductive SimpleGraph.Walk
added inductive SimpleGraph.Walk.Nil
added inductive SimpleGraph.Walk