Points tensor without vanishing in the ind-completion #
RS.Classical.Deligne.PointTensor proves, in an abelian ℂ-linear
rigid monoidal category with scalar unit, that the tensor of two
nonzero points of the unit is nonzero. This file carries that
statement across the embedding C ⥤ Ind C to the whole
ind-completion — the fact Deligne asserts in 2.11 when he says the
algebra 𝔸 is not zero, since the unit of a tensor product of
algebras is (λ_ _).inv ≫ (η ⊗ₘ η).
The route is compactness, applied twice.
RS.indOfTensorIso_hom_natural— the embedding-tensor comparison is natural in both variables at once, assembled from the two one-variable naturalities ofRS.Classical.Deligne.IndTensorExact;RS.exists_indOf_point— a point of an embedded object is the embedding of a point downstairs, and vanishes only if that one does (RS.indOfUnitIsoandRS.indOf_map_eq_zero_iff);RS.indTensorHom_point_ne_zero_indOf— the statement for two embedded objects, obtained by conjugating with the unit comparisonRS.indOfUnitIsoand the embedding-tensor comparison and appealing toRS.tensorHom_point_ne_zerodownstairs;RS.tensor_unit_point_stage_left/_right— the finite-stage engine: if the tensor of a point with a point of a filtered colimit vanishes, it already vanishes at some stage of the diagram. Tensoring preserves filtered colimits (RS.tensorLeft_ind_preservesFilteredColimits) and the unit ofInd Cis compact (RS.unit_colimit_eq_zero_iff);RS.indTensorHom_point_ne_zero_indOf_left— one embedded factor and one arbitrary, by presenting the second factor as a filtered colimit of embedded objects;RS.indTensorHom_point_ne_zero— both factors arbitrary, by the same descent in the first factor.
The filtered-colimit presentations are Mathlib's: Ind.presentation
and Ind.colimitPresentationCompYoneda exhibit every ind-object as
the colimit of X.presentation.F ⋙ Ind.yoneda over the filtered
index category X.presentation.I.
Transport of a vanishing composite along a preserved colimit #
If a morphism into the image of a stage dies against the image
of a colimit injection, it dies against the colimit injection of the
transported diagram. Stated with the domain written as
F.obj (D.obj i) so that every composite below is type-correct
without unfolding Functor.comp.
The embedding-tensor comparison in both variables #
Naturality of the embedding-tensor comparison in both
variables at once: RS.indOfTensorIso intertwines the tensor of
two embedded morphisms with the embedding of their tensor. The
two one-variable naturalities compose along
MonoidalCategory.tensorHom_def.
Both factors embedded #
A point of an embedded object comes from downstairs: read
through the unit comparison RS.indOfUnitIso, it is the embedding of
a point of the object in C, and that point is nonzero whenever the
original is.
The tensor of two nonzero points of embedded objects is
nonzero: the unit comparison and the embedding-tensor comparison
identify it with the embedding of the corresponding tensor
downstairs, which is nonzero by RS.tensorHom_point_ne_zero.
The finite-stage engine #
Vanishing at a stage, second factor: if the tensor of a
point of M with a point of a filtered colimit that factors through
the stage i vanishes, then it already vanishes after some
transition map out of i. Tensoring on the left preserves the
filtered colimit, and the unit of Ind C is compact.
Vanishing at a stage, first factor: the mirror image of
RS.tensor_unit_point_stage_left, using that tensoring on the right
preserves filtered colimits.
The general statement #
One embedded factor: the tensor of a nonzero point of an embedded object with a nonzero point of an arbitrary ind-object is nonzero. Present the second factor as a filtered colimit of embedded objects, factor the point through a stage, and use that a vanishing tensor vanishes at a stage.
The tensor of two nonzero points of the ind-completion is
nonzero (Deligne 2.11, the nonvanishing of the algebra 𝔸).
Present the first factor as a filtered colimit of embedded objects,
factor the point through a stage, and appeal to
RS.indTensorHom_point_ne_zero_indOf_left.