Documentation

Mathlib.Combinatorics.Quiver.Subquiver

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
    Instances For
      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
        Instances For
          instance WideSubquiver.quiver {V : Type u_1} [Quiver V] (H : WideSubquiver V) :

          A wide subquiver viewed as a quiver on its own.

          Equations
            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

            Instances For
              theorem Quiver.Total.ext_iff {V : Type u} {instโœ : Quiver V} {x y : Total V} :
              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

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

              Equations
                Instances For
                  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
                    Instances For