Theorems · Inductive type · field theory
PerfectClosure.R
(K : Type u) → [inst : CommRing K] → (p : ℕ) → [Fact (Nat.Prime p)] → [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.
- Defined in
- Mathlib.FieldTheory.PerfectClosure
- Cited by
- 8 results in Mathlib
- Foundations
- Depth 20 from the axioms · uses propext
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites4
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by13
Results whose statement or proof uses this declaration.
- PerfectClosure.mkproof · cited by 23
- PerfectClosureproof · cited by 22
- PerfectClosure.mk_eq_iffproof · cited by 3
- PerfectClosure.liftOnstatement and proof · cited by 2
- PerfectClosure.R.casesOnstatement and proof · cited by 2
- PerfectClosure.natCastproof · cited by 2
- PerfectClosure.mk_zero_rightproof · cited by 1
- PerfectClosure.liftOn.congr_simpstatement and proof · cited by 0
- PerfectClosure.liftOn_mkstatement and proof · cited by 0
- PerfectClosure.R.congr_simpstatement and proof · cited by 0
- PerfectClosure.R.recOnstatement and proof · cited by 0
- PerfectClosure.quot_mk_eq_mkstatement · cited by 0