Theorems · Definition · combinatorics
Quiver.SchreierGraph.labelling
(V : Type u_1) →
{M : Type u_2} → [inst : SMul M V] → {S : Type u_3} → (ι : S → M) → Quiver.SchreierGraph V ι ⥤q Quiver.SingleObj SThe labelling of arrows in a Schreier graph by elements of S.
This is encoded as a prefunctor to SingleObj S.
- Defined in
- Mathlib.Combinatorics.Quiver.Schreier
- Cited by
- 6 results in Mathlib
- Foundations
- Depth 8 from the axioms · uses no axioms
- Assumes
- SMul
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites5
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Quiver.Homproof · cited by 32,603
- Prefunctorstatement · cited by 116
- Quiver.SingleObjstatement · cited by 26
- Quiver.SchreierGraphstatement and proof · cited by 17
- Quiver.SingleObj.starproof · cited by 17
Cited by8
Results whose statement or proof uses this declaration.
- Quiver.SchreierGraph.labellingCostarEquivproof · cited by 4
- Quiver.SchreierGraph.labellingStarEquivproof · cited by 4
- Quiver.SchreierGraph.labelling_mapstatement and proof · cited by 1
- Quiver.SchreierGraph.labellingCostarEquiv_applystatement · cited by 0
- Quiver.SchreierGraph.labellingStarEquiv_applystatement · cited by 0
- Quiver.SchreierGraph.labelling_isCoveringstatement · cited by 0
- Quiver.SchreierGraph.labelling_objstatement and proof · cited by 0
- Quiver.SchreierGraph.map_smul_of_comp_labelling_eqstatement and proof · cited by 0