Wide subquivers

A wide subquiver H of a quiver H consists of a subset of the edge set a ⟶ b for every pair of vertices a b : V. We include 'wide' in the name to emphasize that these subquivers by definition contain all vertices.

def WideSubquiver (V : Type u_1) [Quiver V] : Type (max u_1 v)

A wide subquiver H of G picks out a set H a b of arrows from a to b for every pair of vertices a b.

Equations

• WideSubquiver V = ((a b : V) → Set (a ⟶ b))

def WideSubquiver.toType (V : Type u) [Quiver V] : WideSubquiver V → Type u

A type synonym for V, when thought of as a quiver having only the arrows from some WideSubquiver.

Equations

• WideSubquiver.toType V x✝ = V

@[implicit_reducible]

instance wideSubquiverHasCoeToSort {V : Type u} [Quiver V] : CoeSort (WideSubquiver V) (Type u)

Equations

• wideSubquiverHasCoeToSort = { coe := fun (H : WideSubquiver V) => WideSubquiver.toType V H }

@[implicit_reducible]

instance WideSubquiver.quiver {V : Type u_1} [Quiver V] (H : WideSubquiver V) : Quiver (toType V H)

A wide subquiver viewed as a quiver on its own.

Equations

• H.quiver = { Hom := fun (a b : WideSubquiver.toType V H) => { f : a ⟶ b // f ∈ H a b } }

@[implicit_reducible]

instance Quiver.instBotWideSubquiver {V : Type u_1} [Quiver V] : Bot (WideSubquiver V)

Equations

• Quiver.instBotWideSubquiver = { bot := fun (x x_1 : V) => ∅ }

@[implicit_reducible]

instance Quiver.instTopWideSubquiver {V : Type u_1} [Quiver V] : Top (WideSubquiver V)

Equations

• Quiver.instTopWideSubquiver = { top := fun (x x_1 : V) => Set.univ }

@[implicit_reducible]

noncomputable instance Quiver.instInhabitedWideSubquiver {V : Type u_1} [Quiver V] : Inhabited (WideSubquiver V)

Equations

• Quiver.instInhabitedWideSubquiver = { default := ⊤ }

structure Quiver.Total (V : Type u) [Quiver V] : Type (max u v)

Total V is the type of all arrows of V.

• left : V

  the source vertex of an arrow

• right : V

  the target vertex of an arrow

• hom : self.left ⟶ self.right

  an arrow

theorem Quiver.Total.ext_iff {V : Type u} {inst✝ : Quiver V} {x y : Total V} : x = y ↔ x.left = y.left ∧ x.right = y.right ∧ x.hom ≍ y.hom

theorem Quiver.Total.ext {V : Type u} {inst✝ : Quiver V} {x y : Total V} (left : x.left = y.left) (right : x.right = y.right) (hom : x.hom ≍ y.hom) : x = y

def Quiver.wideSubquiverEquivSetTotal {V : Type u_1} [Quiver V] : WideSubquiver V ≃ Set (Total V)

A wide subquiver of G can equivalently be viewed as a total set of arrows.

Equations

• One or more equations did not get rendered due to their size.

def Quiver.Labelling (V : Type u) [Quiver V] (L : Sort u_1) : Sort (imax (u + 1) (u + 1) (u_2 + 1) u_1)

An L-labelling of a quiver assigns to every arrow an element of L.

Equations

• Quiver.Labelling V L = (⦃a b : V⦄ → (a ⟶ b) → L)

@[implicit_reducible]

instance Quiver.instInhabitedLabelling {V : Type u} [Quiver V] (L : Sort u_2) [Inhabited L] : Inhabited (Labelling V L)

Equations

• Quiver.instInhabitedLabelling L = { default := fun (x x_1 : V) (x_2 : x ⟶ x_1) => default }