Theorems · Definition · group theory
IsFreeGroupoid.SpanningTree.treeHom
{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) → IsFreeGroupoid.SpanningTree.root'✝ T ⟶ aFor every vertex a, there is a canonical hom from the root, given by the path in the tree.
- Cited by
- 4 results in Mathlib
- Foundations
- Depth 13 from the axioms · uses Classical.choice
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.
- Quiver.Homstatement · cited by 32,603
- CategoryTheory.Groupoidstatement and proof · cited by 182
- Quiver.Symmetrifystatement and proof · cited by 28
- IsFreeGroupoid.Generatorsstatement and proof · cited by 11
- IsFreeGroupoidstatement and proof · cited by 11
- WideSubquiverstatement and proof · cited by 7
- Quiver.Arborescencestatement and proof · cited by 7
- WideSubquiver.toTypestatement and proof · cited by 7
- IsFreeGroupoid.SpanningTree.homOfPathproof · cited by 4
Cited by5
Results whose statement or proof uses this declaration.
- IsFreeGroupoid.SpanningTree.loopOfHomproof · cited by 3
- IsFreeGroupoid.SpanningTree.treeHom_eqstatement · cited by 2
- IsFreeGroupoid.SpanningTree.treeHom_rootstatement · cited by 1
- IsFreeGroupoid.SpanningTree.loopOfHom_eq_idproof · cited by 1
- IsFreeGroupoid.SpanningTree.endIsFreeproof · cited by 0