Module

PolynomialCRT.lean

Nyll.ValuedFieldTheory.Valuation.Completion.PolynomialCRT
3 declarations indexed from sourceView source ↗

Polynomial Chinese remainder equivalence

This is the algebraic core of tensor-product decompositions. A squarefree factorization of the base-changed primitive polynomial gives the canonical product of its simple factor algebras.

Imports2
  • Mathlib.RingTheory.AdjoinRoot
  • Mathlib.RingTheory.Ideal.Quotient.Operations
Imported by2

Declarations

ValuationTheory.Completion.quotientInfAlgEquivPiQuotient

The Chinese remainder ring equivalence is an algebra equivalence over any coefficient ring acting on the ambient commutative ring.

Source context 6 commands

Surrounding namespaces, section variables, and local commands at this declaration.

noncomputable section
namespace ValuationTheory
namespace Completion
universe u v
open scoped Polynomial
open Function
def quotientInfAlgEquivPiQuotient
    {R A : Type*} [CommRing R] [CommRing A] [Algebra R A]
    {ι : Type*} [Finite ι]
    (I : ι → Ideal A) (hI : Pairwise (IsCoprime on I)) :
    (A ⧸ ⨅ i, I i) ≃ₐ[R] ∀ i, A ⧸ I i where
  __ := Ideal.quotientInfRingEquivPiQuotient I hI
  commutes' r := by
    ext i
    rfl
ValuationTheory.Completion.adjoinRootProdEquivPi

Chinese remainder equivalence for a finite family of pairwise coprime polynomials. It is canonical: every polynomial class is sent to the family of the same class modulo each factor.

Source context 6 commands

Surrounding namespaces, section variables, and local commands at this declaration.

noncomputable section
namespace ValuationTheory
namespace Completion
universe u v
open scoped Polynomial
open Function
def adjoinRootProdEquivPi
    {F : Type u} [Field F] {ι : Type v} [Fintype ι]
    (f : ι → F[X])
    (hf : ∀ i j, i ≠ j → IsCoprime (f i) (f j)) :
    AdjoinRoot (∏ i, f i) ≃ₐ[F] ∀ i, AdjoinRoot (f i)
ValuationTheory.Completion.adjoinRootProdEquivPi_mk

The product decomposition of an adjoined-root algebra evaluates representatives coordinatewise.

Source context 6 commands

Surrounding namespaces, section variables, and local commands at this declaration.

noncomputable section
namespace ValuationTheory
namespace Completion
universe u v
open scoped Polynomial
open Function
theorem adjoinRootProdEquivPi_mk
    {F : Type u} [Field F] {ι : Type v} [Fintype ι]
    (f : ι → F[X])
    (hf : ∀ i j, i ≠ j → IsCoprime (f i) (f j))
    (g : F[X]) (i : ι) :
    adjoinRootProdEquivPi f hf (AdjoinRoot.mk (∏ i, f i) g) i =
      AdjoinRoot.mk (f i) g