Theorems · Definition · group theory
IsFreeGroupoid.SpanningTree.loopOfHom
{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 b : G} → (a ⟶ b) → CategoryTheory.End (IsFreeGroupoid.SpanningTree.root'✝ T)Any hom in G can be made into a loop, by conjugating with treeHoms.
- Cited by
- 3 results in Mathlib
- Foundations
- Depth 15 from the axioms · uses Classical.choice
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites12
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Quiver.Homstatement and proof · cited by 32,603
- CategoryTheory.CategoryStruct.compproof · cited by 17,999
- CategoryTheory.invproof · cited by 467
- CategoryTheory.Groupoidstatement and proof · cited by 182
- CategoryTheory.Endstatement · cited by 169
- Quiver.Symmetrifystatement and proof · cited by 28
- IsFreeGroupoid.Generatorsstatement and proof · cited by 11
- IsFreeGroupoidstatement and proof · cited by 11
- Quiver.Arborescencestatement and proof · cited by 7
- WideSubquiver.toTypestatement and proof · cited by 7
- WideSubquiverstatement and proof · cited by 7
- IsFreeGroupoid.SpanningTree.treeHomproof · cited by 4
Cited by4
Results whose statement or proof uses this declaration.
- IsFreeGroupoid.SpanningTree.functorOfMonoidHomproof · cited by 3
- IsFreeGroupoid.SpanningTree.loopOfHom_eq_idstatement · cited by 1
- IsFreeGroupoid.SpanningTree.endIsFreeproof · cited by 0
- IsFreeGroupoid.SpanningTree.functorOfMonoidHom_mapstatement · cited by 0