Documentation

TauCeti.RepresentationTheory.GrothendieckGroup.GroupAlgebra.Artin

Artin's identity in the exact Grothendieck ring #

For a finite group G, let a_C = C.artinCoeff * |C|. The two actual G-sets TauCeti.ArtinPositiveSet G and TauCeti.ArtinNegativeSet G split the positive and negative parts of the coefficients a_C. Their fixed-point counts agree, so the permutation-class comparison identifies their classes in G₀(k[G]) over every field, including when the characteristic divides |G|. Expanding the two disjoint unions and recombining the positive and negative parts gives

|G| [k] = ∑ᶠ C, a_C [k[G/C]].

Rewriting the coset classes as induced units gives Artin's identity in the Grothendieck ring. The projection formula then gives the identity for every virtual class by multiplication.

Main results #

References #

theorem TauCeti.permK0_artinPositiveSet (k G : Type u) [CommRing k] [Group G] [Finite G] :
permK0 k G (ArtinPositiveSet G) = ∑ᶠ (C : Subgroup G), (C.artinCoeff * ↑(Nat.card ↥C)).toNat • permK0 k G (G ⧸ C)

The class of the positive Artin set is the sum of the positive parts of the Artin coefficients times the corresponding coset classes.

theorem TauCeti.permK0_artinNegativeSet (k G : Type u) [CommRing k] [Group G] [Finite G] :
permK0 k G (ArtinNegativeSet G) = Nat.card G • permK0 k G (G ⧸ ⊤) + ∑ᶠ (C : Subgroup G), (-(C.artinCoeff * ↑(Nat.card ↥C))).toNat • permK0 k G (G ⧸ C)

The class of the negative Artin set is the sum of |G| fixed points and the negative parts of the Artin coefficients times the corresponding coset classes.

The positive and negative Artin sets have equal permutation classes over every field.

Artin's signed permutation identity in the exact Grothendieck group over every field.

Artin's identity in G₀(k[G]) over every field, written as induction of the unit from subgroups. No division by the group order is required.

Artin's induction identity for every virtual class over every field. Multiplying by |G| expresses a class as the Artin-coefficient sum of its induced restrictions.