Mathlib Map

Theorems · Theorem · combinatorics

Quiver.Path.weight_nil

∀ {V : Type u_1} [inst : Quiver V] {R : Type u_2} [inst_1 : Monoid R] (w : {i j : V} → (i ⟶ j) → R) (a : V),
  Quiver.Path.weight (fun {i j} => w) Quiver.Path.nil = 1
Defined in
Mathlib.Combinatorics.Quiver.Path.Weight
Cited by
4 results in Mathlib
Foundations
Depth 26 from the axioms · uses propext, Quot.sound
Assumes
QuiverMonoid
Mathlib docsSourceLoogleLeanSearch

Around this declaration

Dashed lines are statement dependencies; solid lines are citations in proofs.

Quiver.Path.weight_comp · cited by 1Path.weight_compQuiver.Path.weight_nonneg · cited by 1Path.weight_nonnegQuiver.Path.weight_pos · cited by 1Path.weight_posQuiver.Path.weightOfEPs_nil · cited by 0Path.weightOfEPs_nilQuiver.Hom · cited by 32603Quiver.HomMonoid · cited by 3887MonoidQuiver · cited by 405QuiverQuiver.Path.weight · cited by 8Path.weightPath.weight_nilCITED BYCITES

Cites4

Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.

Cited by4

Results whose statement or proof uses this declaration.