Documentation

TauCeti.RepresentationTheory.Quiver.Representation.Projective.EulerForm

The Euler form against the dimension vector of a vertex projective #

The Euler form of a finite quiver is the numerical shadow of the homological pairing: for finite-dimensional representations of an acyclic quiver, ⟨dim M, dim N⟩ is dim Hom(M, N) - dim Ext¹(M, N). On the projective Pᵢ that identity needs no Ext, because Ext¹(Pᵢ, -) vanishes and Hom(Pᵢ, N) is Nᵢ. This file proves the resulting closed formula,

⟨dim Pᵢ, e⟩ = eᵢ for every e : Q → ℤ,

which holds over any finite quiver with finitely many paths — no acyclicity, no algebraically closed field, no finite-dimensionality of the representations involved.

Main results #

Implementation notes #

The combinatorial core is TauCeti.eulerForm_card_path_left, in TauCeti.RepresentationTheory.Quiver.EulerForm, which pairs a path-count vector against the Euler form; the results below just rewrite dim Pᵢ into that path count. Over an acyclic quiver the Tits norm of dim Pᵢ is 1; that statement lives in TauCeti.RepresentationTheory.Quiver.Representation.Projective.Acyclic.

The hypothesis carried throughout is ∀ a, Finite (Quiver.Path i a), for the vertex i at hand: the finiteness that makes TauCeti.dimVector (indecProjRep k Q i) an honest path count rather than the 0 that Module.finrank returns on an infinite-dimensional space. For a finite quiver it follows from acyclicity, by TauCeti.finite_paths_of_isAcyclic; the loop quiver, where it fails, is exactly the boundary case the roadmap records.

Dimension vectors take values in ℕ while the Euler form is defined on Q → ℤ, so every statement below feeds the Euler form the pointwise cast fun v ↦ (dimVector M v : ℤ).

The dual statements, for the injective Iᵢ on the right-hand side of the Euler form, need the decomposition of a path by its first arrow, which TauCeti.RepresentationTheory.Quiver.LastArrow does not provide; that decomposition is built in TauCeti.RepresentationTheory.Quiver.FirstArrow and the dual statements are in TauCeti.RepresentationTheory.Quiver.Representation.Injective.EulerForm.

References #

This implements the projective case of the homological interpretation of the Euler form, Layer 4 of TauCetiRoadmap/RepresentationTheory/QuiverRepresentations/README.md. See Derksen--Weyman, An Introduction to Quiver Representations, Ch. 1, and Assem--Simson--Skowroński, Elements of the Representation Theory of Associative Algebras I, Ch. III.

theorem TauCeti.eulerForm_dimVector_indecProjRep (Q : Type v) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] (k : Type u) [Field k] (i : Q) [∀ (a : Q), Finite (Quiver.Path i a)] (e : Q → ℤ) :
((eulerForm Q) fun (v : Q) => ↑(dimVector (indecProjRep k Q i) v)) e = e i

The Euler form against the dimension vector of Pᵢ is evaluation at i. This is the homological identity ⟨dim M, dim N⟩ = dim Hom(M, N) - dim Ext¹(M, N) in the one case where it needs no Ext: the projective Pᵢ represents evaluation at i.

theorem TauCeti.eulerForm_dimVector_indecProjRep_eq_finrank_hom (Q : Type v) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] (k : Type u) [Field k] (i : Q) [∀ (a : Q), Finite (Quiver.Path i a)] (N : QuiverRep k Q) :
(((eulerForm Q) fun (v : Q) => ↑(dimVector (indecProjRep k Q i) v)) fun (v : Q) => ↑(dimVector N v)) = ↑(Module.finrank k (indecProjRep k Q i ⟶ N))

The homological reading of the Euler form at a projective. For every representation N, ⟨dim Pᵢ, dim N⟩ is the dimension of Hom(Pᵢ, N); the Ext¹ term of the general identity is absent because Pᵢ is projective.

theorem TauCeti.eulerForm_dimVector_indecProjRep_indecProjRep (Q : Type v) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] (k : Type u) [Field k] (i : Q) [∀ (a : Q), Finite (Quiver.Path i a)] (j : Q) :
(((eulerForm Q) fun (v : Q) => ↑(dimVector (indecProjRep k Q i) v)) fun (v : Q) => ↑(dimVector (indecProjRep k Q j) v)) = ↑(Nat.card (Quiver.Path j i))

The Cartan pairing of two vertex projectives. ⟨dim Pᵢ, dim Pⱼ⟩ counts the paths j → i, which is dim Hom(Pᵢ, Pⱼ): the Euler form reproduces the path-counting Cartan matrix of a path algebra.

theorem TauCeti.eulerForm_dimVector_indecProjRep_single (Q : Type v) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] (k : Type u) [Field k] [DecidableEq Q] (i : Q) [∀ (a : Q), Finite (Quiver.Path i a)] (j : Q) :
((eulerForm Q) fun (v : Q) => ↑(dimVector (indecProjRep k Q i) v)) (Pi.single j 1) = if i = j then 1 else 0

The Euler pairing of a projective against a vertex simple. ⟨dim Pᵢ, αⱼ⟩ = δᵢⱼ, the dimension of Hom(Pᵢ, Sⱼ): the projectives and the simples are dual bases for the Euler form.

theorem TauCeti.titsForm_dimVector_indecProjRep (Q : Type v) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] (k : Type u) [Field k] (i : Q) [∀ (a : Q), Finite (Quiver.Path i a)] :
((titsForm Q) fun (v : Q) => ↑(dimVector (indecProjRep k Q i) v)) = ↑(Nat.card (Quiver.Path i i))

The Tits norm of the dimension vector of Pᵢ counts the closed paths at i.