Quivers: A year of linear algebra by drawing arrows
26 points
4 days ago
| 3 comments
| lisyarus.github.io
| HN
FallenSky2077
32 minutes ago
[-]
Looks like an introductory tutorial on the application of category theory to linear algebra. These quivers are lovely small categorical constructions. Actually, q.uiver.app is a visual tool to use the quiver package in latex, which is used to draw commutative diagrams in category theory.
reply
philip-b
2 hours ago
[-]
Where are the theorems and the proofs? Can the usual theorems of the "year of linear algebra" be proved using these arrows?
reply
jdonaldson
2 hours ago
[-]
I like directed acyclic graphs and/or DAG because it's a succinct description and contract. Trying to change the name of it makes me quiver with uncertainty.
reply
gnulinux
11 minutes ago
[-]
Quiver (a directed graph with multiple edges) is a standard mathematical term:

https://en.wikipedia.org/wiki/Quiver_(mathematics)

https://ncatlab.org/nlab/show/quiver

A quiver is simply just the data of a category, i.e. a "category" without any of the laws, namely identity and composition.

They're not isomorphic to DAGs since Quivers can have multiple edges between the same set of vertices, in other words, they'd be the DAG equivalent of multigraphs (directed multigraphs, if you will).

For example, in the category of Sets, vertices are sets and edges are functions between sets, so between e.g. N and N there will be infinitely many edges (all functions between natural numbers) with a particular distinguished identity edge that maps f(n) = n due to category laws. So if you turn the category of Sets to a quiver, you'll have infinitely many edges N -> N and one of them will happen to be the identity function `f(n) = n` but you "forgot" its "identity" relationship/law when you reduced the category to a quiver.

reply
jnwatson
1 hour ago
[-]
But they aren't DAGs. They are multidigraphs.
reply