Theorems · Definition · group theory
IsFreeGroupoid.SpanningTree.homOfPath
{G : Type u} →
[inst : CategoryTheory.Groupoid G] →
[inst_1 : IsFreeGroupoid G] →
(T : WideSubquiver (Quiver.Symmetrify (IsFreeGroupoid.Generators G))) →
[inst_2 : Quiver.Arborescence (WideSubquiver.toType (Quiver.Symmetrify (IsFreeGroupoid.Generators G)) T)] →
{a : G} →
Quiver.Path (Quiver.root (WideSubquiver.toType (Quiver.Symmetrify (IsFreeGroupoid.Generators G)) T)) a →
(IsFreeGroupoid.SpanningTree.root'✝ T ⟶ a)A path in the tree gives a hom, by composition.
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 12 from the axioms · uses Classical.choice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites11
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Quiver.Homstatement · cited by 32,603
- CategoryTheory.Groupoidstatement and proof · cited by 182
- Quiver.Pathstatement and proof · cited by 166
- Quiver.Symmetrifystatement and proof · cited by 28
- IsFreeGroupoid.Generatorsstatement and proof · cited by 11
- IsFreeGroupoidstatement and proof · cited by 11
- Quiver.Path.brecOnproof · cited by 10
- Quiver.Arborescencestatement and proof · cited by 7
- WideSubquiver.toTypestatement and proof · cited by 7
- WideSubquiverstatement and proof · cited by 7
- Quiver.rootstatement and proof · cited by 3
Cited by5
Results whose statement or proof uses this declaration.
- IsFreeGroupoid.SpanningTree.treeHomproof · cited by 4
- IsFreeGroupoid.SpanningTree.treeHom_eqstatement and proof · cited by 2
- IsFreeGroupoid.SpanningTree.loopOfHom_eq_idproof · cited by 1
- IsFreeGroupoid.SpanningTree.endIsFreeproof · cited by 0
- IsFreeGroupoid.SpanningTree.homOfPath.eq_defstatement and proof · cited by 0