Go Mapping Theory and Factor Space Theory Part I: An Outline

. Inspired by Professor Wang, Peizhuang’s Factor Space The-ory(FST), we propose a new scheme, called GO Mapping Theory, or GMT in short, to formalize the concept formation knowledge representation of AI. This scheme can be viewed as an extension of Willie’s Formal Concept Analysis(FCA), PZ Wang’s Factor Space Theory, and it naturally includes Gouguen’s L-Fuzzy Sets therefore it sounds a uniﬁed soft computing scheme. Potentially, GMT can be used for human-like knowledge representation and computation by modern computers. By deploying Grothendieck’s topos theory (this is the origin for the name GO mapping), we developed a uniﬁed mathematical language under-standable by robots which can represent human language: concepts and logic, which also uniﬁed the current learning techniques at a more ab-stract level, therefore can be used as a basis for AGI or Super AI. By restating FST under category language, one can have a much more general setup for classical reductionist’s view about multiple sensory sys-tem, we call it a cognitive frame. Then under the assumption of uncer-tainty of any measurement, we can naturally, in fact ontologically, obtain an L-fuzzy set by FST, then we can construct from this L-fuzzy set a L-presheaf by standard procedure, we call it the GO mapping, which by Barr’s Embedding Theorem, can be viewed as the natural replacement for classical fuzzy sets. In fact, in topos theory, FST and GMT pairs a geometric morphism in Grothendieck’s topos theory, which shows the amazing power of pure math in real life applications.


Factor Space Theory (FST)
Introduced by Prof Wang, PZ around 80's, [4], we have Definition 1. Let U be a set, called the universe, f : U → V f is a map, we call f a factor for U . If {f : U → V f } is a set of factors, we call SS = V f the state space and F : U → SS the factor space.
The basic idea is this: when we want to know U , or an object in U , we try to use several "detectors", or "sensors/measurements/instruments ", to gauge/measure U , we call these detectors "the factors" (by Wang). This is in fact the reductionist / instrumentalists idea.
Afterwards, we try to analyze the result in the state space to see, to find out where these values falling. And from there, one can do logic operations and draw conclusions and extract information about U .
In this paper, we will assume all sets are topological spaces and we would like to modify the definition 1 slightly as follows: Before giving the definition, let's recall some terminologies from category theory.

Definition 2.
A diagram D in a category C is a collection of objects as vertices and some morphisms among these objects as edges.
A cone X is for a diagram D in C is a collection of arrows f i : X → D i such that for any g : This way, we can rewrite the factor space theory as follows. From cognitive point of view, we can identify a cone as the most general format of factor space theory. Or we can view a cone as a cognitive frame for object X. D can be viewed the collection of instruments.
Let's remind what is the limit for a diagram. In a short sentence, the limit is a universal object satisfying 1. It is a cone for D, denoted by lim D 2. It is a "minimum" cone among all cones over D which means for any cone K over D, ∃! arrow F : K → lim D such that After these preparation, we can give a more elegant definition for Factor Space Theory.
Definition 3. Let Top be the category with topological spaces as objects and continuous maps as arrows. Then any diagram in Top has the limit. We call any cone {f : U → V f } in Top the cognitive frame for the universe U We call lim V = lim{V f } the state space and the unique map F : U → lim V the cognitive map.
In 80's, Wille developed a concept called Formal Concept Analysis, FCA in short. FCA has gained great applications in computer science. In We call A and B are Galois connected and (A, F, B) a formal concept.
This theory in some sense encodes the classic concept in classic logic for computer science. It is easily identified that set A is the extension for a concept, and B is the intension for this concept. Obviously, FCA (A, F, B) has best captured the classical usage of concepts for bots, if human mind can be determined by Boolean logic. In the work of [?], we prove that under definition 3, we have Hence, from section 1, we know that one cognitive from theory (CFT) is the most general set operation:

Gouguen's L-fuzzy sets and Barr's Embedding
Let H be a Heytin algebra. Then Gouguen introduced a category of H-fuzzy sets by define: Unfortunately, Fuz(H) is not a topos except H is a Boolean algebra. The great advantage for working math, AI, mind computing is that Topos behaves almost like Sets, except the law of excluding the middle (LEM) .
In real life logic, LEM probably the most wrong law human follows, hence it is born for abandoning .
However, to proceed the basic logic deduction, subsets, power sets, produts, limit, colimit and all basic ingredients. Topos provide all these needed goodies.
1980s Michael Barr [3] & Pitts both showed that the Gouguen category is not a topos, but can be embedded in some way into a topos. Here we will give a short description on Barr's construction.
∀α ∈ H, we can define a "level" set X α = {y ∈ X : x(y) ≥ α}, then we call the collection T (X) =X = {X α : α ∈ H} the tow of X. One can prove that T : Fuz(H) → Tow(H) is an isomorphism of categories. Each element in fact looks like G : H → Sets satisfying the axioms for presheaf, i.e. G is a contravariant functor from partial order set considered as a category to the category set. The Barr proved by providing an initial element z to H, one can "embed" the cat Tow(H) into a topos Sh(H + ), where H + = H ∪ {z}, z < a ∀a ∈ H and Sh(H + ) is the category of H + -sheaves. This is a very significant result. Because one can translate every "fuzzy" math problem into a problem about sheaf/presheaf then using the powerful tool sets since Grothendieck developed algebraic geometry. This is analogue to embedding the rationals to reals! From Barr and Pitts, we in fact showed how to consider every presheaf G : H → Sets to be some sort of "fuzzy sets" or "fuzzy concepts". Using presheaves directly instead of the Zadeh/Gouguen fuzzy sets will provide powerful tools for soft computing & AI, from our perspective.

The GO Mapping Theory (GMT)
In general in a real world, any measurement can be viewed as a function Normally, V is a finitely dimensional vector space equipped with a positive metric C, most possibly a metric/a topology induced by an L P -norm, p = 1, 2, ∞ would be the most popular ones. Then people will define/conceptualize a thing based on the values of the measurement. This is established since Aristotle's era and in 1980's formalised by FST, FCA and Feng's Property Mapping Theory (PMT).
Here we will develop a new scheme which can include all the theories above as a special case and naturally incorporate the intrinsic fuzziness of measurements and human mind computation.
Let's go back to the example above. In reality, no measurement is precise (in face we do not have a god given correct precise value for any), hence in most cases what we know is that ∀u ∈ U , f (u) is some neighborhood of a center value x ∈ V , i.e. f (u) ∈ B(x) This way, one is more interested in f where P Sh stands for the topos of presheaves. This way, we can construct the GO mapping for a cognitive frame as follows: Let F : U → V = lim V f be the factor mapping. ∀s ∈ P Sh(U ), We will call F * • s : O(V ) → Sets a GO mapping by "Fuzzy" set s. In fact, ∀B ∈ O(V ), F * • s(B) = s (F −1 (B)). Sometime we also call the functor F * the GO mapping, denote it by G.