This paper introduces fundamental concepts in category theory, explores topology algebras and sheaves, and demonstrates how to reconstruct sheaf structures and express topological spaces categorically, linking topology and geometry.
Contribution
It presents a novel categorical framework for understanding sheaves, topology algebras, and their interrelations, offering new insights into the structure of topological spaces.
Findings
01
Restoration of sheaf structures from stalks
02
Categorical expression of topological spaces
03
Unified perspective on topology and geometry
Abstract
We firstly introduce some key concepts in category theory, such as quotient category, completion of limits, Mor category, and so on; then give the concept of topology algebras and sheaves, and discuss how to restore the structue of sheaves from their stalks; lastly, we introduce the sheaf-theoretical expression for topological spaces, and rediscribe some essential items in topology and geometry by defining a kind of generally existing category sheaves.
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Analysis Techniques
Full text
Some Ideas on Categories and Sheaves
Dezhao Zhang
Abstract
We firstly introduce some key concepts in category theory, such as quotient category, completion of limits, Mor category, and so on; then give the concept of topology algebras and sheaves, and discuss how to restore the structue of sheaves from their stalks; lastly, we introduce the sheaf-theoretical expression for topological spaces, and rediscribe some essential items in topology and geometry by defining a kind of generally existing category sheaves.
If readers are familiar with the concepts of sheaves, (differential) manifolds, schemes and bundles, then we will naturally find the similarity between these structures, that is, they all introduce some kind of concept about gluing, and this article is making a beneficial attempt to explain this phenomenon. To achieve the goal, we firstly develop the concepts of quotient categories, completion of (co)limits, the sheaf-theoretical definition of topological spaces and so on.
2 Basic Knowledge:Categories, Functors, Natural Transformations and Limits
To discuss the mostly used categories in ordinary math, we need push sets forward to the concept of classes.
To avoid the appearance of Russell’s paradox, ZFC(Zermelo-Fraenkel-Skolem)axiomatic set theory system adopts the axiom of comprehension, which claims that the method of defining sets by any first-order logic languege must rely on existing sets. In this condition, we cannot define mathematical object as ”set of all sets” . Luckily, we can use axioms of classes to discribe these objects, such as the true class(class which is not set) of all sets. The behavioral pattern of classes is much similar to sets, so readers can naturally follow ways in set theory to handle classes, and use set-theretical terms and notations.
Definition 2.1
Let Ob a class, and {MorA,B}A,B∈Ob a family of classes which use Ob×Ob as index,then we call C=(Ob,{MorA,B}A,B∈Ob) a graph. If for all A,B,C∈Ob, there exists a binary function comp:MorA,B×MorB,C→MorA,C satisfies:
1.
for all A∈Ob, there exists identity idA∈MorA,A, namely ∀f∈MorA,B,comp(idA,f)=f;∀g∈MorB,A,comp(g,idA)=g;
If C=(Ob,{MorA,B}A,B∈Ob) is a category, then Ob and Mor=⋃A,B∈ObMorA,B can be recorded as ObC and MorC, which are respectively called the object class and morphism class of C. MorA,B can be recorded as MorC[A,B], C[A,B] or HomC[A,B], which is called the morphism class from A to B. Instinctively speaking, categories can be regarded as a kind of structure composed of some ”points” and some ”arrows” between them.
Notice that, there exist two functions dom,cod:MorC→ObC, if f∈HomC[A,B], then dom(f)=A,cod(f)=B, A and B are respectively the domain and codomain of f. comp is called the composition of morphisms, to be convenient, we mark comp(f,g) as f∘g. So a category can be equivalently written as six-truples (Ob,Mor,dom,cod,comp,id).
For convenience, in the condition of not causing ambiguity or not emphasizing morphisms, A∈ObC is recorded as A∈C.
A number of set-theoretical structure has its category, such as Set, Grp, Rng, Top, K−Vect, Mon, Diff, and so on.
Notice
We tacitly acknowledge the existence of identity in all pictures below.
Definition 2.2(special categories)
1.the empty category
whose object class and morphism class is empty set.
2.small categories
whose object class and morphism class is a set.
2’.locally small categories
each of whose hom-class is a set.
3.discrete categories
whose morphisms are only identity.
4.single category
a category which has only one object A and one morphism idA, which can be recorded as (A,idA).
5.simple categories
each of whose hom-class has one morphism at most.
Definition 2.3
Let C a category. We call subgraph D of C a commutiative diagram, if all paths in D(that is a morphism-chain (f0,...,fn) which satisfies cod(fi)=dom(fi+1)) with the same start and end objects are composed to the same morphism.
As for operations on categories such as subcategories D⊆C, product categories C×D, coproduct categories C⊔D or C+D, and opposite or dual categories Cop, we don’t specially introduce them in this article.
When talking about some issues in category theory, we usually set up a category as background or domain of discourse. If P(C) is a concept/proposition/property about the domain of discourse C, then the concept/proposition/property P(Cop) is called the dual concept/proposition/property of P(C), written as Pop(C).
Definition 2.4(special object and morphism)
1.
A monomorphism(or mono) is left-cancellative morphism, an epimorphism(or epic) is a right-cancellative morphism, which are dual concepts; a bimorphism is both a mono and an epic.
2.
A isomorphism(or iso) has an inverse.
3.
The object is called initial object that if each hom-class from all objects to it has only one morphism, the object is called terminal object that if each hom-class from all objects to it has only one morphism, which are dual concepts; the null object is both an initial and terminal object.
Proposition 2.1
1.
An iso has only one inverse.
2.
The initial and terminal object is unique in the sense of isomorohism.
Definition 2.5
Let C,D are categories. If pair of functions F=(FOb:ObC→ObD,FMor:MorC→MorD) satisfies
1.
dom(FMor(f))=FOb(domf),cod(FMor(f))=FOb(codf);
2.
FMor(idA)=idFOb(A);
3.
FMor(f∘g)=FMor(f)∘FMor(g);
that is, preserve dom, cod, id and comp, then we call it a (convariant) functor from C to D, recorded as F:C→D. And a contravariant functor from C to D is a convariant functor from Cop to D.
For convenience, we directly mark FOb(A) and FMor(f) as F(A) and F(f). Note that the function FMor:MorC→MorD can be decomposed to functions FMor∣[A,B]:C[A,B]→D[F(A),F(B)].
Definition 2.5’
Let C a category. If FOb and FMor is identity function of ObC and MorC, then obviously, F=(FOb,FMor) is a functor, called the identity functor idC of C.
Definition 2.5”
Let C,D,E categories, F:C→D,G:D→E functors. Then obviously, pair of functions G∘F:=(GOb∘FOb,GMor∘FMor) is a functor, called the composition of F and G.
Now we see, functors act similarly as morphisms. In fact, use small categories as objects, and functores between them as morphisms, we get a category Cat, called the small catrgory category. Meanwhile, If we cancel the requirement ”small”, we get a ”category” CAT, merely its object and morphism ”class” are 2-classes, however its behavior is still similar, so we call it the big category category.
Definition 2.6(special functors)
Let F:C→D a functor, it is
1.
faithful if each FMor∣[A,B] is an injection;
2.
injective or an embedding if is faithful and FOb is an injection;
3.
full if each FMor∣[A,B] is a surjection;
4.
dense if FOb is a surjection in the sense of iso, that is ∀B∈C,∃A∈C s.t. B≅F(A).
5.
surjective or a projection if is full and FOb is a surjection.
Attention
We will adopt the form of anonymous function as F:={A↦F(A)f↦F(f) to discribe functor F.
Definition 2.7
Let F,G:C→D functors. If function α:ObC→MorD makes G(f)∘α(A)=α(B)∘F(f), then we call it a natural transformation (or nat) from F to G, recorded as α:F→G.
Attention, a simple function ObC→MorD may be natural transformations between different functors.
Definition 2.7’
Let F:C→D a functor. If α:ObC→MorD:=A↦idF(A), then obviously, it is a nat, called the identity nat idF of F.
Defination 2.7”
Let F,G,H:C→D functors, α:F→G,β:G→H nats. Then obviously, function β∘α:=A↦β(A)∘α(A) is a nat from F to H, called the composition, ∘-product or horizontal product of α and beta.
Now we see, nats act similarly as morphisms. In fact, use functors from C to D as objects, and nats between them as morphisms, we get a catogory Funct(C,D) or DC. The existence of category CAT and Funct(C,D) remind us that any conclusion and concepts in category theory can be used in them, such as iso functor and iso nat (or natural iso), we don’t construct them here.
Proposition 2.2
Union and intersection of subcategories is a subcategory. A functor’s restriction on a subcategory is a functor.
To discuss limits, for given background C, we firstly introduce the diagonal functor ΔJ:C→CJ, where ΔJA is the only functor from J to (A,idA), nat ΔJ(f:A→B):ΔJA→ΔJB making that for all j∈J , it has (ΔJf)(j)=f. When J is clear, we directly write it as Δ.
Definition 2.8Ob
Let J,C∈CAT, functor F:J→C. Then a cone on F is a two-tuples (K∈ObC,ϵ:ΔK→F), K is called cone vertex.
Definition 2.8Mor
Let (K,ϵ) and (K′,ϵ′)F-cones, a cone morphism from (K,ϵ) to (K′,ϵ′) is a nat with the form as Δf:ΔK→ΔK′ which makes ϵ′∘Δf=ϵ.
Easy to know, cone morphism φ:ΔK′→ΔK gives a morphism φ∗∈HomC(K′,K) making that φ=Δ(φ∗); conversly, morphism f∈HomC(K′,K) induces nat Δf:ΔK→ΔK, and a cone (K′,ϵ∘Δf), and Δf is a cone morphism between them.
Attention, the same nat can be cone morphisms between different cones. Easy to prove that all F-cone and cone morphisms between them form a category conF, called the F-cone category. cocone and cocone morphism is dual concept of cone and cone morphism in the background CJ, F-cocone category is written as conF.
Definition 2.9
The limit of F is an F-con (L,δ), which makes that for each F-cone (K,ϵ), there exists sole con morphism Δf:ΔK→ΔL, we write (L,δ) as ⟵limF. Colimit is the dual concept of limit, recorded as ⟶limF.
We see that the limit of F is merely the terminal object in conF, and its colimit is just the initial object in conF. The only cone morphism from F-cone (K,ϵ) to ⟵limF=(L,δ) (that is Δf in Definition 2.10) is recorded as ⟵limdϵ. In the condition that not causing ambiguity or not emphasizing nats, we may call the limit its vertex as well. Let F,G:JC have limits (L,δ) and (L′.δ′), and a nat α:F→G, then there is naturally a morphism ⟵limα:L→L′:=⟵limd(α∘δ), so we get a partial functor ⟵lim:CJ⇝C, if C is J-complete, then ⟵lim is the right adjoint of Δ.
Theorem 2.1(properties of limits)
Suppose the limit of F exists and is (L,δ).
1.
⟵limF is unique in the sense of isomorphicness, that is, if (L,δ) and (L′,δ′) are both limits of F, then there exists iso f:L→L′ making that Δf:(L,δ)→(L′,δ′).
2.
{δ(A)}A∈J are global monomorphisms, that is, for any two morphisms f,g which codf=codg=L, if for all A∈J, δ(A)∘f=δ(A)∘g, then f=g.
3.
There exists a one-to-one correspondence between F-cones and the morphisms whose codomains are L. Theorem 4.2.1 is a more general result.
The proof is easy. These results have dual version of colimits.
Example 2.1 (special limits)
1.
Let J a discrete small category, the limit of F:J→C is (L,δ), then we call L as the product of {F(A)}A∈J, recorded as A∈J∏F(A), and {δ(A)}A∈J are called projection, recorded as pA or πA; the colimit of F:J→C is (L,δ), then we call L as the coproduct or sum of {F(A)}A∈J, recorded as A∈J∐F(A), and {δ(A)}A∈J are called embedding, recorded as iA or μA.
2.
Let J the category in left side below, the limit of F:J→C is (L,δ), then we call δ(A) as the equalizer of F(f1) and F(f2), recorded as equ(F(f1),F(f2)); the colimit of F:J→C is (L,δ), then we call δ(B) as the coequalizer of F(f1) and F(f2), recorded as coequ(F(f1),F(f2)).
[TABLE]
Attention that we don’t particularly emphasize the morphism δ(A), because it can be derived from other mophismes.
3.
Let J the wedge-shaped category in left side below. he limit of F:J→C is (L,δ), then we call (δ(B1),δ(B2)) as the pullback of (F(f1),F(f2)); the colimit of F:Jop→C is (L,δ), then we call (δ(B1op),δ(B2op)) as the pushout of (F(f1op),F(f2op)).
[TABLE]
Attention that we don’t particularly emphasize the morphism δ(A), because it can be derived from other mophismes.
4.
Let us update J in 3. to the category in left side below (we call it multi-wedge-shaped category), there are two types of objects in J: {Bα} and {Aαβ}, satisfy Aαβ=Aαβ and Aαα=Bα, and for any α,β, there exists unique fαβ:Bα→Aαβ, naturally fαα=idBα. Then the corresponding concepts are updated to paired-pushout.
[TABLE]
Attention that we don’t particularly emphasize the morphism δ(Aαβ), because it can be derived from other mophismes, in addition pullback and pushout are not dual concepts.
A common situation is that F:J→C is an embedding, then we can regard J as a subcategory of C, it’s a convenient viewpoint.
Example 2.2(limits in concrete categories)
1.
The product in Set is just Cartesian product,and the coproduct is disjoint union; the product in Grp is direct product, and coproduct is free product; the product in R−Mod is direct product,and the coproduct is direct sum; and so on.
2.
Let Set be the background. In the picture as below, i1,i2,i3,i4 are all inclusion maps, then (i1,i2)=pullback(i3,i4) and (i3,i4)=pushout(i1,i2). In fact, if we change A∪B to a set C⊇A∪B, then (i1,i2)=pullback(i3,i4) still applies.
[TABLE]
Theorem 2.2 (the first picture of limits)
Let J,C categories, functor F:J→C. Then ⟵limF=(L,p∘Δ(e)), where e=equ\Bigl{(}\prod\limits_{f\in\mathrm{Mor}\mathcal{J}}p_{cod(f)},\prod\limits_{f\in\mathrm{Mor}\mathcal{J}}F(f)\circ p_{dom(f)}\Bigr{)}\in Hom(L,\prod\limits_{A\in\mathcal{J}}F(A)). We have a similar conclusion for colimits.
The Theorem directly declares that any limits can be expressed by products and equalizers, instinctively speaking, it desposes limits to ”object” part(products) and ”morphism” part(equalizers).
Theorem 2.3 (the second picture of limits)
Let J,C categories, functor F:J→C. Then ⟵limF=(L,δ) if and only if
1.
All hom-classes HomconF((K,ϵ),(L,δ)) are not empty;
2.
{δ(A)}A∈J are global monomorphisms.
There are still much content in category theory, readers are advised to consult related books.
3 Quotient Category and Sketch
3.1 Quotient Category
Definition 3.1.1
Let ∼Ob an equivalence relation on ObC, and ∼Mor an equivalence relation on MorC, then we call the pair ∼=(∼Ob,∼Mor) a precategorical equivelance relation if it satisfies
1.(dom/cod-preservation)
f∼Morg⇒domf∼Obdomgandcodf∼Obcodg;
2.(id-preservation)
A∼ObB⇒idA∼MoridB;
3.(comp-preservation)
For all equivalence class f,g, there exists a unique h, making that for all f∈f and g∈g whose codf=domg, it has g∘f∈h.
If F:C→D is a functor, then we can get a precategorical equivalence relation ∼F:
A∼FObB:=F(A)=F(B) and f∼FMorg:=F(f)=F(g). We can naturally regard precategorical equivalence relations as the popularization of set-theoretical equivalence relations.
Easy to see one of consequences of dom/cod-preservation is the quotient graph C/∼, the graph’s objects and morphisms are just equivalence classes of ∼, dom′/cod′f:=dom/codf, and naturally the projection [−]:C→C/∼. Another its consequence is ∼Mor can be decomposed into equivalence realtions ∼[A,B]Mor on the subsets of MorC which have the form as [A,B]=A∈A,B∈B⋃HomC(A,B), where A and B are equivalence classes of ∼Ob, then graph-morphism class HomC/∼(A,B)=[A,B]/∼[A,B]Mor.
Now we want to obtain a precategorical equivalence relation which is not induced from a given functor but can form a quotient category and a projection functor by itself, so we need new a condition about feasibility: let f and g is respectively any equivalence class of ∼[A,B]Mor and ∼[B,C]Mor, then there exist f∈f and g∈g whose codf=domg, that is f and g can be composed. So from it we can define a partial binary function comp′(g,f):=h, or briefly g∘f, at this time the quotient graph C/∼ becomes a category, and we call ∼categorical.
A special situation is that A∼ObB⇔A=B (we mark ∼Ob as =Ob, which is an essantial notation), at this time the quotient category C/(=Ob,∼Mor) is called a wide subcategory of C.
Proposition 3.1.1
If an equivalence relation ∼=(∼Ob,∼Mor) preserves dom/cod and comp, then it preserves id.
Proof.
For all A and all f whose domf=A, it has f∘idA=f, so for all f, it has f∘[idA]=f, in a similar way, for all g, [idA]∘g=g, so [idA] is an identity in C/∼, and identity is unique for each object (here is A).
∎
Proposition 3.1.2
Let F:C→D match up with a categorical equivalence relation ∼, namely ∼⇒∼F, then there exists a unique ρ:C/∼→D such that ρ∘[−]=F.
Proof.
Just let ρ([A]):=F(A) and ρ([f]):=F(f).
∎
3.2 Sketches and the Cochain Condition
We now discuss a case which occurs in various categories widespreadly.
Consider a race of object equivalence relations on C which satisfy the strong isomorphism condition A∼ObB⇒A≅B, it says all objects in the same equivalence class are isomorphic, we instinctly perceive that, there must be similarity between morphisms: if A∼ObA′,B∼ObB′, then there exists isomorphisms φ:A→~A′,ϕ:B→~B′, in that way we have bijection Hom(A,B)→Hom(A′,B′):=f↦ϕ∘f∘φ−1, but we still need a strengthened condition about these bijection for us to get a good morphism equivalence relation.
Definition 3.2.1
Let A an equivalence class of ∼Ob which the strong isomorphism condition. We say a group of isomorphisms φA={φAB∈Iso(A,B)}A,B∈A on A satisfies the cochain condition if
1.
φAA=idA,∀A∈A;
2.
φBA∘φAB=idA,∀A,B∈A;
3.
φCA∘φBC∘φAB=idA,∀A,B,C∈A.
We call it a cochain group for short.
For each equivalence class A of ∼Ob, we set up a cochain group φA, and φ={φA}A∈ObC/∼Ob called a choice of cochain groups ,then we can define a morphism equivalence relation:
[TABLE]
easy to prove ∼φ=(∼Ob,∼φMor) keeps dom, cod, id and comp,so it’s a categorical equivalence relation, therefore we get a quotient category C/∼φ, and the quotient functor [−]φ:C→C/∼φ.
In fact, for each equivalence class A, there must be cochain groups: choose a representative element A of A, and choose isomorphisms from A to other elements as generators, then we get a cochain group by spanning the generators (here we use the idea of complete graph’s minimum spanning tree). This observation gaurantees that we certainly can build a quotient category using equivalence relations which satisfy the strong isomorphism condition.
Lemma 3.2.1
For any choice of cochain groups φ, the quotient functor [−]φ is fully faithful, in other word, each [−]φ∣[A,B] is bijective.
From each A∈ObC/∼Ob, we fetch a representative element A, which is called a choice of representative elements χ, and fetch all morphisms between these As, then we obtain a full subcategory Cχ called a sketch of C. An important thing is that for any choice χ and φ as long as they are under the same ∼Ob, we can construct an isomorphism Cχ≅C/∼φ by mapping objects and morphismes in Cχ to their equivalence classes in C/∼φ, and it’s exactly an iso by Lemma 3.2.1. Another way is that, we can define a right inverse Sφ,χ of [−]φ as mapping an equivalence class of ∼φ to its representative element by χ, easy to see that Cχ is exactly the image of Sφ,χ, and from the factorization we obtain an iso. For this reason, we call C/∼φ a sketch quotient of C.
Now we know that there is no real difference to choose different cochain groups, because the quotient categories they generate are isomophic, and category theory doesn’t care about distinction between isomorphic objects and also can’t distinguish them.
There are two special cases of sketches:
1.
A∼ObB⇔A=B, in this situation, the sketch is the original category itself.
2.
A∼ObB⇔A≅B, in this situation, sketches are skeletons.
4 Several Categories and Functors
4.1 The Smooth Category and The Specture Category
All open sets on n-dimensional Euclidean space Rn with the standard topology, and smooth mappings between them compose a small category Smon, all open sets on all Euclidean spaces with the standard topology, and smooth mappings between them compose a small category Smo called the Smooth category. Note that Smo can be embedded into Set.
There are several varietas of Smo: morphisms are continuous mappings instead of smooth mappings; objects are open sets on complex spaces and morphisms are holomorphic mappings; objects are open sets on half-spaces.
4.2 Mor-Categories, Hom-Functors and Dom/Cod-Functors
Definition 4.2.1
Let C a category. C’s Mor category Mor(C) is as follows: its objects are morphisms of C; Let f,g are two objects of Mor(C), then a morphism from f to g is a pair of morphisms (φ,ψ) of C, making ψ∘f=g∘φ.
In fact, by changing direction of φ and ψ, we have anthor three similar categories which maybe not not much important here. Naturally, there are two functors
[TABLE]
and a functor
[TABLE]
and a partial multifunctor
[TABLE]
they reflect the struture of category. In fact, the functor compC reflects a semigroupoid structure on the object class of Mor(C), note that there is also a semigroupoid structure on the morphsim class of Mor(C), we can see that these two semigroupoids are ”perpendicular” to each other from the following picture.
[TABLE]
In addition, functor F:C→D can be promoted to
[TABLE]
so we actually get a functor Mor:CAT→CAT.
And there is the diagonal plane functor
[TABLE]
[TABLE]
We can use these functors to rewrite the concept of natural transform:
Definition 4.2.2
Let F,G:C→D functors. Then a natural transform from F to G is a functor α:C→Mor(D), making DomD∘α=F and CodD∘α=G, in other words, α(f)=(F(f),G(f)).
Proposition 4.2.1
Let F,G:C→D functors, α:F→G a nat, Φ:E→C a functor. Then α∘Φ:F∘Φ→G∘Φ is a nat.
A special situation is that E is a subcategory of C, namely there is an inclusion functor in:E↪C , so α∘in:F∘in→G∘in is a nat, namely the restriction α∣E:F∣E→G∣E is a nat.
Proposition 4.2.1’
Let F,G:C→D functors, α:F→G a nat, Φ:D→E a functor. Then Mor(Φ)∘α:Φ∘F→Φ∘G is a nat.
Definition 4.2.2’
Let F,G,H:C→D functors and α:F→G,β:G→H nats. Then the ∘-composition of α and β is β∘α:C→Mor(D):=compC∘(α×β), which is a nat F→H.
Definition 4.2.2”
Let F,G:C→D and H,K:D→E functors, α:F→G and β:H→K nats. Then the ∗-composition of α and β is β∗α:C→Mor(E):=DPE∘Mor(β)∘α, which is a nat H∘F→K∘G.
It reveals a kind of possibility: we can continue to build morphisms between nats (can be called 2-nat or 3-functor or 4-object) t:α→β, it’s a functor t:C→Mor2(D), making DomMor(D)∘t=α and CodMor(D)∘t=β. And similar to ∘-composition and ∗-composition, it has three compositions. Repeat this process again and again, we get a structure of N in category theory.
Next we can naturally rewrite the concept of limits: so-called conF is a subcategory of Mor(CJ), making DomCJ(conF)=(F,idF) and CodCJ(conF)=Δ(C), in other word, conF=DomCJ−1(F,idF)∩CodCJ−1(Δ(C)), and ⟵limF is conF’s terminal object.
Theorem 4.2.1
If F:J→C has the limit (L,δ), then conF≅CodC−1(L,idL); If F:J→C has the colimit (L,δ), then conF≅DomC−1(L,idL).
Definition 4.2.3
Let C a locally small category. Functors
[TABLE]
[TABLE]
When the background C is clear, HomC(A,−) is recorded as HomA(−), HomC(−,A) is recorded as HomA(−).
Theorem 4.2.2
Let F,G:C→D have limits, and α:F→G. Note that α:C→Mor(D), then ⟵limα=⟵limα, where the left is ⟵lim:DC⇝D, and the right is ⟵lim:Mor(D)C⇝Mor(D). Colimits are similar.
Let C and D categories. We call an object A on C is a D-object, if HomA(−):C→D; call C a D-category, if all objects of C are D-objects.
Easy to know, if A is an Ab-object of C, then (HomC(A,A),+,∘) is a ring, and pre-additive categories are Ab-categories. HomA(−):C→Set means many concrete (locally small) categories we have ever constructed are all Set-categories, in the matter of category theory standard, it asserts that these categories are constructed by the set-theoretical language, and for a Set-object A, (Hom(A,A),∘) is a monoid. In addition, 2-categories are Cat-categories.
4.4 The Module Category and O-Module Sheaves
Firstly, we rewrite definition of module. Note that all homomorphisms of an abelian group consititute a ring, where its addition is to add values up (f+g)(a):=f(a)+g(a) and its multiplication is composition.
Definition 4.4.1
Let V an abelian group, R a ring. A left R-module structure on V is a ring homomorphism f∈HomRng(R,HomAb(V,V)).
Proposition 4.4.1
The definition above is equivalent to the classical definition.
Proof.
nb
∎
By the way, a right R-module is a left Rop-module, where Rop is the dual ring of R.
We could even discribe more generally this sort of mathematical objects.
Definition 4.4.2Ob
A module is a three-tuples (R∈Rng,V∈Ab,f∈Hom(R,Hom(V,V))). If V and R is clear, we consider f∈Hom(R,Hom(V,V))) as a module.
Definition 4.4.2Mor
A module morphism from (R,V,f) to (R′,V′,g) is a pair of morphisms (φ∈HomRng(R,R′),ψ∈HomAb(V,V′)), making that ∀a∈R,g(φ(a))∘ψ=ψ∘f(a).
Easy to prove that modules and module morphisms constitute a category, called the module category, recorded as Mod.
We see that the concept of the module category is very similar (but different) to that of Mor-categories, so we can define similar (but different)
[TABLE]
Note that MDom and MCod are not DomMod and CodMod which are defined on Mor(Mod).
Using MDom we can restore classical:
Definition 4.4.3
Let R a ring. Then MDom−1(R,idR)⊂Mod is called the left R-module category, recorded as R−Mod;
And (although we haven’t mention the concept of sheaves yet):
Definition 4.3.4Ob
Let O:X→Rng a ring sheaf. Then an O-module sheaf is a module sheaf F:X→Mod, making MDom∘F=O.
Definition 4.3.4Mor
An O-module sheaf morphism from F to G is a nat α:F→G, making Mor(MDom)∘α=IdRng∘O.
[TABLE]
Concepts which share the same thought and idea can be found everywhere in mathematics, such as:
1.
A permutation represantation of a group, is a three-tuples
[TABLE]
2.
A linear represantation of a group, is a three-tuples
[TABLE]
3.
A left R-Algebra, is a three-tuples
[TABLE]
5 Topology Algebras, Sheaves and Stalks
5.1 Topology Algebra
Definition 5.1.1
If a small category P satisfies #HomP(A,B)⋃HomP(B,A)⩽1, then, we call it a category as partially ordered set, briefly pocategory.
pocategories are simple categories, just as their name they are partially ordered sets: A⩽B:=∃f∈Hom(A,B), identities ensure that relation ⩽ has reflexivity, condition in Definition 4.1.1 ensures antisymmetry, and composition ensures transitivity. The other way round, any poset is a pocategory: there exists a unique morphism in Hom(A,B) if A⩽B. Therefore posets and pocategories are equivalent concepts, and convariant functors between pocategories are equivalent to monotonically increasing functions between posets. But by using concept of pocategories we obtain tools of category theory (especially functors and limits) to discuss them.
Convetion
We conveniently write the unique morphism in HomP(A,B) as A⩽B if exists.
Definition 5.1.2Ob
Let X a set. If 0-ary operations(canstants) 1X,0X∈X, 2-ary operations ∧:X×X→X and a subset operation ⋁:2X→X satisfy
then we call the five-tuples (X,1X,0X,⋁,∧) as a topology algebra.
The concept of topology algebra is connotatization of topology structure or open sets of topological space, and we will see that topological space can be restored from the topology algebra its open sets form.
Notice that from two absorption laws we can infer that ∧ and ⋁ are idempotent: x∧x=x,⋁{x,x}≡⋁{x}=x. Likewise notice that from two absorption laws and identity laws we can infer that the constants are absorbing elements: ⋁{1X,x}=1X,0X∧x=0X.
To be convenient, if ⋁ acts on finite set {xi}i=1n, then we mark ⋁{xi}i=1n as x1∨⋯∨xn, it’s rational.
Likewise, on account of idempotency, commutativity and associativity of ∧, it can be naturally expanded to functions on finite subsets of X: ⋀{xi}i=1n:=i=1⋀nxi=x1∧⋯∧xn; the other way round, x∧y:=⋀{x,y}. They are equivlent expression.
Definition 5.1.2Mor
A topology algebra homomorphism f:X→Y is a function satisfying
1.
f(1X)=1Y,f(0X)=0Y;
2.
f(x∧y)=f(x)∧f(y);
3.
f(α∈J⋁xα)=α∈J⋁f(xα).
Any topology algebra is a poset: x⩽y:=x∨y=y(⇔x∧y=x), and easy to see 1X and 0X is respectively maximum and minimum of (X,⩽), ⋁ and ∧ is respectively supremum and finite infimum on (X,⩽). The other way round, if a poset has supremum and finite infimum, then it’s a topology algebra. They are equivalent expression. Since topology algebras are posets, they are pocategories, therefore we have a definition in category theory:
Definition 5.1.3
If a pocategory X satisfies
1.
having the (initial) terminal object, particularly recorded as (0X)1X;
2.
finite product complete, particularly recorded as ∧;
3.
coproduct complete, particularly recorded as ⋁;
4.
absorptive, distributive and identity law;
then we call it a category as topology algebra, briefly TA category. Naturally, morphisms are functors preserving these limits, and they compose the category of topology algebras, recorded as TAlg.
Proposition 5.1.1 (definition and properties of subalgebra)
Let X∈TAlg,
1.(definition)
Let y∈X, then subcategory {x∈X∣x⩽y} is still a algebra, called a subalgebra of X, recorded as y⩽. The other way round, suppose Y is a subcategory of X, then Y=(1Y)⩽; to sum up, 1Y=y⇔Y=y⩽;
2.(compatible property)
the intersection category Y∩Z of any two subalgebras Y and Z of X is subalgebra, and Y∩Z=(1Y∧1Z)⩽;
3.(gluing property)
Let {Yα}α∈J a family of subalgebras of X, then there exists a unique subalgebra Z, making that α∈J⋃Yα is a integrally confinal subset of Z=(α∈J⋁1Yα)⩽, that is ∀x∈Z−{0X},∃y∈α∈J⋃Yα−{0X},y⩽x. We write Z as α∈J⋃∘Yα.
Attention
Not all subcategories which are exactly topology algebras are subalgebras.
5.2 Sheaves and Cosheaves
Definition 5.2.1Ob
Let X a TA category. A C-presheaf on X is a contravariant functor from C to X.
Definite 5.2.1Mor
A presheaf morphism betwwen F,G:X→C is simply a nat α:F→G.
C-presheaves on X and morphisms compose the category PShC(X)≡Funct(Xop,C), Similarly, CoPShC(X)≡Funct(X,C).
Definition 5.2.2
We call presheaf F:X→C a sheaf, if it sytisfies
1.
F(0X) is the terminal object in C.
2.(the gluing axiom)
For any x=⋁xα, it has (xα⩽x)=paired−pullback(F(xα∧xβ⩽xα),F(xα∧xβ⩽xβ)).
The definition has acquiesced in these completeness of C.
The definition of cosheaves is similar. Defintion 5.2.3 is called the categorical defintion of (co)sheaves, we advise readers to consult geometry books to learn about the set-theoretical definition of (co)sheaves in a concrete category, which is usually Set, Ab, and Rng, especially terms such as section, restriction mapping, compatible and gluing axiom.
morphisms between (co)sheaves are simply nats just like (co)presheaves. The category of C-sheaves on X denotes as ShC(X), and the category of C-cosheaves denotes as CoShC(X). We see ShC(X)⊂PShC(X)⊂Funct(Xop,C) and CoShC(X)⊂CoPShC(X)⊂Funct(X,C) are chains of full subcategory.
Definition 5.2.3
For any algebra homomorphism f:Y→X, C-presheaves F,G on X, and nat α:F→G, easy to see that F∘f,G∘f are C-presheaves on Y and α∘f:F∘f→G∘f is a nat, therefore it actually provides a contravariant functor PShC(−):TAlg→CAT.
In a similar way, we have contravariant functors CoPShC(−), ShC(−) and CoShC(−). We see that the functor PShC(−) is similar to HomA(−).
Theorem 5.2.1 (definition and properties of local (co)presheaves)
1. (definition)
Let F∈PShC(X), Y is a subalgebra of X, then F’s restriction F∣Y∈PShC(Y)
on Y is called a local prsheaf of F, it can also be written as F∣1Y;
2. (gluing of local sheaves)
Let C a paired-pullback-complete category, {Yα}α∈J a family of subalgebras of X, and {Fα∈ShC(Yα)}α∈J a family of compatible sheaves, that is ∀α,β∈J,Fα∣Yα∩Yβ=Fβ∣Yα∩Yβ. Then there exists a unique sheaf F∈ShC(Z), making ∀α∈J,F∣Yα=Fα, where Z=α∈J⋃∘Yα.
The proposition is still true by changing PSh to CoPSh, CoSh and Sh in 1; and Sh to CoSh in 2.
Definition 5.2.4Ob
Let X a topology algebra, F a C-(co)sheaf on X. Then we call two-tuples (X,F) a C-(co)sheaved algebra.
Definition 5.2.4Mor
Let (X,F) and (Y,G)C-(co)sheaved algebras. Then a C-(co)sheaved algebra homomorphism from (X,F) to (Y,G) is a two tuples (f,α), where f:Y→X is a topology algebra homomorphism, and α:F∘f→G is a nat (namely (co)sheaf morphism).
They compose the category of C-(co)sheaved algebras (Co)ShC. Turning the direction of α to G→F∘f, we get the category C(Co)Sh. Notice that (Co)ShC is similar to Mor-categories and Mod, so similarly, there are functors
[TABLE]
and
[TABLE]
For any X∈TAlg, there is a sheaf
[TABLE]
and for any algebra homomorphism f:Y→X, there is a sheaved algebra homomorphism
[TABLE]
so it provides a functor Sub:TAlg→TAlgSh, which reflects natural properties of topology algebras..
5.3 Particles
Definition 5.3.1
Let X a topology algebra. If p is a subset of X−{0X}, and satisfies
1. (∧-closed or directed)
x,y∈p⇒x∧y∈p,
2. (strong locally cofinal)
⋁xα∈p⇒∃xα∈p,
3. (upward-closed)
x∈pandy>x⇒y∈p,
then we call it a particle of X. All particles of X denote as PatlX.
Theorem 5.3.1
Let x∈X∈TAlg, the set representation of x is defiend as TxX:={p∈PatlX∣x∈p} (when X is clear, we can briefly write it as Tx), or x∈p⇔p∈Tx. Then Tx∧y=Tx∩Ty, T⋁xα=⋃Txα.
Proof.
**1.**From the definition we know that p∈Tx∩Ty iff x∈p and y∈p, because p is directed, it has x∧y∈p, namely p∈Tx∧y, therefore Tx∩Ty⊆Tx∧y. From Lemma 5.3.1 we know that x∧y∈p⇒x∈p, so Tx∧y⊆Tx, for the same reason it has Tx∧y⊆Ty, therefore Tx∧y⊆Tx∩Ty. To sum up, Tx∧y=Tx∩Ty.
2.p∈⋃Txα iff there exists xα∈p, from Lemma 5.3.1 we know ⋁xα∈p, namely p∈T⋁xα, therefore ⋃Txα⊆T⋁xα. We can straightway get T⋁xα⊆⋃Txα from the definition. To sum up, T⋁xα=⋃Txα.
∎
The most important result of Theorem 5.3.1 is that we get a cosheaf
[TABLE]
and a topological space (PatlX,{Tx}x∈X), which is an inherent structure of X.
Let f:Y→X be an algebra homomorphism, we define an continuous mapping as
[TABLE]
where f−1(p) is indeed a particle: let x,y,xα∈Y, then f(x)∈p and f(y)∈p⇒f(x∧y)=f(x)∧f(y)∈p; f(⋁xα)∈p⇒⋁f(xα)∈p⇒∃f(xα)∈p; f(x)∈p and y>x⇒f(y)>f(x)∈p; and the inverse image of Ty is obviously Tf(y). So we get a contravariant functor Patl−:TAlg→Top, which is the adjoint of the forgotten functor OP−:Top→TAlg, where OP means open sets. Similarly, we have
[TABLE]
it gives a functor T−:TAlg→CoShSet.
Proposition 5.3.1
Let X an algebra, then T−X:X→(OP−∘Patl−)(X) is an isomorphism iff Tx=Ty⇒x=y, namely it’s injective.
We call such algebras topological. Now we consider another direction, let (M,OPM) a topological space, for any point x∈M, we define a particle on OPM: paM:={U∈OPM∣a∈U}, which gives a continuous function p−M:M→(Patl−∘OP−)(M), we can briefly write it as p− when M is clear.
Proposition 5.3.2
p− is a homeomorphism iff every particle of OPM has the form pa and pa=pb⇒a=b, namely it’s bijective.
We call such spaces sober.
Proposition 5.3.3
Hausdorff implies sober.
Proof.
Suppose p− is not injective, we can choose two distinct points a=b∈M making that pa=pb=p, so there is no U,V∈p, namely a∈U and b∈V, such that U∩V=∅; suppose p− is not surjective, let p be a particle which isn’t in the form of pa, suppose ⋂U∈pU=∅, then choose an element a in it, so p⊂pa,
∎
Proposition 5.3.4
p− is surjective iff it’s a quotient mapping.
5.4 Stalks
Definition 5.4.1
Let F:X→C a (co)presheaf, then the (co)stalk of F on p∈PatlX is defined as Fp:=(⟵lim)⟶limF∣p.
Definition 5.4.2
Presheaf F:X→C is called preapex, if for any x∈X, F(x⩽1X) is an epic in C. A preapex presheaf is called apex, if for any x=y, there doesn’t exist an iso f:F(x)→F(y) such that f∘F(x⩽1X)=F(y⩽1X). Similarly, replacing presheaf by copresheaf and epic by mono, we get concept of apex copresheaf.
If F:X→C is an apex presheaf where C is a concrete category, then all of its maximal sections are global sections, which means it’s explicit: all information about it is stored and only stored in its global sections F(1X), that’s why we call it ”apex”.
Proposition 5.4.1
Let F a preapex presheaf, then any F(x⩽y) is an epic.
Proof.
Firstly we prove a simple conclusion: if f=g∘h is an epic, then g is an epic. Suppose g is not an epic, then there exist two different morphisms k1,k2 making that k1∘g=k2∘g, which means k1∘f=k1∘g∘h=k2∘g∘h=k2∘f, then f is not an epic contradicting the condition. Then we can easily see it from F(x⩽y)∘F(y⩽1X)=F(x⩽1X).
∎
To discuss relations between presheaves and sheaves, we need concepts as follows.
Definition 5.4.3
Let C a category and B∈C an object. A subobject of B, or B-subobject is a pair (A∈C,i:A→B), where i is a mono; an B-submorphism between B-subobjects (A,i) and (A′,i′) is a morphism j:A→A′ such that i=i′∘j.
Easy to prove that submorpshims are monos, so submorphisms provide some new subobject-reletions between subobjects. Easy to see that B-subobjects and B-submorphisms compose a category B−Sub=CodC−1(B,idB)∣mono.
Definition 5.4.4
Let {(Aα,ρα)} a family of B-subobjects. The union of them is a B-subobjects (⋃Aα,⋃ρα), such that for each α, there is a B-submorphism from (Aα,ρα) to (⋃Aα,⋃ρα), and for any other B-subobject which satisfies this condition, there exists a unique B-submorphism from (⋃Aα,⋃ρα) to it, in other word, the union is the ”smallest” B-subobject which is ”bigger” than all (Aα,ρα); Ditto with all the B-submorphisms reversed, we get the intersection (⋂Aα,⋂ρα), in other word, the intersection is the biggest B-subobject which is smaller than all (Aα,ρα); The differece (Aα−Aβ,ρα−ρβ) is the smallest B-subobject which can be unioned to (Aα∪Aβ,ρα∪ρβ) with (Aβ,ρβ).
Definition 5.4.5
Let f:A→B a morphism. Then an image of f is a B-subobject (Imf,ρ) making that there is a morphism π:A→Imf such that f=ρ∘π, which is called a factorization of f by ρ, and for any other B-subobject by which f can be factorized, there is only one B-submorphism from (Imf,ρ) to it. In other word, the image is the smallest B-subobject by which f can be factorized.
Proposition 5.4.2
The union, intersection, defference and image is unique in the sense of isomorphism, if exists.
Proposition 5.4.3
If {(Aα,iα)}α∈J is a family of B-subobjects and I⊆J, then there is a unique B-submorphism I↪J:⋃α∈IAα→⋃α∈JAα. There are similar conclusions for intersections, differences and images.
Proposition 5.4.4
Let (Aα,iα) a family of B-subobjects and (Cα,jα) a family of D-subobjects, if there exist morphisms fα:Aα→Cα and f:B→D such that f∘iα=jα=fα, then there is a unique ⋃fα:⋃Aα→Cα, making all diagrams commutative.
In the view of Mor cateogries, (fα,(iα,jα)) is a subobject of f in the Mor catrgory of the background category, and the theorem is saying that their union ⋃fα’s domain and codomain is ⋃Aα and ⋃Bα, in other word, the two union operations is commutative with the functors Dom/Cod. Of course, there are similar conclusions for intersections, differences and images.
Definition 5.4.2
Let F:X→C a (co)presheaf. The fiber space of F is the copresheaf
[TABLE]
where ixy is embedding: due to Tx⊆Ty, p∈Ty∐Fp=p∈Tx∐Fp+p∈Ty−Tx∐Fp;
the section space of F is the presheaf
[TABLE]
where pxy is projection: due to Tx⊆Ty, p∈Ty∏Fp=p∈Tx∏Fp×p∈Ty−Tx∏Fp.
Easy to see that for any presheaf F:X→C, let (Fp,δp)=⟶limF∣p, then there is naturally a nat αsecF:F→Fsec:=x↦p∈Tx∏δp(x), and for copresheaf F, there is αfibF:Ffib→F:=x↦p∈Tx∐δp(x).
Theorem 5.4.1
For any (co)presheaf F, Ffib is a cosheaf and Fsec is a sheaf.
Proof.
let’s regard Tx as a discrete category, then we define a functor G:Tx→C:=p↦Fp. Now we prove that for A∈C, there is a G-cone whose vertex is A, if and only if, for all x=⋁xα, there is a cone of multi-wedge-shaped subcategory D=({Fsec(xα)},{Fsec(xα∧xβ)},{Fsec(xα∧xβ⩽xα)}) whose vertex is A.
⇒ If (A,ϵ) is a G-cone, then ϵ∣Txα is a G∣Txα-cone, it’s rational because Txα⊆Tx, noitce that ⟵limG∣Txα=Fsec(xα), so there is a unique ϵ′(xα):A→Fsec(xα), (A,ϵ′) is exactly a D-cone because of some properties of product (such as commutative and associative), Txα∧xβ=Txα∩Txβ and Tx=⋃Txα.
⇐ If (A,ϵ) is a D-cone, then we define ϵ′(p)=πα(p)∘ϵ(xα) for p∈Txα, where (Fsec,πα)=⟵limG∣Txα, it is rational because Txα∧xβ=Txα∩Txβ and Txα⊆Tx, and (A,ϵ′) is exactly a G-cone because Tx=⋃Txα.
So now we directly get that ⟵limD=⟵limG=Fsec(x) which is exactly the gluing axiom.
Notice that T0X=∅, so G0X:T0X→C≡∅C, according to Proposition 4.1.1, the limit of G0X, namely the Fsec(0X), is exactly the terminal object of C.
The proof of Ffib is a cosheaf is similar.
∎
Easy to see that, if C has the property that embbedings are monos and projections are epics, then Ffib and Fsec are preapex, further, if X is topological, then they are apex.
Theorem 5.4.2
If C is a paired-pullback complete category and has the terminal object, then for any presheaf F∈PShC(X), there exists a unique sheaf F∈ShC(X) and a nat θF:F→F, making that for any sheaf G and nat α:F→G, there exists a unique nat α:F→G, making α=α∘θF.
Proof.
For arbitrary x∈X, let O={xα} a covering of it: x=⋁xα. Consider the multi-wedge-shaped subcategory ({F(xα)},{F(xα∧xβ)},{F(xα∧xβ⩽xα)}), we write its limit as (FO(x),xα↦FO(xα⩽x)). Notice that (F(x),xα↦F(xα⩽x)) is a cone of that subcategory, so there is a RO(x):F(x)→FO(x). Notice that morphisms {FO(xα⩽x)∘δp(xα)}xα∈O,p∈Txα compose a cone of discrete subcategory {Fp}p∈Tx due to ⋃Txα=Tx, so there is a morphism SO(x):FO(x)→Fsec(x), easy to see that SO(x)∘RO(x)=αsecF for arbitrary covering O. Let (F(x)=⋃ImSO(x),ρ(x)) be the union of SO(x)’s images over all coverings of x, and πO(x):FO(x)→F(x) such that ρ(x)∘πO(x)=SO(x), because ρ(x) is a mono, so θF(x)=πO(x)∘RO(x) is the same for arbitrary coverings O.
For y⩽x, easy to see that O∧y={yα=xα∧y} is a covering of y, so {F(xα∧y⩽xα)∘FO(xα⩽x)} compose a cone of multi-wedge-shaped subcategory ({F(xα∧y)},{F(xα∧xβ∧y)},{F(xα∧xβ∧y⩽xα∧y)}), therefore there is an FO(y⩽x):FO(x)→FO∧y(y), easy to prove that Fsec(y⩽x)∘SO(x)=SO∧y(y)∘FO(y⩽x), so there is the morphism Im(SO(x),SO∧y(y)):ImSO(x)→ImSO∧y(y), and F(y⩽x)=({O∧y}↪{O′})∘⋃Im(SO(x),SO∧y(y)):F(x)→F(y), where O denotes coverings of x and O′ denotes coverings of y, note that here we are using Proposition 5.4.2 and 5.4.3. Easy to know that F is a presheaf and θF:F→F is a nat.
Now we prove that F is a sheaf.
The method to construct α is very similar to that of θF, and we don’t bother to write it down.
∎
F is called the sheafification/sheafing of F or the sheaf associated to F, it’s a process which removes some sections from and adds some sections to presheaves on the basis of the gluing axiom. Notice that, if α:F→G is a presheaf morphism, then θG∘α:F→G, so there is the unique α:=θG∘α:F→G, so we turn the sheafification operation into a functor −:PShC(X)→ShC(X).
Proposition 5.4.5
Let f:Y→X a topology algebra homomorphism, F:X→C a presheaf, then F∘f=F∘f. This provides a functor
[TABLE]
We can discuss quotient sheaves on the basis of sheafification. If C is a concrete category with quotient, which is usually Set, Ab, Rng and Cat/CAT, let F:X→C a sheaf, and F/∼ is one of F’s quotient presheaves, that is, there is a natural projection p:F→F/∼, where each p(x):F(x)→F(x)/∼=(F/∼)(x) is a quotient projection, then we can naturally define the quotient sheaf as the sheafification F/∼.
6 Topology and Geometry
6.1 Topological Spaces
Definition 6.1.1
Let X∈TAlg. Then topological spaces on X is apex-Set-cosheaved algebras, and continuous mappings are Set-cosheaved algebra homomorphisms.
Theorem 6.1.1
Topology spaces defined in Definition 6.1.1 (we call it the sheaf-theoretical definition) is equivalent to the classical definition (or set-theoretical definition).
Proof.
⇐
Objects. Let (M,OPM) is a topological space in the sense of set theory, where OPM is the family of open sets, it’s a topology algebra, meanwhile an inclusion functor inM:OPM→Set, which is actually an apex cosheaf:
If {fα:Uα→A} making fα∘(Uα∩Uβ↪Uα)=fβ∘(Uα∩Uβ↪Uβ), then it means ∀a∈Uα∩Uβ,fα(a)=fβ(a), namely they are compatible to each other: ∀α,β,fα∣Uα∩Uβ=fβ∣Uα∩Uβ, so they can be glued to a larger function f:⋃Uα→A:=a↦fα(a) if a∈Uα, easy to know that it’s the only fucntion making that ∀α,fα=f∘(Uα↪⋃Uα), therefore we get (Uα↪⋃Uα)=paired−pushout(Uα∧Uβ↪Uα,Uα∩Uβ↪Uβ), which is exactly the gluing axiom.
The minimum of OPM is the empty set, which is exactly the initial object of Set, now we know inM is a cosheaf.
Inclusion functions inM(U⊆V)≡U↪V are injections, namely monos in Set; if there is an iso, namely bijection, between open sets f:U≅V such that (V↪M)∘f=U↪M, then images of V↪M and U↪M are the same, namely U=V. So inM is apex.
Morphisms. Let f:(M,OPM)→(N,OPN) a continuous mapping in the sense of set theory, then easy to see that f∗:OPN→OPM:=U↦f−1(U) is an algebra homonorphism, and αf:inM∘f∗→inN:=U↦f∣f∗(U) is a nat, so (f∗,αf) is a cosheaved algebra homomorphsim, namely a continuous mapping in the sense of sheaf theory.
⇒
Objects. Let (X,F) a topological space in the sense of sheaf theory, we write F(x⩽y) as ix,y for convenience. Consider the family of subsets OPF(1X):={Imix,1X∣x∈X} of F(1X), it’s actually a topology structure:
According to the gluing axiom (ixα,x=⋁xα)=paired−pushout(ixα∧xβ,xα,ixα∧xβ,xβ), the first picture of colimits (Theorem 2.2), and the depiction of coequalizers on Set (Lemma 4.1.1), we have F(x)=∐F(xα)/∼R, the coequalizer as a projection e:∐F(xα)→F(x), and embedding mappings {iα:F(xα)→∐F(xα)}. Now we make a series of computation: ⋃Imixα,1X=⋃Im(ix,1X∘e∘iα)=⋃ix,1X(e(Imiα))=ix,1X(e(⋃Imiα))=ix,1X(e(∐F(xα)))=ix,1X(F(x))=Imix,1X, so we actaully obtain one topology axiom ⋃Imixα,1X=Imi⋁xα,1X.
From the last paragraph we know F(x∨y)=F(x)⊔F(y)/∼R, where aRb is defined as there exists c∈F(x∧y) making that (i1∘ix∧y,x)(c)=a and (i2∘ix∧y,y)(c)=b. Note that ix∧y,x and ix∧y,y are injective, and the embedding mappings i1:F(x)→F(x)⊔F(x) and i2:F(y)→F(x)⊔F(x) are injective, so ∼R is just R itself, namely F(x∨y)=F(x)⊔F(y)/(ix∧y,x(c)=ix∧y,y(c)). Now we make a series of computation: Imix,1X∩Imiy,1X=Im(ix,1X∘e∘i1)∩Im(iy,1X∘e∘i2)=ix,1X(Ime∘i1)∩iy,1X(Ime∘i2), because ix∨y,1X is injective, so the front=ix∨y,1X(Ime∘i1∩Ime∘i2)=ix∨y,1X(Imix∧y,x∨y)=Imix∧y,1X, so we actaully obtain another topology axiom Imix,1X∩Imiy,1X=Imix∧y,1X.
Note that in the above process of proving, we use these two results: ⋃f(Aα)=f(⋃Aα), and if f is injective, then ⋂f(Aα)=f(⋂Aα).
Morphisms. Let (f,α):(X,F)→(Y,G) a cosheaved algebra homomorphism, then α(1Y):F(1X)→G(1Y) is actually a continuous mapping: α(1Y)−1(ImG(y⩽1Y))=ImF(f(y)⩽1X).
Draw a picture to make these two processes clear:
[TABLE]
Now we prove these two processes are mutually inverse in the sense of isomorphism.
The maximum of OPM is just M, and inM(M) is just M itself, for any open set U∈OPM, IminM(U↪M) is just U itself, so we restore (OPM,inM) back to (M,OPM).
According to conclusion we get before, togethering with all Imix,1X are distinct due to F is apex, OPF(1X) is isomorphic to X. Since each ix,1X is an injection, F(x) is isomorphic to Imix,1X, therefore (X,F)≅(OPF(1X),inF(1X)).
∎
In the proof of Theoren 6.1.1, we actually construct two functors between the category of topological spaces Top and the category of apex-Set-cosheaved algebras ACoShSet, and they are inverse in the sense of isomorphicness. Now we want to transfer some concepts on Top to ACoShSet.
Definition 6.1.2
Let (X,F) and (Y,G) topological spaces, (f,α):(X,F)→(Y,G). Then we call (f,α) a quotient mapping if f is an embedding functor, and Tx is an inverse image of Tf(1Y):PatlX→PatlY iff x∈f(Y). Further, we call (f,α) an absolute quotient mapping if f=idX and α is a retraction.
Proposition
Absolute quotient is quotient.
Definiton 6.1.3
An algebra X is called seperatable, if for any p=q∈PatlX, there exist x∈p and y∈q such that x∧y=0X. A topological space (M,OPM) or (X,F) is called seperatable, if OPM or X is seperatable.
Lemma 6.1.1
Let X a seperatable algebra, then \lim\limits_{\longleftarrow}T^{X}|_{p}=\Bigl{(}\{p\},(x\in p)\mapsto(\{p\}\subseteq T_{x})\Bigr{)}, namely any costalk (TX)p={p} is a single point set.
Proof.
TX(x) are just some sets with inclusion mappings, so easy to see that ⟵limTX∣p=x∈p⋂F(x), which at least has an element p, suppose it has another element q, which means for all x∈p, q∈Tx, namely x∈q, so p⊂q, therefore for any x∈p and y∈q, it has x∧y∈q, which makes a contradiction with seperatablity.
∎
Spaces whose all costalks are single point sets are called thin.
Lemma 6.1.2
Let (X,F) a seperatable topological space, and for p∈PatlX, ⟶limF∣p=(Fp,δp). Then for all x∈X, {Imδp(x)}p∈Tx is a partition of F(x).
Proof.
According to the proof of Theorem 6.1.1, (X,F)≅(OPF(1X),inF(1X)), so we can consider (OPF(1X),inF(1X)) instead of (X,F) to get the same result. Because p∈Patl(TopF(1X)) is some open sets with inclusion mappings, so easy to see that (inF(1X))p=U∈p⋂U, and δp(U) is the inclusion mapping which means Imδp(U) is (inF(1X))p=U∈p⋂U itself. Firstly, for any point a∈F(1X), there is a particle pa={U∣a∈U}, such that a∈U∈pa⋂U. Secondly, for any two unequal particles p and q, (U∈p⋂U)⋂(U∈q⋂U)=U∈p∪q⋂U=∅, because there are U∈p and V∈q such that U∩V=∅.
∎
Theorem 6.1.2
Let (X,F) a seperatable space, then there is an absolute quotient mapping p:(X,F)→(X,TX).
Proof.
Let p∈PatlX. For each x∈X, we define a function α(x):F(x)→Tx:=(a∈Imδp(x))↦p, according to Lemma 6.1.1, it’s rational, and easy to see that α:F→TX is a nat. For each p∈PatlX, we choose a representative elemtent ap∈Imδp(1X), notice that if p∈Tx, Imδp(x)⊆Imδp(1X), so we can define a function β(x):Tx→F(x):=p↦ap, which is a right inverse of α(x), easy to see that β is a nat and is a right inverse of α, so (idX,α) is an absolute quotient mapping.
∎
Lemma 6.1.3
If (M,OPM) is seperatable and sober, then it’s thin.
Proof.
All particles have the form pa, so its costalk on pa is some set containing a, if this set contains another point b, easy to see that pa⊂pb due to P− is injective, but it’s impossible because M is seperatable, therefore the costalk on pa is {a}.
∎
Lemma 6.1.4
If (M,OPM) is seperatable and thin, then it’s sober.
Proof.
For a particle p, if its costalk is {a}, then p⊆pa, and due to seperatablity, p=pa. If pa=pb, then {a}={b}, namely a=b.
∎
Theorem 6.1.3
A topological space (M,OPM) is Hausdorff iff seperatable and sober.
Proof.
⇒ According to Proposition 5.3.3 and 5.3.2, Hausdroff implies sober, which implies p− is surjective, so all OPM’s particles have the form pa, then OPM is seperated due to it’s Hausdorff.
⇐ Because it’s sober, so for any distinct a=b∈M, pa and pb are distinct particles of OPM. because OPM is seperatable, so there are U∈pa and V∈pb, namely a∈U and b∈V, such that U∩V=∅.
∎
Theorem 6.1.3’
A topological space (M,OPM) is Hausdorff iff seperatable and thin.
Proof.
According to Lemma 6.1.3 and Lemma 7.14, we know that sober and seperatable iff thin and seperatable, now we easily see it from Theorem 6.1.3.
∎
These Theorems directly point out that Hausdorff spaces and seperatable topology algebras are equivalent concepts, so now we can define a sheaf-theoretical space (X,F) is Hausdorff as seperatable and thin, or isomorphic to (X,TX).
6.2 C-Manifolds
In the last section 8.1, we rewrite the definition of topological spaces using sheaf-theoretical language; in the chapter 5, we define a category Smo which seems to help us to translate concepts about differential objects into category-theoretical language. Notice that there is an embedding functor from Smo to Set, so Smo can be seen as a subcategory of Set, therefore we hope to define differetial manifolds in sheaf theory by imitating topological spaces. The most simple idea is to define smooth manifolds as apex-Smo-cosheaved algebras, they actually are smooth manifolds but merely open sets of Euclidean spaces.
Let (M,OPM) be a topological spaces. An atlas of M is a family of compatible charts {(Uα∈OPM,Fα:Uα→~Vα∈OPRn)}α∈J, where each Fα is a homeomorphism and Fα∘Fβ∣Uα∩Uβ is smooth, if we regard each Fα as a local apex-Smo-cosheaf on Uα⩽ whose Fα(Uα)=Vα, we may be able to use the method of gluing local cosheaves to construct smooth structure. So we make a try:
Let M=(X,F) a topological space. {Uα}α∈J is a covering of 1X and each Uα⩽ equips with an apex-Smon-cosheaf Fα. For each α∈J, there is a natural isomorphism φα:F∣Uα→Fα, so for each α,β∈J, we can build a natural isomorphism (equivalentor) φαβ=(φβ∘φα−1)∣Uα∧Uβ:Fα∣Uα∧Uβ→Fβ∣Uα∧Uβ, and they satisfy the cochain condition with restrictions
[TABLE]
The other way round, given a family of charts {(Uα,Fα:Uα→Smo)}α∈J and a cochain group {φαβ:Fα∣Uα∧Uβ→Fβ∣Uα∧Uβ}α,β∈J, we can define a topological space: firstly we adopt a choice function ch:ObX∪MorX→J making that V∈ObUch(V)⩽ and f∈MorUch(f)⩽, then we define PF(V):=Fch(V)(V) and PF(f=V⩽U):=φch(f),ch(U)(U)∘Fch(f)(f)∘φch(V),ch(f)(V), easy to prove that PF:⋃α∈JUα⩽→Smo is a functor, then according to Theorem 5.2.1 (gluing of local cosheaves), we get a cosheaf F:X→Set, and natural isomorphisms φα:F∣Uα→Fα:=V↦φch(V),α(V) which satisfy φαβ=(φβ∘φα−1)∣Uα∧Uβ, easy to prove that such F is unique in the sense of isomorphicness. Now we see that the cochain condition is the connotation of equivalentors. Therefore, we can regard a smooth manifold as a topological space which has a family of apex-Smo-cosheaves equipped with a cochain group as a covering (in the sense of isomorphicness). This definition is merely an indiscriminately copy of the classical definition of smooth manifolds, so we may be unable to discover new information from it, we seek for an expression instead which regards all manifolds as a holistic mathematical object and is more correlated to category theory.
There is another way to construct a cosheaf which may represent smooth manifolds. Firstly we add a requirement: images of all Fα are disjoint. For any V∈⋃α∈JUα⩽, there is a cochain group {φαβ(V)∣V⩽Uα∧Uβ}, which has declared an equivalence class {Fα(V)∣V⩽Uα}. Therefore we can get a sketch quotient category of Smo and the quotient functor π:Smo→Smo/∼, easy to know that {π∘Fα:Uα→Smo/∼↪Set/∼}α∈J is a family of compatible cosheaves, because Set is complete, according to Theorem 5.2.1, they can be glued into a cosheaf F:X→Set/∼. Construction of morphisms is a little complicated: let (X,F:X→Set/∼F) and (Y,G:X→Set/∼G) be smooth manifolds where images of {Fα} and {Gα} are disjoint, notice that there naturally are two quotient functors pF:Set/∼F→Set/∼F/∼G and pG:Set/∼F→Set/∼F/∼G. Then a smooth mapping from (X,F) to (Y,G) is a sheaved algebra homomorphism from (X,pF∘F) to (Y,pG∘G). This definition has many drawbacks: 1. It relies on the harsh condition that images of Fα are disjoint; 2. It relies on solving quotient categories many times, we even need to solve them three and four times when we talk about the composition of smooth mappings and its associative law; 3. It relies on a concrete atlas and doesn’t indicate which atlases are equivalent, namely representing the same smooth structure. In a word, it depends on the method of concretely gluing.
But the method above of gluing local cosheaves enlightens us to introduce a concept of abstractly gluing by regarding local cosheaves as local sections of an another sheaf, and the abstractly gluing is provided by the gluing axiom. To discuss further, we firstly rewrite Theorem 5.2.1 (gluing of local sheaves):
Theoren 6.2.1
Let C a paired-pushout-complete category and has the initial object.
1.Ob
Let X∈TAlg, then CAT-presheaf
[TABLE]
is a sheaf. Easy to see that a C-sheaf on X is a global object-section F∈Ob(ShlgC(X)(1X)).
2.Mor
Let f∈HomTAlg(Y,X), then (f,ShlgC(f):ShlgC(X)∘f→ShlgC(Y)) is a sheaved algebra homomorphism, where
[TABLE]
is a nat. Easy to see that if (f,α:F∘f→G) is a sheaved algebra homomorphism, then F∘f=ShlgC(f)(1Y)(F) and α∈Mor(ShlgC(Y)(1Y)) is a global morphism-section.
Replacing Sh to CoSh the theorem is still true. (Co)ShlgC(X) is called the category sheaf of local C-(co)sheaves on X, where ”lg” means ”locally glue”. The theorem actually provides the contravariant functors (Co)ShlgC(−):TAlg→ShCAT.
If F1∈CoShlgC(x⩽) and F2∈CoShlgC(y⩽) are two object-sections of CoShlgC(X), then F1 and F2 are compatible if F1∣(x∧y)⩽=F2∣(x∧y)⩽. But we find a subtle difference between the compatibility in Theorem 6.2.1 and the compatibility we need, which is F1∣(x∧y)⩽≅F2∣(x∧y)⩽, and what is more annoying is that a family of local cosheaves compatible to each other can’t always be glued to a larger cosheaf. However, we just need to change the definition of CoshlgC(X) slightly to get what we need with the help of sheafication which provides the concept of abstractly gluing.
Consider a presheaf in form
[TABLE]
where ≅ represents natural isomorphism, which means each CoShlgC,p(X)(x) is a skeleton quotient category. Obviously, isomorphic cosheaves’ restrictions are isomorphic, but equivalent nats’ restrictions are not necessarily equivalent, so we require that all CoShC(x⩽)’s choices of cochain groups must lead to α∼Morβ⇒α∣x⩽∼Morβ∣x⩽, where α,β:y⩽→Mor(C) ara nats between C-cosheaves on y⩽, from now on, functors CoShlgC,p(X)(x⩽y)={[F]↦[F∣x⩽][α]↦[α∣x⩽] get their rationality, and we can naturally write [F∣x⩽] and [α∣x⩽] as [F]∣x⩽ and [α]∣x⩽, meanwhile there is a natural projection p:CoShlgC(X)→CoShlgC,p(X), now we see that ways to quotient is determined by natural projections, so we write the quotient presheaf determined by p as CoShlgC,p(X) for convenience.
Let {[Fα]∈CoShlgC,p(X)(Uα)}α∈J is a family of compatible object-sections, which means [Fα]∣Uα∧Uβ=[Fβ]∣Uα∧Uβ, then choose any representative elements {Fα}, there naturally exists a group of natural isomorphisms {φαβ:Fα∣Uα∧Uβ→Fβ∣Uα∧Uβ} which are members in the cochain groups of [Fα∣Uα∧Uβ]s, in other word, in the equivalence classes [idFα∣Uα∧Uβ]s, notice that functors CoShlgC,p(X)(x⩽y) are identity-preservative, in other word, functors CoShlgC,p(X)(x⩽y) map members in cochain groups to members in cochain groups, so {φαβ} satisfies the cochain condition with restrictions, which means {Fα} and {φαβ} gives a smooth structure. Now we explain that all choices of family of compatible object-sections represent the same smooth structure: let {Fα}α∈J and {Gα}α∈J are two choices, {φαβ} and {ψαβ} are their cochain groups, and {ωα:Fα→Gα∈[idFα]} are isomorphisms, easy to see that ψαβ=ωβ∣Uα∧Uβ∘φαβ∘(ωα∣Uα∧Uβ)−1, in reverse, φαβ=(ωβ∣Uα∧Uβ)−1∘ψαβ∘ωα∣Uα∧Uβ, so they can be transformed to each other by some isomorphisms, which means they are essentially the same. Therefore, we obtain:
Definition 6.2.1Ob
Let X∈TAlg, then a quotient presheaf CoShlgC,p(X)’s sheafication CoShlgC,p(X) is called a category sheaf of local C-manifolds on X. Its global object-section Σ∈ObCoShlgC,p(X)(1X) is called a C-manifold structure on X, and two-tuples (X,Σ) a C-manifold. And we call a covering {(xα,Σ∣xα)} of (X,Σ) an atlas of it, if all Σα are local cosheaves.
Now we see that a category sheaf of local manifolds is namely a skeleton quotient sheaf of CoShlg. The C-manifolds defined here are the most general situation, of course, we can put some restrictions on them, such as apex, Hausdorff and so on to reach the demand of various concrete mathematical researches.
To discuss morphisms between C-manifolds, we need promote CoShlgC(f) to CoShlgC,p,q(f). Firstly easy to construct the functor
[TABLE]
if p and q satisfy ∀y∈Y,α∼Morβ⇒α∘(f∣y⩽)∼Morβ∘(f∣y⩽). Then using the functor −:PShCAT→ShCAT we have CoShlgC,p,q(f):CoShlgC,p(X)∘f→CoShlgC,q(Y), where CoShlgC,p(X)∘f is equal to CoShlgC,p(X)∘f.
Definition 6.2.1Mor
Let (X,Σ) and (Y,Γ)C-manifolds. Then a morphism from (X,Σ) to (Y,Γ) is a two-tuples \bigl{(}f:Y\to X,\;\alpha:\overline{CoSh_{lg}^{\mathcal{C},p,q}(f)}(1_{Y})(\Sigma)\to\Gamma\bigr{)}, namely α is a global morphism-section α∈MorCoShlgC,q(Y)(1Y).
Then we get the category of C-manifolds ManC. Particularly, if C is a subcategory of Set, then C-manifolds can be regarded as topological spaces: CoShlgSet(X)/≅ is already a sheaf, that is, local Set-cosheaves always can be glued to a larger cosheaf. This characteristic depends on some sorts of inner symmetry of Set.
Let (X,Σ)∈ManC, there is an embedding functor
[TABLE]
which is a cosheaf.
6.3 Smooth Manifolds
A smooth manifold is an apex-Smo-manifold, that is, any its atlas is a family of apex cosheaves. Of course, we can put on some other conditions to reach concrete researches, such as compact, Hausdorff and having a countable basis. Subcategories Smon of Smo don’t have isomorphic objects mutually, so an atlas is always a family of Smon-cosheaves with a specific index n, and we call it Smo-manifold’s dimension.
Lemma 6.3.1
Let F:X→C a cosheaf, then for any A∈C, HomA(−)∘F is a Set-sheaf. Dually, let F:X→C a sheaf, then for any A∈C, HomA(−)∘F is a Set-sheaf.
Proof.
We only prove the first and the second is similar. The gluing axiom HomA(−)∘F on is a direct corollary of Theorem 4.2.3. Because F(0X) is the initial object, so Hom(F(0X),A) is a single point set, namely the terminal object of Set.
∎
If A is a C-object, where C is a concrete category whose terminal object appears as a single point set, then the lemma is still true, especially Ab, Rng and Cat/CAT.
There are special objects on ManSmo. The 1-dimensional Euclidean space R1 is a ring object on ManSmo, so if M=(X,σ)∈ManSmo, then HomR(−)∘inσ is the sheaf of smooth scalar fields F(M).
Bibliography5
The reference list from the paper itself. Each links out to its DOI / PubMed record.
1[1] Saunders Mac Lane.Categories for the Working Mathematician.Springer-Verlag New York 1971.
2[2] M.A.Armstrong.Basic Topology.Springer-Verlag New York 1983.