Documentation

Mathlib.RingTheory.Unramified.Finite

Various results about unramified algebras #

We prove various theorems about unramified algebras. In fact we work in the more general setting of formally unramified algebras which are essentially of finite type.

Main definitions #

Let S/R be formally unramified and essentially of finite type.

Main results #

References #

theorem Algebra.FormallyUnramified.iff_exists_tensorProduct {R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] [EssFiniteType R S] :
FormallyUnramified R S ↔ ∃ (t : TensorProduct R S S), (∀ (s : S), (1 ⊗ₜ[R] s - s ⊗ₜ[R] 1) * t = 0) ∧ (TensorProduct.lmul' R) t = 1

Proposition I.2.3 + I.2.6 of [Ive06] A finite-type R-algebra S is (formally) unramified iff there exists a t : S ⊗[R] S satisfying

  1. t annihilates every 1 ⊗ s - s ⊗ 1.
  2. the image of t is 1 under the map S ⊗[R] S → S.
theorem Algebra.FormallyUnramified.finite_of_free_aux {R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] (I : Type u_6) [DecidableEq I] (b : Module.Basis I R S) (f : I →₀ S) (x : S) (a : I → I →₀ R) (ha : a = fun (i : I) => b.repr (b i * x)) :
(1 ⊗ₜ[R] x * f.sum fun (i : I) (y : S) => y ⊗ₜ[R] b i) = ∑ k ∈ f.support.biUnion fun (i : I) => (a i).support, (b.repr (f.sum fun (i : I) (y : S) => (a i) k • y)).sum fun (j : I) (c : R) => c • b j ⊗ₜ[R] b k
noncomputable def Algebra.FormallyUnramified.elem (R : Type u_1) (S : Type u_2) [CommRing R] [CommRing S] [Algebra R S] [FormallyUnramified R S] [EssFiniteType R S] :

A finite-type R-algebra S is (formally) unramified iff there exists a t : S ⊗[R] S satisfying

  1. t annihilates every 1 ⊗ s - s ⊗ 1.
  2. the image of t is 1 under the map S ⊗[R] S → S.

See Algebra.FormallyUnramified.iff_exists_tensorProduct. This is the choice of such a t.

Equations
Instances For
    theorem Algebra.FormallyUnramified.one_tmul_mul_elem {R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] [FormallyUnramified R S] [EssFiniteType R S] (s : S) :
    1 ⊗ₜ[R] s * elem R S = s ⊗ₜ[R] 1 * elem R S

    An unramified free algebra is finitely generated. Iversen I.2.8

    noncomputable def Algebra.FormallyUnramified.sec (R : Type u_1) (S : Type u_2) [CommRing R] [CommRing S] [Algebra R S] (M : Type u_4) [AddCommGroup M] [Module R M] [Module S M] [IsScalarTower R S M] [FormallyUnramified R S] [EssFiniteType R S] :

    Proposition I.2.3 of [Ive06] If S is an unramified R-algebra, and M is an S-module, then the map S ⊗[R] M →ₗ[S] M taking (b, m) ↦ b • m admits an S-linear section.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      theorem Algebra.FormallyUnramified.sec_apply (R : Type u_1) (S : Type u_2) [CommRing R] [CommRing S] [Algebra R S] {M : Type u_4} [AddCommGroup M] [Module R M] [Module S M] [IsScalarTower R S M] [FormallyUnramified R S] [EssFiniteType R S] (x : M) :
      (sec R S M) x = (LinearMap.baseChange S (↑R (LinearMap.toSpanSingleton S M x))) (elem R S)
      @[simp]
      theorem Algebra.FormallyUnramified.sec_self_one (R : Type u_1) (S : Type u_2) [CommRing R] [CommRing S] [Algebra R S] [FormallyUnramified R S] [EssFiniteType R S] :
      (sec R S S) 1 = elem R S
      theorem Algebra.FormallyUnramified.sec_comp (R : Type u_1) (S : Type u_2) [CommRing R] [CommRing S] [Algebra R S] {M : Type u_4} [AddCommGroup M] [Module R M] [Module S M] [IsScalarTower R S M] {N : Type u_5} [AddCommGroup N] [Module R N] [Module S N] [IsScalarTower R S N] [FormallyUnramified R S] [EssFiniteType R S] (f : M →ₗ[S] N) :
      sec R S N ∘ₗ f = LinearMap.baseChange S (↑R f) ∘ₗ sec R S M
      @[simp]
      theorem Algebra.FormallyUnramified.baseChange_sec (R : Type u_1) (S : Type u_2) [CommRing R] [CommRing S] [Algebra R S] {M : Type u_4} [AddCommGroup M] [Module R M] [Module S M] [IsScalarTower R S M] {N : Type u_5} [AddCommGroup N] [Module R N] [Module S N] [IsScalarTower R S N] [FormallyUnramified R S] [EssFiniteType R S] (f : M →ₗ[S] N) (x : M) :
      (LinearMap.baseChange S (↑R f)) ((sec R S M) x) = (sec R S N) (f x)
      theorem Algebra.FormallyUnramified.sec_mem_baseChange (R : Type u_1) (S : Type u_2) [CommRing R] [CommRing S] [Algebra R S] {M : Type u_4} [AddCommGroup M] [Module R M] [Module S M] [IsScalarTower R S M] [FormallyUnramified R S] [EssFiniteType R S] (P : Submodule S M) {x : M} (hx : x ∈ P) :

      If S is an unramified R-algebra, then R-flat implies S-flat. Iversen I.2.7

      If S is an unramified R-algebra, then R-projective implies S-projective.

      theorem Algebra.FormallyUnramified.extendScalars_apply {R : Type u_1} (S : Type u_2) [CommRing R] [CommRing S] [Algebra R S] {M : Type u_4} [AddCommGroup M] [Module R M] [Module S M] [IsScalarTower R S M] {N : Type u_5} [AddCommGroup N] [Module R N] [Module S N] [IsScalarTower R S N] [FormallyUnramified R S] [EssFiniteType R S] (f : M →ₗ[R] N) :
      @[simp]
      theorem Algebra.FormallyUnramified.extendScalars_zero (R : Type u_1) (S : Type u_2) [CommRing R] [CommRing S] [Algebra R S] (M : Type u_4) [AddCommGroup M] [Module R M] [Module S M] [IsScalarTower R S M] {N : Type u_5} [AddCommGroup N] [Module R N] [Module S N] [IsScalarTower R S N] [FormallyUnramified R S] [EssFiniteType R S] :
      @[simp]
      theorem Algebra.FormallyUnramified.extendScalars_one (R : Type u_1) (S : Type u_2) [CommRing R] [CommRing S] [Algebra R S] (M : Type u_4) [AddCommGroup M] [Module R M] [Module S M] [IsScalarTower R S M] [FormallyUnramified R S] [EssFiniteType R S] :
      @[simp]
      theorem Algebra.FormallyUnramified.extendScalars_apply_comp_restrictScalars {R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] {L : Type u_3} [AddCommGroup L] [Module R L] [Module S L] [IsScalarTower R S L] {M : Type u_4} [AddCommGroup M] [Module R M] [Module S M] [IsScalarTower R S M] {N : Type u_5} [AddCommGroup N] [Module R N] [Module S N] [IsScalarTower R S N] [FormallyUnramified R S] [EssFiniteType R S] (f : M →ₗ[R] N) (g : L →ₗ[S] M) :
      (extendScalars S) (f ∘ₗ ↑R g) = (extendScalars S) f ∘ₗ g
      @[simp]
      theorem Algebra.FormallyUnramified.extendScalars_apply_restrictScalars_comp {R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] {L : Type u_3} [AddCommGroup L] [Module R L] [Module S L] [IsScalarTower R S L] {M : Type u_4} [AddCommGroup M] [Module R M] [Module S M] [IsScalarTower R S M] {N : Type u_5} [AddCommGroup N] [Module R N] [Module S N] [IsScalarTower R S N] [FormallyUnramified R S] [EssFiniteType R S] (f : M →ₗ[S] N) (g : L →ₗ[R] M) :
      (extendScalars S) (↑R f ∘ₗ g) = f ∘ₗ (extendScalars S) g
      @[simp]
      theorem Algebra.FormallyUnramified.extendScalars_restrictScalars (R : Type u_1) {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] {M : Type u_4} [AddCommGroup M] [Module R M] [Module S M] [IsScalarTower R S M] {N : Type u_5} [AddCommGroup N] [Module R N] [Module S N] [IsScalarTower R S N] [FormallyUnramified R S] [EssFiniteType R S] (f : M →ₗ[S] N) :
      (extendScalars S) (↑R f) = f
      noncomputable def Algebra.FormallyUnramified.equalizerIdempotent {R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] [FormallyUnramified R S] [EssFiniteType R S] {A : Type u_6} [CommRing A] [Algebra R A] (f g : S →ₐ[R] A) :
      A

      The idempotent defining the subset of Spec A where f and g agree.

      Equations
      Instances For
        @[simp]
        theorem Algebra.FormallyUnramified.map_equalizerIdempotent {R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] [FormallyUnramified R S] [EssFiniteType R S] {A : Type u_6} [CommRing A] [Algebra R A] (f g : S →ₐ[R] A) {B : Type u_7} [CommRing B] [Algebra R B] (φ : A →ₐ[R] B) :
        theorem Algebra.FormallyUnramified.equalizerIdempotent_mul_eq_iff {R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] [FormallyUnramified R S] [EssFiniteType R S] {A : Type u_6} [CommRing A] [Algebra R A] {f g : S →ₐ[R] A} {a : A} :
        equalizerIdempotent f g * a = a ↔ ∀ (x : S), f x * a = g x * a
        @[simp]
        @[simp]
        theorem Algebra.FormallyUnramified.apply_mul_equalizerIdempotent {R : Type u_1} {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] [FormallyUnramified R S] [EssFiniteType R S] {A : Type u_6} [CommRing A] [Algebra R A] (f g : S →ₐ[R] A) (x : S) :
        noncomputable def Algebra.FormallyUnramified.inertiaIdempotent (R : Type u_1) (S : Type u_2) [CommRing R] [CommRing S] [Algebra R S] [FormallyUnramified R S] [EssFiniteType R S] {G : Type u_6} [Group G] [MulSemiringAction G S] [SMulCommClass G R S] (g : G) :
        S

        If S/R is formally unramified and essentially finite type, then the inertia idempotent of an algebra automorphism g : G is an idempotent element e of S with the property that e ≡ 1 [MOD Q] ↔ g ∈ Q.inertia G, see mk_inertiaIdempotent_eq_one_iff.

        Equations
        Instances For
          theorem Algebra.FormallyUnramified.smul_mul_inertiaIdempotent (R : Type u_1) {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] [FormallyUnramified R S] [EssFiniteType R S] {G : Type u_6} [Group G] [MulSemiringAction G S] [SMulCommClass G R S] (g : G) (x : S) :
          @[simp]

          The inertia idempotent of g is congruent to 1 modulo Q if and only g ∈ Q.inertia G.

          noncomputable def Algebra.FormallyUnramified.groupIdempotent (R : Type u_1) (S : Type u_2) [CommRing R] [CommRing S] [Algebra R S] [FormallyUnramified R S] [EssFiniteType R S] (G : Type u_6) [Group G] [MulSemiringAction G S] [SMulCommClass G R S] [Finite G] :
          S

          If S/R is formally unramified and essentially finite type, then the group idempotent of a group G of algebra automorphisms is an idempotent element e of S with the property that e ≡ 1 [MOD Q] ↔ Q.inertia G = ⊤, see mk_groupIdempotent_eq_one_iff.

          Equations
          Instances For
            theorem Algebra.FormallyUnramified.smul_mul_groupIdempotent (R : Type u_1) {S : Type u_2} [CommRing R] [CommRing S] [Algebra R S] [FormallyUnramified R S] [EssFiniteType R S] {G : Type u_6} [Group G] [MulSemiringAction G S] [SMulCommClass G R S] [Finite G] (g : G) (b : S) :
            @[simp]