Theorems · Inductive type · commutative algebra
Algebra.EssFiniteType
(R : Type u_1) → (S : Type u_2) → [inst : CommRing R] → [inst_1 : CommRing S] → [Algebra R S] → Prop
An R-algebra is essentially of finite type if
it is the localization of an algebra of finite type.
See essFiniteType_iff_exists_subalgebra.
For field extensions, this is equivalent to being finitely generated as a field.
See IntermediateField.fg_top_iff.
- Defined in
- Mathlib.RingTheory.EssentialFiniteness
- Cited by
- 68 results in Mathlib
- Foundations
- Depth 6 from the axioms · uses no axioms
Around this declaration
Dashed lines are statement dependencies; solid lines are citations in proofs.
Cites2
Mathlib declarations this one mentions in its statement or cites explicitly in its proof. Plumbing is filtered out.
Cited by77
Results whose statement or proof uses this declaration.
- RingHom.EssFiniteTypeproof · cited by 14
- Algebra.EssFiniteType.of_compstatement and proof · cited by 8
- Algebra.EssFiniteType.compstatement and proof · cited by 7
- Algebra.FormallyUnramified.finite_of_freestatement and proof · cited by 7
- Algebra.FormallyUnramified.elemstatement and proof · cited by 6
- Algebra.FormallyUnramified.isReduced_of_fieldstatement and proof · cited by 6
- Algebra.EssFiniteType.finsetstatement and proof · cited by 5
- Algebra.EssFiniteType.of_isLocalizationstatement · cited by 5
- Algebra.EssFiniteType.subalgebrastatement and proof · cited by 5
- Algebra.FormallyUnramified.map_maximalIdealstatement and proof · cited by 5
- Ideal.ramificationIdx_eq_one_iffstatement and proof · cited by 4
- Algebra.EssFiniteType.submonoidstatement and proof · cited by 4