Theorems · Definition · combinatorics
Quiver.Costar
{U : Type u_1} → [Quiver U] → U → Type (max u_1 u)The Quiver.Costar at a vertex is the collection of arrows whose target is the vertex.
The type Quiver.Costar v is defined to be Σ (u : U), (u ⟶ v).
- Defined in
- Mathlib.Combinatorics.Quiver.Covering
- Cited by
- 19 results in Mathlib
- Foundations
- Depth 2 from the axioms · uses no axioms
- Assumes
- Quiver
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
- Quiver.Homproof · cited by 32,603
- Quiverstatement and proof · cited by 405
Cited by27
Results whose statement or proof uses this declaration.
- Prefunctor.costarstatement and proof · cited by 14
- Quiver.starEquivCostarstatement and proof · cited by 8
- Quiver.Costar.mkstatement · cited by 6
- Quiver.SchreierGraph.labellingCostarEquivstatement and proof · cited by 4
- Prefunctor.IsCovering.costar_bijectivestatement · cited by 4
- Prefunctor.bijective_costar_iff_bijective_starstatement and proof · cited by 2
- Quiver.symmetrifyCostarstatement · cited by 2
- Quiver.symmetrifyStarstatement · cited by 2
- Prefunctor.costar_conj_starstatement and proof · cited by 1
- Prefunctor.symmetrifyCostarstatement and proof · cited by 1
- Prefunctor.symmetrifyStarstatement · cited by 1
- Quiver.SchreierGraph.labellingCostarEquiv_applystatement and proof · cited by 0