Documentation

TauCeti.Algebra.AlgebraicGroup.Product

The direct product of affine group schemes on points #

For two commutative bialgebras H₁ and H₂ over R, the tensor product H₁ ⊗[R] H₂ is the coordinate bialgebra of the direct product of the affine group schemes Spec H₁ and Spec H₂. This file proves that this is reflected on the functor of points: for every commutative R-algebra A, the convolution monoid of R-algebra homomorphisms (H₁ ⊗[R] H₂) →ₐ[R] A is multiplicatively equivalent to the product of the convolution monoids H₁ →ₐ[R] A and H₂ →ₐ[R] A (pointsMulEquiv). When H₁ and H₂ are Hopf algebras these convolution monoids are the convolution groups of points, so this is automatically an isomorphism of groups: the points of the product group scheme are the product of the points.

The equivalence sends a point f : (H₁ ⊗[R] H₂) →ₐ[R] A to its two restrictions f ∘ (· ⊗ₜ 1) and f ∘ (1 ⊗ₜ ·); its inverse is Mathlib's tensor-product product map, Algebra.TensorProduct.productMap f₁ f₂ : x ⊗ₜ y ↦ f₁ x * f₂ y. Both restrictions are instances of pre-composition with the bialgebra morphisms from TauCeti.Algebra.Bialgebra.TensorProduct, so the restriction map is a monoid homomorphism by TauCeti.AlgHom.mapDomain; Mathlib's product map is its inverse by the universal property.

Main definitions #

References #

This realizes the "products of affine group schemes" computation on the functor of points, in the spirit of the worked examples of the Tau Ceti ReductiveGroups roadmap (ReductiveGroups/README.md in TauCetiRoadmap, Layer 0 "R-points as a group" and the three synchronized models). The tensor-product bialgebra structure and its unit and identity isomorphisms are from Mathlib's Mathlib.RingTheory.Bialgebra.TensorProduct; the universal property Algebra.TensorProduct.lift is from Mathlib's Mathlib.RingTheory.TensorProduct.Maps. The convolution monoid and its contravariant functoriality TauCeti.AlgHom.mapDomain are Tau Ceti's existing functor-of-points infrastructure, built on the Mathlib convolution monoid of Yaël Dillies, Michał Mrugała and Yunzhou Xie.

theorem TauCeti.Algebra.TensorProduct.comp_productMap {R : Type u_1} {H₁ : Type u_2} {H₂ : Type u_3} {A : Type u_4} {B : Type u_5} [CommSemiring R] [Semiring H₁] [Semiring H₂] [CommSemiring A] [CommSemiring B] [Algebra R H₁] [Algebra R H₂] [Algebra R A] [Algebra R B] (φ : A →ₐ[R] B) (f₁ : H₁ →ₐ[R] A) (f₂ : H₂ →ₐ[R] A) :

Post-composition distributes over the tensor-product map induced by a pair of algebra maps.

@[simp]

A point of Spec (H₁ ⊗[R] H₂) is recovered from its two restrictions by Mathlib's Algebra.TensorProduct.productMap.

noncomputable def TauCeti.AffineGroup.Product.restrictHom {R : Type u_1} {H₁ : Type u_2} {H₂ : Type u_3} {A : Type u_4} [CommSemiring R] [CommSemiring H₁] [CommSemiring H₂] [Bialgebra R H₁] [Bialgebra R H₂] [CommSemiring A] [Algebra R A] :
WithConv (TensorProduct R H₁ H₂ →ₐ[R] A) →* WithConv (H₁ →ₐ[R] A) × WithConv (H₂ →ₐ[R] A)

Restriction of a point of Spec (H₁ ⊗[R] H₂) to its two factors, as a monoid homomorphism of convolution monoids: it pre-composes with the two inclusions includeLeft and includeRight. Each component is TauCeti.AlgHom.mapDomain of a bialgebra morphism, hence a monoid homomorphism, so their pairing is too.

Equations
Instances For
    noncomputable def TauCeti.AffineGroup.Product.pointsMulEquiv {R : Type u_1} {H₁ : Type u_2} {H₂ : Type u_3} {A : Type u_4} [CommSemiring R] [CommSemiring H₁] [CommSemiring H₂] [Bialgebra R H₁] [Bialgebra R H₂] [CommSemiring A] [Algebra R A] :
    WithConv (TensorProduct R H₁ H₂ →ₐ[R] A) ≃* WithConv (H₁ →ₐ[R] A) × WithConv (H₂ →ₐ[R] A)

    The convolution monoid of R-algebra homomorphisms out of a tensor product of commutative bialgebras H₁ ⊗[R] H₂ is the product of the convolution monoids out of H₁ and H₂.

    On the functor of points this is the direct product of the affine group schemes Spec H₁ and Spec H₂: Mathlib's product map sends x ⊗ₜ y to f₁ x * f₂ y, and convolution is computed componentwise. When H₁ and H₂ are Hopf algebras these convolution monoids are groups (TauCeti.AlgHom.instGroup), so this is automatically an isomorphism of groups.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      @[simp]

      Precomposition with the left tensor-product projection inserts a point as the left factor of the product, with the identity in the right factor.

      @[simp]

      Precomposition with the right tensor-product projection inserts a point as the right factor of the product, with the identity in the left factor.

      theorem TauCeti.AffineGroup.Product.restrictHom_mapValue {R : Type u_1} {H₁ : Type u_2} {H₂ : Type u_3} {A : Type u_4} [CommSemiring R] [CommSemiring H₁] [CommSemiring H₂] [Bialgebra R H₁] [Bialgebra R H₂] [CommSemiring A] [Algebra R A] {B : Type u_5} [CommSemiring B] [Algebra R B] (φ : A →ₐ[R] B) (f : WithConv (TensorProduct R H₁ H₂ →ₐ[R] A)) :

      Restricting a product point to the two factors commutes with post-composition in the value algebra. This is the naturality square for the restriction homomorphism underlying pointsMulEquiv.

      theorem TauCeti.AffineGroup.Product.pointsMulEquiv_mapValue {R : Type u_1} {H₁ : Type u_2} {H₂ : Type u_3} {A : Type u_4} [CommSemiring R] [CommSemiring H₁] [CommSemiring H₂] [Bialgebra R H₁] [Bialgebra R H₂] [CommSemiring A] [Algebra R A] {B : Type u_5} [CommSemiring B] [Algebra R B] (φ : A →ₐ[R] B) (f : WithConv (TensorProduct R H₁ H₂ →ₐ[R] A)) :

      The product-points equivalence is natural in the value algebra.

      Post-composing an A-valued point of Spec (H₁ ⊗[R] H₂) by φ : A →ₐ[R] B, then splitting it into its two factor points, gives the same pair as first splitting and then post-composing each factor point by φ.

      theorem TauCeti.AffineGroup.Product.pointsMulEquiv_mapValue_fst {R : Type u_1} {H₁ : Type u_2} {H₂ : Type u_3} {A : Type u_4} [CommSemiring R] [CommSemiring H₁] [CommSemiring H₂] [Bialgebra R H₁] [Bialgebra R H₂] [CommSemiring A] [Algebra R A] {B : Type u_5} [CommSemiring B] [Algebra R B] (φ : A →ₐ[R] B) (f : WithConv (TensorProduct R H₁ H₂ →ₐ[R] A)) :

      First-component form of pointsMulEquiv_mapValue.

      theorem TauCeti.AffineGroup.Product.pointsMulEquiv_mapValue_snd {R : Type u_1} {H₁ : Type u_2} {H₂ : Type u_3} {A : Type u_4} [CommSemiring R] [CommSemiring H₁] [CommSemiring H₂] [Bialgebra R H₁] [Bialgebra R H₂] [CommSemiring A] [Algebra R A] {B : Type u_5} [CommSemiring B] [Algebra R B] (φ : A →ₐ[R] B) (f : WithConv (TensorProduct R H₁ H₂ →ₐ[R] A)) :

      Second-component form of pointsMulEquiv_mapValue.

      theorem TauCeti.AffineGroup.Product.mapValue_pointsMulEquiv_symm_apply {R : Type u_1} {H₁ : Type u_2} {H₂ : Type u_3} {A : Type u_4} [CommSemiring R] [CommSemiring H₁] [CommSemiring H₂] [Bialgebra R H₁] [Bialgebra R H₂] [CommSemiring A] [Algebra R A] {B : Type u_5} [CommSemiring B] [Algebra R B] (φ : A →ₐ[R] B) (p : WithConv (H₁ →ₐ[R] A) × WithConv (H₂ →ₐ[R] A)) :

      The inverse product-points map is natural in the value algebra.

      Assembling an A-valued product point from a pair of factor points and then post-composing by φ : A →ₐ[R] B is the same as post-composing both factor points by φ and then assembling the resulting B-valued product point.

      theorem TauCeti.AffineGroup.Product.mapValue_pointsMulEquiv_symm_apply_tmul {R : Type u_1} {H₁ : Type u_2} {H₂ : Type u_3} {A : Type u_4} [CommSemiring R] [CommSemiring H₁] [CommSemiring H₂] [Bialgebra R H₁] [Bialgebra R H₂] [CommSemiring A] [Algebra R A] {B : Type u_5} [CommSemiring B] [Algebra R B] (φ : A →ₐ[R] B) (p : WithConv (H₁ →ₐ[R] A) × WithConv (H₂ →ₐ[R] A)) (x : H₁) (y : H₂) :
      ((AlgHom.mapValue φ) (pointsMulEquiv.symm p)).ofConv (x ⊗ₜ[R] y) = φ (p.1.ofConv x * p.2.ofConv y)

      On pure tensors, naturality of the inverse product-points map says that post-composition by φ evaluates as applying φ to the product of the two factor values.

      theorem TauCeti.AffineGroup.Product.pointsMulEquiv_symm_mapValue_apply_tmul {R : Type u_1} {H₁ : Type u_2} {H₂ : Type u_3} {A : Type u_4} [CommSemiring R] [CommSemiring H₁] [CommSemiring H₂] [Bialgebra R H₁] [Bialgebra R H₂] [CommSemiring A] [Algebra R A] {B : Type u_5} [CommSemiring B] [Algebra R B] (φ : A →ₐ[R] B) (p : WithConv (H₁ →ₐ[R] A) × WithConv (H₂ →ₐ[R] A)) (x : H₁) (y : H₂) :
      (pointsMulEquiv.symm ((AlgHom.mapValue φ) p.1, (AlgHom.mapValue φ) p.2)).ofConv (x ⊗ₜ[R] y) = φ (p.1.ofConv x) * φ (p.2.ofConv y)

      On pure tensors, assembling after post-composing both factor points multiplies the two post-composed factor values.