The perfect closure of a characteristic p ring

Main definitions

• PerfectClosure: the perfect closure of a characteristic p ring, which is the smallest extension that makes frobenius surjective.

• PerfectClosure.mk K p (n, x): for n : ℕ and x : K this is x ^ (p ^ -n) viewed as an element of PerfectClosure K p. Every element of PerfectClosure K p is of this form (PerfectClosure.mk_surjective).

• PerfectClosure.of: the structure map from K to PerfectClosure K p.

• PerfectClosure.lift: given a ring K of characteristic p and a perfect ring L of the same characteristic, any homomorphism K →+* L can be lifted to PerfectClosure K p.

Main results

• PerfectClosure.induction_on: to prove a result for all elements of the prefect closure, one only needs to prove it for all elements of the form x ^ (p ^ -n).

• PerfectClosure.mk_mul_mk, PerfectClosure.one_def, PerfectClosure.mk_add_mk, PerfectClosure.neg_mk, PerfectClosure.zero_def, PerfectClosure.mk_zero_zero, PerfectClosure.mk_zero, PerfectClosure.mk_inv, PerfectClosure.mk_pow: how to do multiplication, addition, etc. on elements of form x ^ (p ^ -n).

• PerfectClosure.mk_eq_iff: when does x ^ (p ^ -n) equal.

• PerfectClosure.eq_iff: same as PerfectClosure.mk_eq_iff but with additional assumption that K being reduced, hence gives a simpler criterion.

• PerfectClosure.instPerfectRing: PerfectClosure K p is a perfect ring.

Tags

perfect ring, perfect closure

theorem PerfectClosure.r_iff (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : ∀ (a a_1 : ℕ × K), PerfectClosure.R K p a a_1 ↔ ∃ (n : ℕ) (x : K), a = (n, x) ∧ a_1 = (n + 1, (frobenius K p) x)

inductive PerfectClosure.R (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : ℕ × K → ℕ × K → Prop

PerfectClosure.R is the relation (n, x) ∼ (n + 1, x ^ p) for n : ℕ and x : K. PerfectClosure K p is the quotient by this relation.

• intro: ∀ {K : Type u} [inst : CommRing K] {p : ℕ} [inst_1 : Fact p.Prime] [inst_2 : CharP K p] (n : ℕ) (x : K), PerfectClosure.R K p (n, x) (n + 1, (frobenius K p) x)

def PerfectClosure (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : Type u

The perfect closure is the smallest extension that makes frobenius surjective.

Equations

• PerfectClosure K p = Quot (PerfectClosure.R K p)

def PerfectClosure.mk (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (x : ℕ × K) : PerfectClosure K p

PerfectClosure.mk K p (n, x) for n : ℕ and x : K is an element of PerfectClosure K p, viewed as x ^ (p ^ -n). Every element of PerfectClosure K p is of this form (PerfectClosure.mk_surjective).

Equations

• PerfectClosure.mk K p x = Quot.mk (PerfectClosure.R K p) x

theorem PerfectClosure.mk_surjective (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : Function.Surjective (PerfectClosure.mk K p)

@[simp]

theorem PerfectClosure.mk_succ_pow (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (m : ℕ) (x : K) : PerfectClosure.mk K p (m + 1, x ^ p) = PerfectClosure.mk K p (m, x)

@[simp]

theorem PerfectClosure.quot_mk_eq_mk (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (x : ℕ × K) : Quot.mk (PerfectClosure.R K p) x = PerfectClosure.mk K p x

def PerfectClosure.liftOn {K : Type u} [CommRing K] {p : ℕ} [Fact p.Prime] [CharP K p] {L : Type u_1} (x : PerfectClosure K p) (f : ℕ × K → L) (hf : ∀ (x y : ℕ × K), PerfectClosure.R K p x y → f x = f y) : L

Lift a function ℕ × K → L to a function on PerfectClosure K p.

Equations

• x.liftOn f hf = Quot.liftOn x f hf

@[simp]

theorem PerfectClosure.liftOn_mk {K : Type u} [CommRing K] {p : ℕ} [Fact p.Prime] [CharP K p] {L : Type u_1} (f : ℕ × K → L) (hf : ∀ (x y : ℕ × K), PerfectClosure.R K p x y → f x = f y) (x : ℕ × K) : (PerfectClosure.mk K p x).liftOn f hf = f x

theorem PerfectClosure.induction_on {K : Type u} [CommRing K] {p : ℕ} [Fact p.Prime] [CharP K p] (x : PerfectClosure K p) {q : PerfectClosure K p → Prop} (h : ∀ (x : ℕ × K), q (PerfectClosure.mk K p x)) : q x

instance PerfectClosure.instMul (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : Mul (PerfectClosure K p)

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem PerfectClosure.mk_mul_mk (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (x : ℕ × K) (y : ℕ × K) : PerfectClosure.mk K p x * PerfectClosure.mk K p y = PerfectClosure.mk K p (x.1 + y.1, (⇑(frobenius K p))^[y.1] x.2 * (⇑(frobenius K p))^[x.1] y.2)

instance PerfectClosure.instCommMonoid (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : CommMonoid (PerfectClosure K p)

Equations

• PerfectClosure.instCommMonoid K p = let __src := inferInstance; CommMonoid.mk ⋯

theorem PerfectClosure.one_def (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : 1 = PerfectClosure.mk K p (0, 1)

instance PerfectClosure.instInhabited (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : Inhabited (PerfectClosure K p)

Equations

• PerfectClosure.instInhabited K p = { default := 1 }

instance PerfectClosure.instAdd (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : Add (PerfectClosure K p)

Equations

• One or more equations did not get rendered due to their size.

@[simp]

theorem PerfectClosure.mk_add_mk (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (x : ℕ × K) (y : ℕ × K) : PerfectClosure.mk K p x + PerfectClosure.mk K p y = PerfectClosure.mk K p (x.1 + y.1, (⇑(frobenius K p))^[y.1] x.2 + (⇑(frobenius K p))^[x.1] y.2)

instance PerfectClosure.instNeg (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : Neg (PerfectClosure K p)

Equations

• PerfectClosure.instNeg K p = { neg := Quot.lift (fun (x : ℕ × K) => PerfectClosure.mk K p (x.1, -x.2)) ⋯ }

@[simp]

theorem PerfectClosure.neg_mk (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (x : ℕ × K) : -PerfectClosure.mk K p x = PerfectClosure.mk K p (x.1, -x.2)

instance PerfectClosure.instZero (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : Zero (PerfectClosure K p)

Equations

• PerfectClosure.instZero K p = { zero := PerfectClosure.mk K p (0, 0) }

theorem PerfectClosure.zero_def (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : 0 = PerfectClosure.mk K p (0, 0)

@[simp]

theorem PerfectClosure.mk_zero_zero (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : PerfectClosure.mk K p (0, 0) = 0

theorem PerfectClosure.mk_zero (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (n : ℕ) : PerfectClosure.mk K p (n, 0) = 0

theorem PerfectClosure.R.sound (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (m : ℕ) (n : ℕ) (x : K) (y : K) (H : (⇑(frobenius K p))^[m] x = y) : PerfectClosure.mk K p (n, x) = PerfectClosure.mk K p (m + n, y)

instance PerfectClosure.instAddCommGroup (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : AddCommGroup (PerfectClosure K p)

Equations

• PerfectClosure.instAddCommGroup K p = let __src := inferInstance; let __src_1 := inferInstance; AddCommGroup.mk ⋯

instance PerfectClosure.instCommRing (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : CommRing (PerfectClosure K p)

Equations

• PerfectClosure.instCommRing K p = let __src := PerfectClosure.instAddCommGroup K p; let __src_1 := AddMonoidWithOne.unary; let __src_2 := inferInstance; CommRing.mk ⋯

theorem PerfectClosure.mk_eq_iff (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (x : ℕ × K) (y : ℕ × K) : PerfectClosure.mk K p x = PerfectClosure.mk K p y ↔ ∃ (z : ℕ), (⇑(frobenius K p))^[y.1 + z] x.2 = (⇑(frobenius K p))^[x.1 + z] y.2

@[simp]

theorem PerfectClosure.mk_pow (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (x : ℕ × K) (n : ℕ) : PerfectClosure.mk K p x ^ n = PerfectClosure.mk K p (x.1, x.2 ^ n)

theorem PerfectClosure.natCast (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (n : ℕ) (x : ℕ) : ↑x = PerfectClosure.mk K p (n, ↑x)

theorem PerfectClosure.intCast (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (x : ℤ) : ↑x = PerfectClosure.mk K p (0, ↑x)

theorem PerfectClosure.natCast_eq_iff (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (x : ℕ) (y : ℕ) : ↑x = ↑y ↔ ↑x = ↑y

instance PerfectClosure.instCharP (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : CharP (PerfectClosure K p) p

Equations

• ⋯ = ⋯

theorem PerfectClosure.frobenius_mk (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (x : ℕ × K) : (frobenius (PerfectClosure K p) p) (PerfectClosure.mk K p x) = PerfectClosure.mk K p (x.1, x.2 ^ p)

def PerfectClosure.of (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : K →+* PerfectClosure K p

Embedding of K into PerfectClosure K p

Equations

• PerfectClosure.of K p = { toFun := fun (x : K) => PerfectClosure.mk K p (0, x), map_one' := ⋯, map_mul' := ⋯, map_zero' := ⋯, map_add' := ⋯ }

theorem PerfectClosure.of_apply (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (x : K) : (PerfectClosure.of K p) x = PerfectClosure.mk K p (0, x)

instance PerfectClosure.instReduced (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : IsReduced (PerfectClosure K p)

Equations

• ⋯ = ⋯

instance PerfectClosure.instPerfectRing (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] : PerfectRing (PerfectClosure K p) p

Equations

• ⋯ = ⋯

@[simp]

theorem PerfectClosure.iterate_frobenius_mk (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (n : ℕ) (x : K) : (⇑(frobenius (PerfectClosure K p) p))^[n] (PerfectClosure.mk K p (n, x)) = (PerfectClosure.of K p) x

noncomputable def PerfectClosure.lift (K : Type u) [CommRing K] (p : ℕ) [Fact p.Prime] [CharP K p] (L : Type v) [CommSemiring L] [CharP L p] [PerfectRing L p] : (K →+* L) ≃ (PerfectClosure K p →+* L)

Given a ring K of characteristic p and a perfect ring L of the same characteristic, any homomorphism K →+* L can be lifted to PerfectClosure K p.

Equations

• One or more equations did not get rendered due to their size.

theorem PerfectClosure.eq_iff (K : Type u) [CommRing K] [IsReduced K] (p : ℕ) [Fact p.Prime] [CharP K p] (x : ℕ × K) (y : ℕ × K) : PerfectClosure.mk K p x = PerfectClosure.mk K p y ↔ (⇑(frobenius K p))^[y.1] x.2 = (⇑(frobenius K p))^[x.1] y.2

instance PerfectClosure.instInv (K : Type u) [Field K] (p : ℕ) [Fact p.Prime] [CharP K p] : Inv (PerfectClosure K p)

Equations

• PerfectClosure.instInv K p = { inv := Quot.lift (fun (x : ℕ × K) => Quot.mk (PerfectClosure.R K p) (x.1, x.2⁻¹)) ⋯ }

@[simp]

theorem PerfectClosure.mk_inv (K : Type u) [Field K] (p : ℕ) [Fact p.Prime] [CharP K p] (x : ℕ × K) : (PerfectClosure.mk K p x)⁻¹ = PerfectClosure.mk K p (x.1, x.2⁻¹)

instance PerfectClosure.instDivisionRing (K : Type u) [Field K] (p : ℕ) [Fact p.Prime] [CharP K p] : DivisionRing (PerfectClosure K p)

Equations

• PerfectClosure.instDivisionRing K p = DivisionRing.mk ⋯ zpowRec ⋯ ⋯ ⋯ ⋯ ⋯ ⋯ (fun (q : ℚ≥0) (a : PerfectClosure K p) => ↑q * a) ⋯ ⋯ (fun (a : ℚ) (x : PerfectClosure K p) => ↑a * x) ⋯

instance PerfectClosure.instField (K : Type u) [Field K] (p : ℕ) [Fact p.Prime] [CharP K p] : Field (PerfectClosure K p)

Equations

• PerfectClosure.instField K p = let __src := inferInstance; let __src_1 := inferInstance; Field.mk ⋯ DivisionRing.zpow ⋯ ⋯ ⋯ ⋯ ⋯ ⋯ DivisionRing.nnqsmul ⋯ ⋯ DivisionRing.qsmul ⋯

instance PerfectClosure.instPerfectField (K : Type u) [Field K] (p : ℕ) [Fact p.Prime] [CharP K p] : PerfectField (PerfectClosure K p)

Equations

• ⋯ = ⋯