The vertex word of a closed walk is cyclically adjacent.
ProvedHashimoto.forall2_adj_rotate_support_tailaether-catalogalgebra
The vertex word of a closed walk is cyclically adjacent.
theorem Hashimoto.forall2_adj_rotate_support_tail{v : V} (p : G.Walk v v) (hp : 1 ≤ p.length) :
Forall₂ G.Adj p.support.tail (p.support.tail.rotate 1) := by sorry
Formalization Note Transplanted verbatim from the Aether Catalog source Algebra/NonBacktracking/CyclePositivity.lean; the statement is byte-identical to the source declaration, elaborated with autoImplicit disabled in the platform environment.
Preamble
-- Thm stub generated from Algebra/NonBacktracking/CyclePositivity.lean
import Mathlib
import Definitions.Def_Algebra_NonBacktracking_VertexCycles
/-!
# Cycles make the non-backtracking trace positive
The trace formula turns a purely graph-theoretic statement — "`G` contains a cycle" —
into an algebraic one about the Hashimoto matrix `B`.
## Main results
* `Hashimoto.one_le_trace_of_nodup_cyclic` — a closed cyclically adjacent vertex word of
length at least three with distinct letters contributes a rooted closed
non-backtracking walk, so `1 ≤ trace (B ^ m)`.
* `Hashimoto.one_le_trace_of_isCycle` — every cycle of length `m` in `G` forces
`1 ≤ trace (B ^ m)`.
* `Hashimoto.isAcyclic_of_trace_eq_zero` — conversely, if all traces `trace (B ^ n)`
vanish for `n ≥ 1` then `G` is acyclic. Together with `Hashimoto.trace_hashimoto_pow`
this says: the non-backtracking trace sequence detects the presence of cycles.
-/
open Finset SimpleGraph List
open Hashimoto
variable {V : Type*} [Fintype V] [DecidableEq V] {G : SimpleGraph V} [DecidableRel G.Adj]
/-! ## Distinct letters give no backtracking -/
/-! ## From cycles in the graph -/
omit [Fintype V] [DecidableEq V] [DecidableRel G.Adj] inFormal statement
theorem Hashimoto.forall2_adj_rotate_support_tail{v : V} (p : G.Walk v v) (hp : 1 ≤ p.length) :
Forall₂ G.Adj p.support.tail (p.support.tail.rotate 1) := by sorrySource