English
The FGAlgCat is equivalent to a Under category of finite-type morphisms from R.
Русский
FGAlgCat эквивалентна Under-категории конечного типа морфизмов из R.
LaTeX
$$$\mathrm{FGAlgCat}(R) \simeq \mathrm{Under}(\mathrm{toMorphismProperty}(\mathrm{FiniteType}), \top, R)$$$
Lean4
/-- The category of finitely generated algebras is essentially small. -/
instance : EssentiallySmall.{u} (FGAlgCat.{v} R) :=
by
suffices h : EssentiallySmall.{u} (FGAlgCat.{max u v} R) by
exact essentiallySmall_of_fully_faithful (FGAlgCat.uliftFunctor R)
rw [essentiallySmall_iff]
refine ⟨?_, ?_⟩
· let f := toSkeleton ∘ (FGAlgCat.uliftFunctor R).obj ∘ FGAlgCatSkeleton.eval R
refine small_of_surjective (f := f) fun A ↦ ?_
simp only [Function.comp_apply, f, toSkeleton_eq_iff]
obtain ⟨P, ⟨e⟩⟩ := Algebra.FiniteType.exists_fgAlgCatSkeleton R ((fromSkeleton (FGAlgCat R)).obj A).obj
exact ⟨P, ⟨ObjectProperty.isoMk _ (CommAlgCat.isoMk <| ULift.algEquiv.trans e.symm)⟩⟩
· refine ⟨fun A B ↦ ?_⟩
obtain ⟨PA, ⟨eA⟩⟩ := Algebra.FiniteType.exists_fgAlgCatSkeleton R A.obj
obtain ⟨PB, ⟨eB⟩⟩ := Algebra.FiniteType.exists_fgAlgCatSkeleton R B.obj
let f (g : A ⟶ B) (x : PA.eval.obj) : PB.eval.obj := eB (g.hom (eA.symm x))
refine small_of_injective (f := f) fun u v h ↦ ?_
ext a
obtain ⟨a, rfl⟩ := eA.symm.surjective a
exact eB.injective (congr_fun h a)