Documentation

TauCeti.RepresentationTheory.Quiver.Reflection.DimensionVector

Simple reflections on the dimension vectors of a quiver #

For a vertex i of a finite quiver Q, the simple reflection sᵢ is the reflection of the dimension-vector lattice Q → ℤ that negates the simple dimension vector αᵢ = Pi.single i 1 and fixes the hyperplane orthogonal to it for the polarized Tits form. It is the numerical shadow of the Bernstein-Gelfand-Ponomarev reflection functor at i, and the generator of the Weyl group action under which the roots of the Tits form are stable.

The reflection is built from Mathlib's Module.preReflection, taking the linear form to be the polarized Tits form paired with αᵢ. Following that naming, TauCeti.vertexPreReflection is available with no hypothesis on i, while the reflection identities need q(αᵢ) = 1, equivalently that i carries no loop; TauCeti.vertexReflection is the automorphism obtained at such a loopless vertex. In an acyclic quiver every vertex is loopless, by TauCeti.Quiver.IsAcyclic.isEmpty_hom_self.

The reflection of the quiver itself, which reverses the arrows at i, is TauCeti.Quiver.Reflect in TauCeti.RepresentationTheory.Quiver.Reflection.Basic; TauCeti.RepresentationTheory.Quiver.Reflection.EulerForm relates the two.

Main definitions and results #

References #

This implements the “simple reflection at a vertex” target of Layer 4 of TauCetiRoadmap/RepresentationTheory/QuiverRepresentations/README.md, whose Layer 5 root-system bridge consumes the symmetrized Gram matrix TauCeti.titsPolarForm_single_single. See Derksen--Weyman, An Introduction to Quiver Representations.

noncomputable def TauCeti.vertexPreReflection (Q : Type u) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] [DecidableEq Q] (i : Q) :

The simple reflection sᵢ at a vertex i, acting on dimension vectors by d ↦ d - ⟨αᵢ, d⟩ αᵢ for the polarized Tits form and the simple dimension vector αᵢ = Pi.single i 1.

No hypothesis on i is imposed here, following Module.preReflection; the reflection identities hold at a loopless vertex, where ⟨αᵢ, αᵢ⟩ = 2, and there vertexReflection packages this map as an automorphism.

Equations
Instances For
    theorem TauCeti.vertexPreReflection_apply (Q : Type u) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] [DecidableEq Q] (i : Q) (d : Q → ℤ) :

    The defining formula for the simple reflection at a vertex.

    theorem TauCeti.vertexPreReflection_apply_of_ne (Q : Type u) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] [DecidableEq Q] (i : Q) (d : Q → ℤ) {v : Q} (hv : v ≠ i) :
    (vertexPreReflection Q i) d v = d v

    Away from i, the simple reflection at i leaves a dimension vector unchanged.

    theorem TauCeti.vertexPreReflection_apply_self (Q : Type u) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] [DecidableEq Q] (i : Q) (d : Q → ℤ) :
    (vertexPreReflection Q i) d i = -d i + ∑ v : Q, (↑(Fintype.card (i ⟶ v)) + ↑(Fintype.card (v ⟶ i))) * d v

    The coordinate of the simple reflection at the reflected vertex.

    theorem TauCeti.vertexPreReflection_apply_self_of_isEmpty (Q : Type u) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] [DecidableEq Q] {i : Q} (h : IsEmpty (i ⟶ i)) (d : Q → ℤ) :
    (vertexPreReflection Q i) d i = -d i + ∑ v ∈ Finset.univ.erase i, (↑(Fintype.card (i ⟶ v)) + ↑(Fintype.card (v ⟶ i))) * d v

    At a loopless vertex the reflected coordinate is the classical formula -dᵢ + ∑_{v ≠ i} (#(i ⟶ v) + #(v ⟶ i)) d_v, the sum running over the neighbours of i.

    @[simp]
    theorem TauCeti.vertexPreReflection_single_self (Q : Type u) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] [DecidableEq Q] {i : Q} (h : IsEmpty (i ⟶ i)) :

    The simple reflection at a loopless vertex negates the corresponding simple dimension vector.

    theorem TauCeti.vertexPreReflection_single_of_ne (Q : Type u) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] [DecidableEq Q] (i : Q) {j : Q} (hj : j ≠ i) :
    (vertexPreReflection Q i) (Pi.single j 1) = Pi.single j 1 + (↑(Fintype.card (i ⟶ j)) + ↑(Fintype.card (j ⟶ i))) • Pi.single i 1

    The simple reflection at i adds a multiple of αᵢ to any other simple dimension vector, the multiple being the number of arrows joining the two vertices in either direction.

    theorem TauCeti.vertexPreReflection_apply_of_titsPolarForm_eq_zero (Q : Type u) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] [DecidableEq Q] (i : Q) {d : Q → ℤ} (hd : ((titsPolarForm Q) (Pi.single i 1)) d = 0) :

    The simple reflection fixes every dimension vector orthogonal to αᵢ for the polarized Tits form.

    theorem TauCeti.involutive_vertexPreReflection (Q : Type u) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] [DecidableEq Q] {i : Q} (h : IsEmpty (i ⟶ i)) :

    The simple reflection at a loopless vertex is an involution.

    noncomputable def TauCeti.vertexReflection (Q : Type u) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] [DecidableEq Q] {i : Q} (h : IsEmpty (i ⟶ i)) :
    (Q → ℤ) ≃ₗ[ℤ] Q → ℤ

    The simple reflection at a loopless vertex, as a linear automorphism of the dimension-vector lattice.

    Equations
    Instances For
      @[simp]
      theorem TauCeti.coe_vertexReflection (Q : Type u) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] [DecidableEq Q] {i : Q} (h : IsEmpty (i ⟶ i)) :
      @[simp]
      theorem TauCeti.vertexReflection_symm (Q : Type u) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] [DecidableEq Q] {i : Q} (h : IsEmpty (i ⟶ i)) :

      The simple reflection at a loopless vertex is its own inverse.

      Invariance of the Tits form #

      theorem TauCeti.titsForm_vertexPreReflection (Q : Type u) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] [DecidableEq Q] {i : Q} (h : IsEmpty (i ⟶ i)) (d : Q → ℤ) :

      The simple reflection at a loopless vertex preserves the Tits form.

      theorem TauCeti.titsPolarForm_vertexPreReflection (Q : Type u) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] [DecidableEq Q] {i : Q} (h : IsEmpty (i ⟶ i)) (d e : Q → ℤ) :

      The simple reflection at a loopless vertex preserves the polarized Tits form.

      theorem TauCeti.bijOn_vertexPreReflection (Q : Type u) [Quiver Q] [Fintype Q] [(a b : Q) → Fintype (a ⟶ b)] [DecidableEq Q] {i : Q} (h : IsEmpty (i ⟶ i)) (n : ℤ) :
      Set.BijOn ⇑(vertexPreReflection Q i) {d : Q → ℤ | (titsForm Q) d = n} {d : Q → ℤ | (titsForm Q) d = n}

      The simple reflection at a loopless vertex permutes every level set of the Tits form; taking the level 1 this says that it permutes the roots of Q.