Theorems · Theorem · combinatorics
Quiver.SchreierGraph.labelling_isCovering
∀ {V : Type u_1} {M : Type u_2} [inst : Group M] [inst_1 : MulAction M V] {S : Type u_3} (ι : S → M),
(Quiver.SchreierGraph.labelling V ι).IsCoveringThe labelling prefunctor is a covering for Schreier graphs with group actions.
- Defined in
- Mathlib.Combinatorics.Quiver.Schreier
- Cited by
- 0 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses propext, Quot.sound
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites9
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Groupstatement and proof · cited by 6,238
- MulActionstatement and proof · cited by 1,294
- Equiv.bijectiveproof · cited by 132
- Quiver.SingleObjstatement · cited by 26
- Quiver.SchreierGraphstatement and proof · cited by 17
- Prefunctor.IsCoveringstatement · cited by 11
- Quiver.SchreierGraph.labellingstatement · cited by 6
- Quiver.SchreierGraph.labellingCostarEquivproof · cited by 4
- Quiver.SchreierGraph.labellingStarEquivproof · cited by 4
Cited by0
Results whose statement or proof uses this declaration.
Nothing cites this yet.