Documentation

TauCeti.RepresentationTheory.Quiver.Symmetrify

Symmetrified quivers #

This file supplies general infrastructure for Mathlib's Quiver.Symmetrify construction.

Main results #

References #

This file supplies a prerequisite for Layer 4 of TauCetiRoadmap/ZigzagPreprojective/README.md.

Typeclass search does not unfold the Symmetrify type synonym to reuse Finite Q.

@[instance_reducible]

Typeclass search does not unfold the Symmetrify type synonym to reuse DecidableEq Q.

Equations
@[instance_reducible]

Typeclass search does not unfold the Symmetrify type synonym to reuse Fintype Q.

Equations
@[instance_reducible]
instance TauCeti.instFintypeSymmetrifyHom (Q : Type u) [Quiver Q] [(i j : Q) → Fintype (i ⟶ j)] (x y : Quiver.Symmetrify Q) :
Fintype (x ⟶ y)

The arrows of the doubled quiver between two vertices are the arrows of Q in either direction, so there are finitely many whenever Q has finitely many between each pair.

Equations

The inclusion Quiver.Symmetrify.of of a quiver in its doubled quiver is the identity on vertices. Deliberately not a simp lemma: the two vertex types are definitionally equal, so rewriting Quiver.Symmetrify.of away erases the only record of which of the two quiver structures a vertex was meant to carry.

The inclusion Quiver.Symmetrify.of of a quiver in its doubled quiver is the identity on vertices, hence bijective on them.