walkLengthENN
def
The length of a walk represented as a list of edges p : List E under edge-length function ℓ : E → ENNReal, defined as (p.map ℓ).sum.
Statement
def walkLengthENN {E : Type*} (ℓ : E → ENNReal) (p : List E) : ENNReal
- Defined in
- arXiv:2611.12330 Section 2
- Verified
- 13 Nov 2026
- Axioms
- none listed
- Used by 1
- directedDistENNThe shortest path distance directedDistENN G ℓ u v from vertex u to vertex v in a directed multigraph G with edge lengths ℓ : E → ENNReal,…
Read back from the Lean
For any type E, given a function ℓ : E → ENNReal and a list p : List E, walkLengthENN ℓ p is defined as the sum of the list obtained by applying ℓ to each element of p (that is, (p.map ℓ).sum).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- The length of an edge list under edge lengths in ENNReal. -/ def walkLengthENN {E : Type*} (ℓ : E → ENNReal) (p : List E) : ENNReal := (p.map ℓ).sum