Loogle!
Result
Found 242 declarations mentioning AlgebraicGeometry.Scheme.IdealSheafData. Of these, only the first 200 are shown.
- AlgebraicGeometry.Scheme.IdealSheafData 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
(X : AlgebraicGeometry.Scheme) : Type u - AlgebraicGeometry.Scheme.nilradical 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
(X : AlgebraicGeometry.Scheme) : X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.instAdd 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : Add X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.instCompleteLattice 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : CompleteLattice X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.instCompleteSemilatticeSup 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : CompleteSemilatticeSup X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.instIdemCommSemiring 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : IdemCommSemiring X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.instMul 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : Mul X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.instOne 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : One X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.instPartialOrder 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : PartialOrder X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.instSemilatticeInf 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : SemilatticeInf X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.instZero 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : Zero X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.instPowNat 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : Pow X.IdealSheafData ℕ - AlgebraicGeometry.Scheme.IdealSheafData.radical 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : X.IdealSheafData - AlgebraicGeometry.Scheme.Hom.ker 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X Y : AlgebraicGeometry.Scheme} (f : X.Hom Y) : Y.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.instOrderBot 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : OrderBot X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.instOrderTop 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : OrderTop X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.ofIdeals_ideal 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : AlgebraicGeometry.Scheme.IdealSheafData.ofIdeals I.ideal = I - AlgebraicGeometry.Scheme.IdealSheafData.instIsOrderedRing 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : IsOrderedRing X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.supportSet 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (self : X.IdealSheafData) : Set ↥X - AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal_support 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I : X.IdealSheafData} : AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal I.support = I.radical - AlgebraicGeometry.Scheme.IdealSheafData.Simps.coe_support 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : Set ↥X - AlgebraicGeometry.Scheme.IdealSheafData.le_radical 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : I ≤ I.radical - AlgebraicGeometry.Scheme.IdealSheafData.support 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : TopologicalSpace.Closeds ↥X - AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (Z : TopologicalSpace.Closeds ↥X) : X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.isClosed_supportSet 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : IsClosed I.supportSet - AlgebraicGeometry.Scheme.nilradical_eq_bot 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} [AlgebraicGeometry.IsReduced X] : X.nilradical = ⊥ - AlgebraicGeometry.Scheme.IdealSheafData.radical_bot 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : ⊥.radical = X.nilradical - AlgebraicGeometry.Scheme.kerFunctor 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
(Y : AlgebraicGeometry.Scheme) : CategoryTheory.Functor (CategoryTheory.Over Y)ᵒᵖ Y.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.one_eq_top 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : 1 = ⊤ - AlgebraicGeometry.Scheme.IdealSheafData.support_radical 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : I.radical.support = I.support - AlgebraicGeometry.Scheme.IdealSheafData.zero_eq_bot 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : 0 = ⊥ - AlgebraicGeometry.Scheme.IdealSheafData.radical_inf 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} : (I ⊓ J).radical = I.radical ⊓ J.radical - AlgebraicGeometry.Scheme.IdealSheafData.mul_top 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : I * ⊤ = I - AlgebraicGeometry.Scheme.IdealSheafData.top_mul 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : ⊤ * I = I - AlgebraicGeometry.Scheme.IdealSheafData.add_eq_sup 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I J : X.IdealSheafData) : I + J = I ⊔ J - AlgebraicGeometry.Scheme.IdealSheafData.radical_mul 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} : (I * J).radical = I.radical ⊓ J.radical - AlgebraicGeometry.Scheme.IdealSheafData.radical_top 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : ⊤.radical = ⊤ - AlgebraicGeometry.Scheme.ker_eq_top_of_isEmpty 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X Y : AlgebraicGeometry.Scheme} (f : X.Hom Y) [IsEmpty ↥X] : f.ker = ⊤ - AlgebraicGeometry.Scheme.Hom.ker_eq_bot_of_isIso 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) [CategoryTheory.IsIso f] : AlgebraicGeometry.Scheme.Hom.ker f = ⊥ - AlgebraicGeometry.Scheme.Hom.ker_eq_top_iff_isEmpty 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X Y : AlgebraicGeometry.Scheme} (f : X.Hom Y) : f.ker = ⊤ ↔ IsEmpty ↥X - AlgebraicGeometry.Scheme.Hom.le_ker_comp 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X Y Z : AlgebraicGeometry.Scheme} (f : X ⟶ Y) (g : Y.Hom Z) : g.ker ≤ AlgebraicGeometry.Scheme.Hom.ker (CategoryTheory.CategoryStruct.comp f g) - AlgebraicGeometry.Scheme.Hom.ker_comp_of_isIso 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X Y Z : AlgebraicGeometry.Scheme} (f : X ⟶ Y) (g : Y ⟶ Z) [CategoryTheory.IsIso f] : AlgebraicGeometry.Scheme.Hom.ker (CategoryTheory.CategoryStruct.comp f g) = AlgebraicGeometry.Scheme.Hom.ker g - AlgebraicGeometry.Scheme.IdealSheafData.radical_sup 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} : (I ⊔ J).radical = (I.radical ⊔ J.radical).radical - AlgebraicGeometry.Scheme.IdealSheafData.support_pow 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (n : ℕ) (hn : n ≠ 0) : (I ^ n).support = I.support - AlgebraicGeometry.Scheme.IdealSheafData.bot_mul 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : ⊥ * I = ⊥ - AlgebraicGeometry.Scheme.IdealSheafData.mul_bot 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : I * ⊥ = ⊥ - AlgebraicGeometry.Scheme.IdealSheafData.support_pow_succ 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (n : ℕ) : (I ^ (n + 1)).support = I.support - AlgebraicGeometry.Scheme.kerFunctor_obj 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
(Y : AlgebraicGeometry.Scheme) (f : (CategoryTheory.Over Y)ᵒᵖ) : Y.kerFunctor.obj f = AlgebraicGeometry.Scheme.Hom.ker (Opposite.unop f).hom - AlgebraicGeometry.Scheme.IdealSheafData.support_antitone 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : Antitone AlgebraicGeometry.Scheme.IdealSheafData.support - AlgebraicGeometry.Scheme.IdealSheafData.inf_mul 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I J K : X.IdealSheafData) : (I ⊔ J) * K = I * K ⊔ J * K - AlgebraicGeometry.Scheme.IdealSheafData.mul_inf 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I J K : X.IdealSheafData) : I * (J ⊔ K) = I * J ⊔ I * K - AlgebraicGeometry.Scheme.IdealSheafData.gc 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : GaloisConnection (fun x => x.support) fun x => AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal x - AlgebraicGeometry.Scheme.Hom.iInf_ker_openCover_map_comp 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) [AlgebraicGeometry.QuasiCompact f] (𝒰 : X.OpenCover) : ⨅ i, AlgebraicGeometry.Scheme.Hom.ker (CategoryTheory.CategoryStruct.comp (𝒰.f i) f) = AlgebraicGeometry.Scheme.Hom.ker f - AlgebraicGeometry.Scheme.IdealSheafData.le_support_iff_le_vanishingIdeal 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I : X.IdealSheafData} {Z : TopologicalSpace.Closeds ↥X} : Z ≤ I.support ↔ I ≤ AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal Z - AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal_antimono 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {S T : TopologicalSpace.Closeds ↥X} (h : S ≤ T) : AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal T ≤ AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal S - AlgebraicGeometry.Scheme.IdealSheafData.mem_supportSet_iff_mem_support 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I : X.IdealSheafData} {x : ↥X} : x ∈ I.supportSet ↔ x ∈ I.support - AlgebraicGeometry.Scheme.IdealSheafData.support_mul 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I J : X.IdealSheafData) : (I * J).support = I.support ⊔ J.support - AlgebraicGeometry.Scheme.IdealSheafData.support_sup 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I J : X.IdealSheafData) : (I ⊔ J).support = I.support ⊓ J.support - AlgebraicGeometry.Scheme.IdealSheafData.support_iSup 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {ι : Sort u_1} (I : ι → X.IdealSheafData) : (iSup I).support = ⨅ i, (I i).support - AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal_iSup 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {ι : Sort u_1} (Z : ι → TopologicalSpace.Closeds ↥X) : AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal (iSup Z) = ⨅ i, AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal (Z i) - AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal_sup 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (Z Z' : TopologicalSpace.Closeds ↥X) : AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal (Z ⊔ Z') = AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal Z ⊓ AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal Z' - AlgebraicGeometry.Scheme.kerFunctor_map 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
(Y : AlgebraicGeometry.Scheme) {f g : (CategoryTheory.Over Y)ᵒᵖ} (hfg : f ⟶ g) : Y.kerFunctor.map hfg = CategoryTheory.homOfLE ⋯ - AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal_top 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal ⊤ = X.nilradical - AlgebraicGeometry.Scheme.IdealSheafData.support_bot 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : ⊥.support = ⊤ - AlgebraicGeometry.Scheme.IdealSheafData.support_eq_top_iff 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} [AlgebraicGeometry.IsReduced X] {I : X.IdealSheafData} : I.support = ⊤ ↔ I = ⊥ - AlgebraicGeometry.Scheme.IdealSheafData.support_sSup 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : Set X.IdealSheafData) : (sSup I).support = ⨅ i ∈ I, i.support - AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal_sSup 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (Z : Set (TopologicalSpace.Closeds ↥X)) : AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal (sSup Z) = ⨅ z ∈ Z, AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal z - AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal_bot 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : AlgebraicGeometry.Scheme.IdealSheafData.vanishingIdeal ⊥ = ⊤ - AlgebraicGeometry.Scheme.IdealSheafData.support_top 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : ⊤.support = ⊥ - AlgebraicGeometry.Scheme.IdealSheafData.support_eq_bot_iff 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : I.support = ⊥ ↔ I = ⊤ - AlgebraicGeometry.Scheme.IdealSheafData.ideal 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (self : X.IdealSheafData) (U : ↑X.affineOpens) : Ideal ↑(X.presheaf.obj (Opposite.op ↑U)) - AlgebraicGeometry.Scheme.IdealSheafData.ofIdeals 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : (U : ↑X.affineOpens) → Ideal ↑(X.presheaf.obj (Opposite.op ↑U))) : X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.ext 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} (h : I.ideal = J.ideal) : I = J - AlgebraicGeometry.Scheme.IdealSheafData.ext_iff 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} : I = J ↔ I.ideal = J.ideal - AlgebraicGeometry.Scheme.IdealSheafData.ext_of_iSup_eq_top 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} {ι : Type u_1} (U : ι → ↑X.affineOpens) (hU : ⨆ i, ↑(U i) = ⊤) (H : ∀ (i : ι), I.ideal (U i) = J.ideal (U i)) : I = J - AlgebraicGeometry.Scheme.IdealSheafData.ofIdealTop 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : Ideal ↑(X.presheaf.obj (Opposite.op ⊤))) : X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.radical_ideal 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : I.radical.ideal U = (I.ideal U).radical - AlgebraicGeometry.Scheme.IdealSheafData.ext_of_isAffine 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} [AlgebraicGeometry.IsAffine X] {I J : X.IdealSheafData} (H : I.ideal ⟨⊤, ⋯⟩ = J.ideal ⟨⊤, ⋯⟩) : I = J - AlgebraicGeometry.Scheme.ker_toSpecΓ 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
(X : AlgebraicGeometry.Scheme) [CompactSpace ↥X] : AlgebraicGeometry.Scheme.Hom.ker X.toSpecΓ = ⊥ - AlgebraicGeometry.Scheme.IdealSheafData.supportSet_subset_zeroLocus 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : I.supportSet ⊆ X.zeroLocus ↑(I.ideal U) - AlgebraicGeometry.Scheme.IdealSheafData.supportSet_eq_iInter_zeroLocus 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (self : X.IdealSheafData) : self.supportSet = ⋂ U, X.zeroLocus ↑(self.ideal U) - AlgebraicGeometry.Scheme.IdealSheafData.coe_support_eq_eq_iInter_zeroLocus 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : ↑I.support = ⋂ U, X.zeroLocus ↑(I.ideal U) - AlgebraicGeometry.Scheme.IdealSheafData.mem_supportSet_iff 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I : X.IdealSheafData} {x : ↥X} : x ∈ I.supportSet ↔ ∀ (U : ↑X.affineOpens), x ∈ X.zeroLocus ↑(I.ideal U) - AlgebraicGeometry.Scheme.IdealSheafData.zeroLocus_inter_subset_supportSet 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : X.zeroLocus ↑(I.ideal U) ∩ ↑↑U ⊆ I.supportSet - AlgebraicGeometry.Scheme.IdealSheafData.mem_support_iff 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I : X.IdealSheafData} {x : ↥X} : x ∈ I.support ↔ ∀ (U : ↑X.affineOpens), x ∈ X.zeroLocus ↑(I.ideal U) - AlgebraicGeometry.Scheme.IdealSheafData.mem_supportSet_iff_of_mem 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I : X.IdealSheafData} {x : ↥X} {U : ↑X.affineOpens} (hxU : x ∈ ↑U) : x ∈ I.supportSet ↔ x ∈ X.zeroLocus ↑(I.ideal U) - AlgebraicGeometry.Scheme.IdealSheafData.supportSet_inter 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : I.supportSet ∩ ↑↑U = X.zeroLocus ↑(I.ideal U) ∩ ↑↑U - AlgebraicGeometry.Scheme.IdealSheafData.mem_support_iff_of_mem 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I : X.IdealSheafData} {x : ↥X} {U : ↑X.affineOpens} (h : x ∈ ↑U) : x ∈ I.support ↔ x ∈ X.zeroLocus ↑(I.ideal U) - AlgebraicGeometry.Scheme.IdealSheafData.coe_support_inter 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : ↑I.support ∩ ↑↑U = X.zeroLocus ↑(I.ideal U) ∩ ↑↑U - AlgebraicGeometry.Scheme.IdealSheafData.ideal_mono 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : Monotone AlgebraicGeometry.Scheme.IdealSheafData.ideal - AlgebraicGeometry.Scheme.IdealSheafData.ofIdeals_mono 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : Monotone AlgebraicGeometry.Scheme.IdealSheafData.ofIdeals - AlgebraicGeometry.Scheme.IdealSheafData.strictMono_ideal 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : StrictMono AlgebraicGeometry.Scheme.IdealSheafData.ideal - AlgebraicGeometry.Scheme.IdealSheafData.gci 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : GaloisCoinsertion AlgebraicGeometry.Scheme.IdealSheafData.ideal AlgebraicGeometry.Scheme.IdealSheafData.ofIdeals - AlgebraicGeometry.Scheme.IdealSheafData.le_def 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} : I ≤ J ↔ ∀ (U : ↑X.affineOpens), I.ideal U ≤ J.ideal U - AlgebraicGeometry.Scheme.IdealSheafData.ideal_bot 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : ⊥.ideal = ⊥ - AlgebraicGeometry.Scheme.IdealSheafData.ideal_top 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} : ⊤.ideal = ⊤ - AlgebraicGeometry.Scheme.IdealSheafData.ideal_inf 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} : (I ⊓ J).ideal = I.ideal ⊓ J.ideal - AlgebraicGeometry.Scheme.IdealSheafData.ideal_iInf 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {ι : Type u_1} (I : ι → X.IdealSheafData) [Finite ι] : (⨅ i, I i).ideal = ⨅ i, (I i).ideal - AlgebraicGeometry.Scheme.IdealSheafData.le_of_iSup_eq_top 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} {ι : Type u_1} (U : ι → ↑X.affineOpens) (hU : ⨆ i, ↑(U i) = ⊤) (H : ∀ (i : ι), I.ideal (U i) ≤ J.ideal (U i)) : I ≤ J - AlgebraicGeometry.Scheme.IdealSheafData.ideal_sup 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} : (I ⊔ J).ideal = I.ideal ⊔ J.ideal - AlgebraicGeometry.Scheme.IdealSheafData.le_ofIdeals_iff 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I : X.IdealSheafData} {J : (U : ↑X.affineOpens) → Ideal ↑(X.presheaf.obj (Opposite.op ↑U))} : I ≤ AlgebraicGeometry.Scheme.IdealSheafData.ofIdeals J ↔ I.ideal ≤ J - AlgebraicGeometry.Scheme.IdealSheafData.map_ideal' 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) {U V : ↑X.affineOpens} (h : Opposite.op ↑V ⟶ Opposite.op ↑U) : Ideal.map (CommRingCat.Hom.hom (X.presheaf.map h)) (I.ideal V) = I.ideal U - AlgebraicGeometry.Scheme.IdealSheafData.map_ideal 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) {U V : ↑X.affineOpens} (h : U ≤ V) : Ideal.map (CommRingCat.Hom.hom (X.presheaf.map (CategoryTheory.homOfLE h).op)) (I.ideal V) = I.ideal U - AlgebraicGeometry.Scheme.IdealSheafData.map_ideal_basicOpen 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (self : X.IdealSheafData) (U : ↑X.affineOpens) (f : ↑(X.presheaf.obj (Opposite.op ↑U))) : Ideal.map (CommRingCat.Hom.hom (X.presheaf.map (CategoryTheory.homOfLE ⋯).op)) (self.ideal U) = self.ideal (X.affineBasicOpen f) - AlgebraicGeometry.Scheme.IdealSheafData.ideal_iSup 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {ι : Type u_1} {I : ι → X.IdealSheafData} : (iSup I).ideal = ⨆ i, (I i).ideal - AlgebraicGeometry.Scheme.IdealSheafData.ideal_pow 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (n : ℕ) : (I ^ n).ideal = I.ideal ^ n - AlgebraicGeometry.Scheme.IdealSheafData.ideal_sSup 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {I : Set X.IdealSheafData} : (sSup I).ideal = sSup (AlgebraicGeometry.Scheme.IdealSheafData.ideal '' I) - AlgebraicGeometry.Scheme.IdealSheafData.le_of_isAffine 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} [AlgebraicGeometry.IsAffine X] {I J : X.IdealSheafData} (H : I.ideal ⟨⊤, ⋯⟩ ≤ J.ideal ⟨⊤, ⋯⟩) : I ≤ J - AlgebraicGeometry.Scheme.IdealSheafData.ideal_mul 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I J : X.IdealSheafData) : (I * J).ideal = I.ideal * J.ideal - AlgebraicGeometry.Scheme.IdealSheafData.ideal_biInf 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} {ι : Type u_1} (I : ι → X.IdealSheafData) {s : Set ι} (hs : s.Finite) : (⨅ i ∈ s, I i).ideal = ⨅ i ∈ s, (I i).ideal - AlgebraicGeometry.Scheme.IdealSheafData.mk 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (ideal : (U : ↑X.affineOpens) → Ideal ↑(X.presheaf.obj (Opposite.op ↑U))) (map_ideal_basicOpen : ∀ (U : ↑X.affineOpens) (f : ↑(X.presheaf.obj (Opposite.op ↑U))), Ideal.map (CommRingCat.Hom.hom (X.presheaf.map (CategoryTheory.homOfLE ⋯).op)) (ideal U) = ideal (X.affineBasicOpen f)) (supportSet : Set ↥X) (supportSet_eq_iInter_zeroLocus : supportSet = ⋂ U, X.zeroLocus ↑(ideal U) := by rfl) : X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.mkOfMemSupportIff 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (ideal : (U : ↑X.affineOpens) → Ideal ↑(X.presheaf.obj (Opposite.op ↑U))) (map_ideal_basicOpen : ∀ (U : ↑X.affineOpens) (f : ↑(X.presheaf.obj (Opposite.op ↑U))), Ideal.map (CommRingCat.Hom.hom (X.presheaf.map (CategoryTheory.homOfLE ⋯).op)) (ideal U) = ideal (X.affineBasicOpen f)) (supportSet : Set ↥X) (supportSet_inter : ∀ (U : ↑X.affineOpens), ∀ x ∈ ↑U, x ∈ supportSet ↔ x ∈ X.zeroLocus ↑(ideal U)) : X.IdealSheafData - AlgebraicGeometry.Scheme.ker_of_isAffine 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X Y : AlgebraicGeometry.Scheme} (f : X ⟶ Y) [AlgebraicGeometry.IsAffine Y] : AlgebraicGeometry.Scheme.Hom.ker f = AlgebraicGeometry.Scheme.IdealSheafData.ofIdealTop (RingHom.ker (CommRingCat.Hom.hom (AlgebraicGeometry.Scheme.Hom.appTop f))) - AlgebraicGeometry.Scheme.IdealSheafData.ideal_le_comap_ideal 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) {U V : ↑X.affineOpens} (h : U ≤ V) : I.ideal V ≤ Ideal.comap (CommRingCat.Hom.hom (X.presheaf.map (CategoryTheory.homOfLE h).op)) (I.ideal U) - AlgebraicGeometry.Scheme.IdealSheafData.equivOfIsAffine 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} [AlgebraicGeometry.IsAffine X] : X.IdealSheafData ≃+*o Ideal ↑(X.presheaf.obj (Opposite.op ⊤)) - AlgebraicGeometry.Scheme.IdealSheafData.equivOfIsAffine_apply 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} [AlgebraicGeometry.IsAffine X] (I : X.IdealSheafData) : AlgebraicGeometry.Scheme.IdealSheafData.equivOfIsAffine I = I.ideal ⟨⊤, ⋯⟩ - AlgebraicGeometry.Scheme.IdealSheafData.equivOfIsAffine_symm_apply 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Basic
{X : AlgebraicGeometry.Scheme} [AlgebraicGeometry.IsAffine X] (I : Ideal ↑(X.presheaf.obj (Opposite.op ⊤))) : AlgebraicGeometry.Scheme.IdealSheafData.equivOfIsAffine.symm I = AlgebraicGeometry.Scheme.IdealSheafData.ofIdealTop I - AlgebraicGeometry.Scheme.IdealSheafData.glueData 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : AlgebraicGeometry.Scheme.GlueData - AlgebraicGeometry.Scheme.IdealSheafData.subscheme 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : AlgebraicGeometry.Scheme - AlgebraicGeometry.Scheme.IdealSheafData.subschemeCover 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : I.subscheme.AffineOpenCover - AlgebraicGeometry.Scheme.IdealSheafData.glueDataObj 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : AlgebraicGeometry.Scheme - AlgebraicGeometry.Scheme.IdealSheafData.instIsPreimmersionSubschemeι 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : AlgebraicGeometry.IsPreimmersion I.subschemeι - AlgebraicGeometry.Scheme.IdealSheafData.instQuasiCompactSubschemeι 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : AlgebraicGeometry.QuasiCompact I.subschemeι - AlgebraicGeometry.Scheme.IdealSheafData.instIsPreimmersionGluedTo 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : AlgebraicGeometry.IsPreimmersion I.gluedTo - AlgebraicGeometry.Scheme.IdealSheafData.subschemeIso 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : I.subscheme ≅ I.glueData.glued - AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjPullback 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U V : ↑X.affineOpens) : AlgebraicGeometry.Scheme - AlgebraicGeometry.Scheme.IdealSheafData.subschemeι 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : I.subscheme ⟶ X - AlgebraicGeometry.Scheme.IdealSheafData.gluedTo 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : I.glueData.glued ⟶ X - AlgebraicGeometry.Scheme.IdealSheafData.ker_subschemeι 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : AlgebraicGeometry.Scheme.Hom.ker I.subschemeι = I - AlgebraicGeometry.Scheme.IdealSheafData.glueData_J 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : I.glueData.J = ↑X.affineOpens - AlgebraicGeometry.Scheme.IdealSheafData.glueData_U 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : I.glueData.U U = I.glueDataObj U - AlgebraicGeometry.Scheme.IdealSheafData.subschemeFunctor 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
(Y : AlgebraicGeometry.Scheme) : CategoryTheory.Functor Y.IdealSheafDataᵒᵖ (CategoryTheory.Over Y) - AlgebraicGeometry.Scheme.instFullOppositeIdealSheafDataOverSubschemeFunctor 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{Y : AlgebraicGeometry.Scheme} : (AlgebraicGeometry.Scheme.IdealSheafData.subschemeFunctor Y).Full - AlgebraicGeometry.Scheme.IdealSheafData.instIsEmptyCarrierCarrierCommRingCatSubschemeTop 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} : IsEmpty ↥⊤.subscheme - AlgebraicGeometry.Scheme.IdealSheafData.glueDataT 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U V : ↑X.affineOpens) : I.glueDataObjPullback U V ⟶ I.glueDataObjPullback V U - AlgebraicGeometry.Scheme.IdealSheafData.inclusion 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} (h : I ≤ J) : J.subscheme ⟶ I.subscheme - AlgebraicGeometry.Scheme.isIso_subschemeι_iff_eq_bot 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : CategoryTheory.IsIso I.subschemeι ↔ I = ⊥ - AlgebraicGeometry.Scheme.IdealSheafData.instIsPreimmersionGlueDataObjι 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : AlgebraicGeometry.IsPreimmersion (I.glueDataObjι U) - AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} (h : I ≤ J) (U : ↑X.affineOpens) : J.glueDataObj U ⟶ I.glueDataObj U - AlgebraicGeometry.Scheme.IdealSheafData.inclusion_id 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : AlgebraicGeometry.Scheme.IdealSheafData.inclusion ⋯ = CategoryTheory.CategoryStruct.id I.subscheme - AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjι 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : I.glueDataObj U ⟶ ↑↑U - AlgebraicGeometry.Scheme.instIsIsoSubschemeιBotIdealSheafData 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} : CategoryTheory.IsIso ⊥.subschemeι - AlgebraicGeometry.Scheme.IdealSheafData.glueData_t 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (i j : ↑X.affineOpens) : I.glueData.t i j = I.glueDataT i j - AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom_id 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I : X.IdealSheafData} (U : ↑X.affineOpens) : AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom ⋯ U = CategoryTheory.CategoryStruct.id (I.glueDataObj U) - AlgebraicGeometry.Scheme.kerAdjunction 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
(Y : AlgebraicGeometry.Scheme) : (AlgebraicGeometry.Scheme.IdealSheafData.subschemeFunctor Y).rightOp ⊣ Y.kerFunctor - AlgebraicGeometry.Scheme.IdealSheafData.glueData_V 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (ij : ↑X.affineOpens × ↑X.affineOpens) : I.glueData.V ij = I.glueDataObjPullback ij.1 ij.2 - AlgebraicGeometry.Scheme.IdealSheafData.subschemeFunctor_obj 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
(Y : AlgebraicGeometry.Scheme) (I : Y.IdealSheafDataᵒᵖ) : (AlgebraicGeometry.Scheme.IdealSheafData.subschemeFunctor Y).obj I = CategoryTheory.Over.mk (Opposite.unop I).subschemeι - AlgebraicGeometry.Scheme.IdealSheafData.inclusion_subschemeι 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} (h : I ≤ J) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.inclusion h) I.subschemeι = J.subschemeι - AlgebraicGeometry.Scheme.IdealSheafData.inclusion_id_assoc 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) {Z : AlgebraicGeometry.Scheme} (h : I.subscheme ⟶ Z) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.inclusion ⋯) h = h - AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjMap 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) {U V : ↑X.affineOpens} (h : U ≤ V) : I.glueDataObj U ⟶ I.glueDataObj V - AlgebraicGeometry.Scheme.IdealSheafData.inclusion_subschemeι_assoc 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} (h : I ≤ J) {Z : AlgebraicGeometry.Scheme} (h✝ : X ⟶ Z) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.inclusion h) (CategoryTheory.CategoryStruct.comp I.subschemeι h✝) = CategoryTheory.CategoryStruct.comp J.subschemeι h✝ - AlgebraicGeometry.Scheme.IdealSheafData.inclusion_comp 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I J K : X.IdealSheafData} (h₁ : I ≤ J) (h₂ : J ≤ K) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.inclusion h₂) (AlgebraicGeometry.Scheme.IdealSheafData.inclusion h₁) = AlgebraicGeometry.Scheme.IdealSheafData.inclusion ⋯ - AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom_comp 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I J K : X.IdealSheafData} (hIJ : I ≤ J) (hJK : J ≤ K) (U : ↑X.affineOpens) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom hJK U) (AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom hIJ U) = AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom ⋯ U - AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom_ι 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} (h : I ≤ J) (U : ↑X.affineOpens) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom h U) (I.glueDataObjι U) = J.glueDataObjι U - AlgebraicGeometry.Scheme.IdealSheafData.subschemeCover_map_subschemeι 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : CategoryTheory.CategoryStruct.comp (I.subschemeCover.f U) I.subschemeι = CategoryTheory.CategoryStruct.comp (I.glueDataObjι U) (↑U).ι - AlgebraicGeometry.Scheme.IdealSheafData.subSchemeCover_map_inclusion 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} (h : I ≤ J) (U : J.subschemeCover.I₀) : CategoryTheory.CategoryStruct.comp (J.subschemeCover.f U) (AlgebraicGeometry.Scheme.IdealSheafData.inclusion h) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom h U) (I.subschemeCover.f U) - AlgebraicGeometry.Scheme.IdealSheafData.inclusion_comp_assoc 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I J K : X.IdealSheafData} (h₁ : I ≤ J) (h₂ : J ≤ K) {Z : AlgebraicGeometry.Scheme} (h : I.subscheme ⟶ Z) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.inclusion h₂) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.inclusion h₁) h) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.inclusion ⋯) h - AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom_comp_assoc 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I J K : X.IdealSheafData} (hIJ : I ≤ J) (hJK : J ≤ K) (U : ↑X.affineOpens) {Z : AlgebraicGeometry.Scheme} (h : I.glueDataObj U ⟶ Z) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom hJK U) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom hIJ U) h) = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom ⋯ U) h - AlgebraicGeometry.Scheme.IdealSheafData.subSchemeCover_map_inclusion_assoc 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} (h : I ≤ J) (U : J.subschemeCover.I₀) {Z : AlgebraicGeometry.Scheme} (h✝ : I.subscheme ⟶ Z) : CategoryTheory.CategoryStruct.comp (J.subschemeCover.f U) (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.inclusion h) h✝) = CategoryTheory.CategoryStruct.comp (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom h U) (I.subschemeCover.f U)) h✝ - AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom_ι_assoc 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} (h : I ≤ J) (U : ↑X.affineOpens) {Z : AlgebraicGeometry.Scheme} (h✝ : ↑↑U ⟶ Z) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjHom h U) (CategoryTheory.CategoryStruct.comp (I.glueDataObjι U) h✝) = CategoryTheory.CategoryStruct.comp (J.glueDataObjι U) h✝ - AlgebraicGeometry.Scheme.IdealSheafData.subschemeFunctor_map 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
(Y : AlgebraicGeometry.Scheme) {I J : Y.IdealSheafDataᵒᵖ} (h : I ⟶ J) : (AlgebraicGeometry.Scheme.IdealSheafData.subschemeFunctor Y).map h = CategoryTheory.Over.homMk (AlgebraicGeometry.Scheme.IdealSheafData.inclusion ⋯) ⋯ - AlgebraicGeometry.Scheme.IdealSheafData.isOpenImmersion_glueDataObjMap 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) {V : ↑X.affineOpens} (f : ↑(X.presheaf.obj (Opposite.op ↑V))) : AlgebraicGeometry.IsOpenImmersion (I.glueDataObjMap ⋯) - AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjMap_glueDataObjι 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) {U V : ↑X.affineOpens} (h : U ≤ V) : CategoryTheory.CategoryStruct.comp (I.glueDataObjMap h) (I.glueDataObjι V) = CategoryTheory.CategoryStruct.comp (I.glueDataObjι U) (X.homOfLE h) - AlgebraicGeometry.Scheme.IdealSheafData.gluedHomeo 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : ↥I.glueData.glued ≃ₜ ↥I.support - AlgebraicGeometry.Scheme.IdealSheafData.range_subschemeι 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : Set.range ⇑I.subschemeι = ↑I.support - AlgebraicGeometry.Scheme.IdealSheafData.opensRange_subschemeCover_map 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : AlgebraicGeometry.Scheme.Hom.opensRange (I.subschemeCover.f U) = (TopologicalSpace.Opens.map I.subschemeι.base).obj ↑U - AlgebraicGeometry.Scheme.IdealSheafData.range_gluedTo 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : Set.range ⇑I.gluedTo = ↑I.support - AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjMap_glueDataObjι_assoc 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) {U V : ↑X.affineOpens} (h : U ≤ V) {Z : AlgebraicGeometry.Scheme} (h✝ : ↑↑V ⟶ Z) : CategoryTheory.CategoryStruct.comp (I.glueDataObjMap h) (CategoryTheory.CategoryStruct.comp (I.glueDataObjι V) h✝) = CategoryTheory.CategoryStruct.comp (I.glueDataObjι U) (CategoryTheory.CategoryStruct.comp (X.homOfLE h) h✝) - AlgebraicGeometry.Scheme.IdealSheafData.subschemeι_apply 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (x : ↥I.subscheme) : I.subschemeι x = ↑x - AlgebraicGeometry.Scheme.IdealSheafData.range_glueDataObjι_ι_eq_support_inter 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : Set.range ⇑(CategoryTheory.CategoryStruct.comp (I.glueDataObjι U) (↑U).ι) = ↑I.support ∩ ↑↑U - AlgebraicGeometry.Scheme.kerAdjunction_unit_app 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
(Y : AlgebraicGeometry.Scheme) (I : Y.IdealSheafData) : Y.kerAdjunction.unit.app I = CategoryTheory.eqToHom ⋯ - AlgebraicGeometry.Scheme.kerAdjunction_counit_app 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
(Y : AlgebraicGeometry.Scheme) (f : (CategoryTheory.Over Y)ᵒᵖ) : Y.kerAdjunction.counit.app f = (CategoryTheory.Over.homMk (AlgebraicGeometry.Scheme.Hom.toImage (Opposite.unop f).hom) ⋯).op - AlgebraicGeometry.Scheme.IdealSheafData.glueData_f 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (i j : ↑X.affineOpens) : I.glueData.f i j = CategoryTheory.Limits.pullback.fst (I.glueDataObjι (i, j).1) (X.homOfLE ⋯) - AlgebraicGeometry.Scheme.IdealSheafData.opensRange_glueDataObjMap 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) {V : ↑X.affineOpens} (f : ↑(X.presheaf.obj (Opposite.op ↑V))) : AlgebraicGeometry.Scheme.Hom.opensRange (I.glueDataObjMap ⋯) = (TopologicalSpace.Opens.map (I.glueDataObjι V).base).obj ((TopologicalSpace.Opens.map (↑V).ι.base).obj (X.basicOpen f)) - AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjι_ι 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : CategoryTheory.CategoryStruct.comp (I.glueDataObjι U) (↑U).ι = CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Spec.map (CommRingCat.ofHom (Ideal.Quotient.mk (I.ideal U)))) (AlgebraicGeometry.IsAffineOpen.fromSpec ⋯) - AlgebraicGeometry.Scheme.IdealSheafData.subschemeObjIso 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : I.subscheme.presheaf.obj (Opposite.op ((TopologicalSpace.Opens.map I.subschemeι.base).obj ↑U)) ≅ CommRingCat.of (↑(X.presheaf.obj (Opposite.op ↑U)) ⧸ I.ideal U) - AlgebraicGeometry.Scheme.IdealSheafData.glueDataT'Aux 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U V W U₀ : ↑X.affineOpens) (hU₀ : ↑U ⊓ ↑W ≤ ↑U₀) : CategoryTheory.Limits.pullback (CategoryTheory.Limits.pullback.fst (I.glueDataObjι U) (X.homOfLE ⋯)) (CategoryTheory.Limits.pullback.fst (I.glueDataObjι U) (X.homOfLE ⋯)) ⟶ I.glueDataObjPullback V U₀ - AlgebraicGeometry.Scheme.IdealSheafData.subschemeι_app_surjective 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : Function.Surjective ⇑(CategoryTheory.ConcreteCategory.hom (AlgebraicGeometry.Scheme.Hom.app I.subschemeι ↑U)) - AlgebraicGeometry.Scheme.IdealSheafData.range_glueDataObjι_ι 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : Set.range ⇑(CategoryTheory.CategoryStruct.comp (I.glueDataObjι U) (↑U).ι) = X.zeroLocus ↑(I.ideal U) ∩ ↑↑U - AlgebraicGeometry.Scheme.IdealSheafData.glueData_t' 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (i j k : ↑X.affineOpens) : I.glueData.t' i j k = CategoryTheory.Limits.pullback.lift (I.glueDataT'Aux (i, j).1 (i, j).2 (i, k).2 (j, k).2 ⋯) (I.glueDataT'Aux (i, j).1 (i, j).2 (i, k).2 (j, i).2 ⋯) ⋯ - AlgebraicGeometry.Scheme.IdealSheafData.range_glueDataObjι 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : Set.range ⇑(I.glueDataObjι U) = ⇑(AlgebraicGeometry.IsAffineOpen.isoSpec ⋯).inv '' PrimeSpectrum.zeroLocus ↑(I.ideal U) - AlgebraicGeometry.Scheme.IdealSheafData.glueDataObjCarrierIso 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : ↑(I.glueDataObj U).toPresheafedSpace ≅ TopCat.of ↑(X.zeroLocus ↑(I.ideal U) ∩ ↑↑U) - AlgebraicGeometry.Scheme.IdealSheafData.subschemeι_app 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : AlgebraicGeometry.Scheme.Hom.app I.subschemeι ↑U = CategoryTheory.CategoryStruct.comp (CommRingCat.ofHom (Ideal.Quotient.mk (I.ideal U))) (I.subschemeObjIso U).inv - AlgebraicGeometry.Scheme.IdealSheafData.ker_subschemeι_app 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : RingHom.ker (CommRingCat.Hom.hom (AlgebraicGeometry.Scheme.Hom.app I.subschemeι ↑U)) = I.ideal U - AlgebraicGeometry.Scheme.IdealSheafData.isLocalization_away 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) {U V : ↑X.affineOpens} (h : U ≤ V) (f : ↑(X.presheaf.obj (Opposite.op ↑V))) (hU : U = X.affineBasicOpen f) : IsLocalization.Away ((Ideal.Quotient.mk (I.ideal V)) f) (↑(X.presheaf.obj (Opposite.op ↑U)) ⧸ I.ideal U) - AlgebraicGeometry.Scheme.IdealSheafData.ideal_le_ker_glueDataObjι 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U V : ↑X.affineOpens) : I.ideal V ≤ RingHom.ker (CommRingCat.Hom.hom (CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.Scheme.Hom.app (↑U).ι ↑V) (AlgebraicGeometry.Scheme.Hom.app (I.glueDataObjι U) ((TopologicalSpace.Opens.map (↑U).ι.base).obj ↑V)))) - AlgebraicGeometry.Scheme.IdealSheafData.ker_glueDataObjι_appTop 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Subscheme
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (U : ↑X.affineOpens) : RingHom.ker (CommRingCat.Hom.hom (AlgebraicGeometry.Scheme.Hom.appTop (I.glueDataObjι U))) = Ideal.comap (CommRingCat.Hom.hom (↑U).topIso.hom) (I.ideal U) - AlgebraicGeometry.IsClosedImmersion.instSubschemeι 📋 Mathlib.AlgebraicGeometry.Morphisms.ClosedImmersion
{X : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) : AlgebraicGeometry.IsClosedImmersion I.subschemeι - AlgebraicGeometry.IsClosedImmersion.isIso_iff_ker_eq_bot 📋 Mathlib.AlgebraicGeometry.Morphisms.ClosedImmersion
{X Y : AlgebraicGeometry.Scheme} {f : X ⟶ Y} [AlgebraicGeometry.IsClosedImmersion f] : CategoryTheory.IsIso f ↔ AlgebraicGeometry.Scheme.Hom.ker f = ⊥ - AlgebraicGeometry.IsClosedImmersion.lift 📋 Mathlib.AlgebraicGeometry.Morphisms.ClosedImmersion
{X Y Z : AlgebraicGeometry.Scheme} (f : X ⟶ Z) (g : Y ⟶ Z) [AlgebraicGeometry.IsClosedImmersion f] (H : AlgebraicGeometry.Scheme.Hom.ker f ≤ AlgebraicGeometry.Scheme.Hom.ker g) : Y ⟶ X - AlgebraicGeometry.IsClosedImmersion.isIso_lift 📋 Mathlib.AlgebraicGeometry.Morphisms.ClosedImmersion
{Z₁ Z₂ X : AlgebraicGeometry.Scheme} (i₁ : Z₁ ⟶ X) (i₂ : Z₂ ⟶ X) [AlgebraicGeometry.IsClosedImmersion i₁] [AlgebraicGeometry.IsClosedImmersion i₂] (h : AlgebraicGeometry.Scheme.Hom.ker i₁ = AlgebraicGeometry.Scheme.Hom.ker i₂) : CategoryTheory.IsIso (AlgebraicGeometry.IsClosedImmersion.lift i₁ i₂ ⋯) - AlgebraicGeometry.IsClosedImmersion.lift_fac 📋 Mathlib.AlgebraicGeometry.Morphisms.ClosedImmersion
{X Y Z : AlgebraicGeometry.Scheme} (f : X ⟶ Z) (g : Y ⟶ Z) [AlgebraicGeometry.IsClosedImmersion f] (H : AlgebraicGeometry.Scheme.Hom.ker f ≤ AlgebraicGeometry.Scheme.Hom.ker g) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.IsClosedImmersion.lift f g H) f = g - AlgebraicGeometry.IsClosedImmersion.isIso_of_ker_eq 📋 Mathlib.AlgebraicGeometry.Morphisms.ClosedImmersion
{Z₁ Z₂ X : AlgebraicGeometry.Scheme} (i₁ : Z₁ ⟶ X) (i₂ : Z₂ ⟶ X) [AlgebraicGeometry.IsClosedImmersion i₁] [AlgebraicGeometry.IsClosedImmersion i₂] (f : Z₁ ⟶ Z₂) (h : CategoryTheory.CategoryStruct.comp f i₂ = i₁) (h' : AlgebraicGeometry.Scheme.Hom.ker i₁ = AlgebraicGeometry.Scheme.Hom.ker i₂) : CategoryTheory.IsIso f - AlgebraicGeometry.IsClosedImmersion.lift_fac_assoc 📋 Mathlib.AlgebraicGeometry.Morphisms.ClosedImmersion
{X Y Z : AlgebraicGeometry.Scheme} (f : X ⟶ Z) (g : Y ⟶ Z) [AlgebraicGeometry.IsClosedImmersion f] (H : AlgebraicGeometry.Scheme.Hom.ker f ≤ AlgebraicGeometry.Scheme.Hom.ker g) {Z✝ : AlgebraicGeometry.Scheme} (h : Z ⟶ Z✝) : CategoryTheory.CategoryStruct.comp (AlgebraicGeometry.IsClosedImmersion.lift f g H) (CategoryTheory.CategoryStruct.comp f h) = CategoryTheory.CategoryStruct.comp g h - AlgebraicGeometry.IsClosedImmersion.overEquivIdealSheafData 📋 Mathlib.AlgebraicGeometry.Morphisms.ClosedImmersion
(X : AlgebraicGeometry.Scheme) : (CategoryTheory.MorphismProperty.Over @AlgebraicGeometry.IsClosedImmersion ⊤ X)ᵒᵖ ≌ X.IdealSheafData - AlgebraicGeometry.instIsClosedImmersionInclusion 📋 Mathlib.AlgebraicGeometry.Morphisms.Separated
{X : AlgebraicGeometry.Scheme} {I J : X.IdealSheafData} (h : I ≤ J) : AlgebraicGeometry.IsClosedImmersion (AlgebraicGeometry.Scheme.IdealSheafData.inclusion h) - AlgebraicGeometry.Scheme.IdealSheafData.comap 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Functorial
{X Y : AlgebraicGeometry.Scheme} (I : Y.IdealSheafData) (f : X ⟶ Y) : X.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.map 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Functorial
{X Y : AlgebraicGeometry.Scheme} (I : X.IdealSheafData) (f : X ⟶ Y) : Y.IdealSheafData - AlgebraicGeometry.Scheme.IdealSheafData.comap_id 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Functorial
{Z : AlgebraicGeometry.Scheme} (I : Z.IdealSheafData) : I.comap (CategoryTheory.CategoryStruct.id Z) = I - AlgebraicGeometry.Scheme.IdealSheafData.map_id 📋 Mathlib.AlgebraicGeometry.IdealSheaf.Functorial
{Z : AlgebraicGeometry.Scheme} (I : Z.IdealSheafData) : I.map (CategoryTheory.CategoryStruct.id Z) = I
About
Loogle searches Lean and Mathlib definitions and theorems.
You can use Loogle from within the Lean4 VSCode language extension
using the Loogle command from the command palette. You can also try the
#loogle command from LeanSearchClient,
the CLI version, the Loogle
VS Code extension, the lean.nvim
integration or the Zulip bot.
Usage
Loogle finds definitions and lemmas in various ways:
By constant:
🔍Real.sin
finds all lemmas whose statement somehow mentions the sine function.By lemma name substring:
🔍"differ"
finds all lemmas that have"differ"somewhere in their lemma name.By subexpression:
🔍_ * (_ ^ _)
finds all lemmas whose statements somewhere include a product where the second argument is raised to some power.The pattern can also be non-linear, as in
🔍Real.sqrt ?a * Real.sqrt ?aIf the pattern has parameters, they are matched in any order. Both of these will find
List.map:
🔍(?a -> ?b) -> List ?a -> List ?b
🔍List ?a -> (?a -> ?b) -> List ?bBy main conclusion:
🔍|- tsum _ = _ * tsum _
finds all lemmas where the conclusion (the subexpression to the right of all→and∀) has the given shape.As before, if the pattern has parameters, they are matched against the hypotheses of the lemma in any order; for example,
🔍|- _ < _ → tsum _ < tsum _
will findtsum_lt_tsumeven though the hypothesisf i < g iis not the last.You can filter for definitions vs theorems: Using
⊢ (_ : Type _)finds all definitions which provide data while⊢ (_ : Prop)finds all theorems (and definitions of proofs).
If you pass more than one such search filter, separated by commas
Loogle will return lemmas which match all of them. The
search
🔍 Real.sin, "two", tsum, _ * _, _ ^ _, |- _ < _ → _
would find all lemmas which mention the constants Real.sin
and tsum, have "two" as a substring of the
lemma name, include a product and a power somewhere in the type,
and have a hypothesis of the form _ < _ (if
there were any such lemmas). Metavariables (?a) are
assigned independently in each filter.
The #lucky button will directly send you to the
documentation of the first hit.
Source code
You can find the source code for this service at https://github.com/nomeata/loogle. The https://loogle.lean-lang.org/ service is provided by the Lean FRO. Please review the Lean FRO Terms of Use and Privacy Policy.
This is Loogle revision 9f11169 serving mathlib revision 69fae59