Abstract Some of the so called smallness conditions in algebra as well as in Category Theory, important and interesting for their own and also tightly.

Slides:



Advertisements
Similar presentations
Introduction The concept of transform appears often in the literature of image processing and data compression. Indeed a suitable discrete representation.
Advertisements

Event structures Mauro Piccolo. Interleaving Models Trace Languages:  computation described through a non-deterministic choice between all sequential.
Number Theory and Cryptography
Chap6 Relations Def 1: Let A and B be sets. A binary relation from A
Basic Properties of Relations
1.  We have studied groups, which is an algebraic structure equipped with one binary operation. Now we shall study rings which is an algebraic structure.
Groups TS.Nguyễn Viết Đông.
Algebraic Structures: Group Theory II
1.  Detailed Study of groups is a fundamental concept in the study of abstract algebra. To define the notion of groups,we require the concept of binary.
Transparency No. 2-1 Formal Language and Automata Theory Chapter 2 Deterministic Finite Automata (DFA) (include Lecture 3 and 4)
PART 2 Fuzzy sets vs crisp sets
CSE115/ENGR160 Discrete Mathematics 04/24/12 Ming-Hsuan Yang UC Merced 1.
Transparency No Formal Language and Automata Theory Chapter 10 The Myhill-Nerode Theorem (lecture 15,16 and B)
FSM Decomposition using Partitions on States 290N: The Unknown Component Problem Lecture 24.
Transparency No Formal Language and Automata Theory Chapter 10 The Myhill-Nerode Theorem (lecture 15,16 and B)
Theory and Applications
Preliminaries/ Chapter 1: Introduction. Definitions: from Abstract to Linear Algebra.
Transparency No. 8-1 Formal Language and Automata Theory Chapter 8 DFA state minimization (lecture 13, 14)
Relations Chapter 9.
Logics for Data and Knowledge Representation Introduction to Algebra Chiara Ghidini, Luciano Serafini, Fausto Giunchiglia and Vincenzo Maltese.
Category Theory By: Ashley Reynolds. HISTORY OF CATEGORY THEORY  In 1942–45, Samuel Eilenberg and Saunders Mac Lane introduced categories, functors,
Math 3121 Abstract Algebra I Lecture 3 Sections 2-4: Binary Operations, Definition of Group.
Mathematics. Session Set, Relation & Function Session - 3.
By: Hector L Contreras SSGT / USMC
1 On one-generated projective BL-algebras Antonio Di Nola and Revaz Grigolia University of Salerno Tbilisi State University Department of Mathematics Institute.
Network Systems Lab. Korea Advanced Institute of Science and Technology No.1 Appendix A. Mathematical Background EE692 Parallel and Distribution Computation.
Chapter 9. Chapter Summary Relations and Their Properties Representing Relations Equivalence Relations Partial Orderings.
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Monoids, Groups, Rings, Fields
Discrete Math for CS Binary Relation: A binary relation between sets A and B is a subset of the Cartesian Product A x B. If A = B we say that the relation.
Chapter 9. Section 9.1 Binary Relations Definition: A binary relation R from a set A to a set B is a subset R ⊆ A × B. Example: Let A = { 0, 1,2 } and.
Precise definition of limits The phrases “x is close to a” and “f(x) gets closer and closer to L” are vague. since f(x) can be arbitrarily close to 5 as.
Products and Sums
Chapter 5 – Relations and Functions. 5.1Cartesian Products and Relations Definition 5.1: For sets A, B  U, the Cartesian product, or cross product, of.
The homology groups of a partial monoid action category Ahmet A. Husainov
Mathematical Induction
Universidad Nacional de ColombiaUniversidad Nacional de Colombia Facultad de IngenieríaFacultad de Ingeniería Departamento de Sistemas- 2002Departamento.
1 Discrete and Combinatorial Mathematics R. P. Grimaldi, 5 th edition, 2004 Chapter 5 Relations and Functions.
Problem Statement How do we represent relationship between two related elements ?
Chapter 9. Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations.
Unit II Discrete Structures Relations and Functions SE (Comp.Engg.)
UNIT - 2.  A binary operation on a set combines two elements of the set to produce another element of the set. a*b  G,  a, b  G e.g. +, -, ,  are.
Some Aspects of Quasi-Stone Algebras, II Solutions and Simplifications of Some Problems from Sankappanavar and Sankappanavar Jonathan David Farley, D.Phil.
Great Theoretical Ideas in Computer Science.
Math 3121 Abstract Algebra I Lecture 14 Sections
Set Theory Concepts Set – A collection of “elements” (objects, members) denoted by upper case letters A, B, etc. elements are lower case brackets are used.
Relations and Functions ORDERED PAIRS AND CARTESIAN PRODUCT An ordered pair consists of two elements, say a and b, in which one of them, say a is designated.
Great Theoretical Ideas in Computer Science.
Process Algebra (2IF45) Basic Process Algebra Dr. Suzana Andova.
Divisibility and Modular Arithmetic
Chapter 6- LINEAR MAPPINGS LECTURE 8 Prof. Dr. Zafer ASLAN.
Chapter 4 With Question/Answer Animations 1. Chapter Motivation Number theory is the part of mathematics devoted to the study of the integers and their.
Prepared By Meri Dedania (AITS) Discrete Mathematics by Meri Dedania Assistant Professor MCA department Atmiya Institute of Technology & Science Yogidham.
MATRICES A rectangular arrangement of elements is called matrix. Types of matrices: Null matrix: A matrix whose all elements are zero is called a null.
Relations Chapter 9 Copyright © McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
Discrete Mathematical
Relations and Their Properties
Relations.
Unit-III Algebraic Structures
Relations Chapter 9.
Great Theoretical Ideas in Computer Science
MATH301- DISCRETE MATHEMATICS Copyright © Nahid Sultana Dr. Nahid Sultana Chapter 4: Number Theory and Cryptography.
IDEALS AND I-SEQUENCES IN THE CATEGORY OF MODULES
Great Theoretical Ideas in Computer Science
Applied Discrete Mathematics Week 5: Boolean Algebra
Preliminaries/ Chapter 1: Introduction
Basics of Relations.
WELCOME.
Agenda Lecture Content: Relations (Relasi)
Presentation transcript:

Abstract Some of the so called smallness conditions in algebra as well as in Category Theory, important and interesting for their own and also tightly related to injectivity, Essential Bounded, Cogenerating set, and Residual Smallness. Here we want to see the relationships between these notions and to study these notions in the class mod( ∑, E ). That is all of objects in the Grothendick Topos E which satisfy ∑, ∑ is a class of equations. Introduction In the whole of this talk A is an arbitrary category and M is an arbitrary subclass of its morphisms. Def. Let A be an arbitrary category and M be an arbitrary subclass of it’s morphisms, also A and B are two objects in A. We say that A is an M - subobject of B provided that there exists an M - morphism m:A  B.

Def. One says that M has “good properties” with respect to composition if it is: (1) Isomorphism closed; that is, contains all isomorphism and is closed under composition with isomorphism. (2) Left regular; that is, for f in M with fg=f we have g is an isomorphism. (3) Composition closed; that is, for f:A  B and g:B  C in M, gf is also in M. (4) Left cancellable; that is, gf is in M, implies f is in M. (5) Right cancellable; that is, gf is in M, implies g is in M. In this case we say that (A,m) is an M - subobject of B, or (m, B ) is an M- extension for A. The class of all M - subobjects of an object X is denoted by M/ X, and the class of all M -extensions of X is denoted by X/ M. We like the class of M -subobjects M /X to behave proper. This holds, if M has good properties. We can define a binary relation ≤ on M/ X as follows:

If (A,m) and (B,n) are two M - subobjets of X, we say that (A,m)≤(B,n) whenever there exists a morphism f:A  B such that nf=m. That is AX B m n f One can easily see that ≤ is a reflective and transitive relation, but it isn’t antisymmetric. But if M is left regular, ≤ is antisymmetric, too up to isomorphism. Similarly, one defines a relation ≤ on X/ M as follows: If (m,A) and (n,B) belong to X/ M, we say (m,A)≤(n,B) whenever, there exists a morphism f:A  B such that fm = n. That is: XA B m n f Also it is easily seen that (X/ M, ≤) forms a partially ordered class up to the relation ∼. Where (m,A) ∼ (n,B) iff (m,A) ≤ (n,B) and (n,B) ≤ (m,A). So from now on, we consider (X/ M,≤ ) up to ∼.

Def. In Universal Algebra we say that A is subdirectly irreducible if for any morphism f:A ∏ i in I A i with all P i f epimorphisms, there exists an index i 0 in I for which p i0 f is an isomorphism. The following definition generalizes the above definition and it is seen that these are equivalent for equational categories of algebras. Def. An object S in a category is called M- subdirectly irreducible if there are an object X with two deferent morphisms f,g:X  S s.t. any morphism h with domain S and hf≠hg, belongs to M. See the following: SX  f g B h s.t. hf ≠ hg ⇒ h ∈ M Def. An M- chain is a family of X/ M say {(m i,B i )} i in I which is indexed by a totally ordered set I such that if i ≤j in I then there exists a ij :B i  B j with a ij m i i =m j. Also we have a ii = id Bi and for i ≤j ≤k, a ik =a jk a ij. Also when the class of M- subdirectly irreducible objects in a category A forms just only a set we say that A is M- residually small

Def. An M- well ordered chain is an M- chain which is indexed by a totally well ordered set I. X B0B0 B1B1 B2B2 BnBn B n+1 m1m1 m2m2 mnmn m n+1 f 01 f 12 f n n+1 m0m0

Essential Boundedness and Residul Smallness Def. A is said to be M- essentially bounded if for every object A ∈ A there is a set {m i: A  B i : i ∈ I } ⊆ M s.t. for any M- essential extension n:A  B there exists i 0 ∈ I and h:B  B i0 with m i0 =hn. The. M *-cowell poweredness implies M -essential boundedness. Conversely, if M=M ono, A is M -well powered and M -essentially bounded, then A is M *-cowell powered. Def. An M -morphism f:A  B is called an M -essential extension of A if any morphism g:B  C is in M whenever g f belongs to M. the class of all M - essential extension (of A) is denoted by M * ( M * A ). Note. A category A is called M -cowell powered whenever for any object A in A the class of all M -extensions of A forms a set.

The. Let M=M ono and E be another class of morphisms of A s.t. A has (E,M)- factorization diagonalization. Also, let A be E- cowell powered and have a generating set G s.t. for all G ∈ G, G ப G ∈ A. Then, M *-cowell poweredness implies M- residual smallness. Coro. Under the hypothesis of the former theorems, we can see that residual smallness is a necessary condition to having enough M - injectives when M=M ono. The. If A has enough M - injectives then A is M - essentially bounded.

Def. A has M -transferability property if for every pair f, u of morphisms with M -morphism f one has a commutative square AB C ⇒ A C B D f u f v with M -morphism g. Lem. If A has enough M - injectives then, A fulfills M - transferability property. Def. We say that A has M- bounds if for any small family {h i :A  B i : i ∈ I }≤ M there exists an M- morphism h:A  B which factors over all h i,s. g The. Let A satisfy the M- transferability and M- chain condition, and let M be closed under composition. Then, A has M -bounds. u

Cogenerating set and Residual Smallness Def. A set C of objects of a category is a cogenerating set if for every parallel different morphisms m,n:x  Y there exist C ∈ C and a morphism f:Y  C s.t. fm≠fn. XYXY m n C f The. Let A have a cogenerating set C and A be M- well powered. Then A is M- residually small. Prop. For any equational class A, the following conditions are equivalent: (i) Injectivity is well behaved. (ii) A has enough injectives. (iii) Every subdirectly irreducible algebra in A has an injective extension. (iv) A s atisfies M -transferability and M *- cowell poweredness.

The. Let M=M ono and A be well powered with products and a generating set G. Then, having an M- cogenerating set implies M*- cowell poweredness. ( i) A is M- essentially bounded. Corollary. Let M=M ono and A be well powered and have products and (E,M)- factorization diagonalization for a class E of morphisms for which A is E- well powered. Then T. F. S. A. E. ( ii) A i s M *-cowell powered. (iii) A is M -residually small. (iv) A has a cogenerating set.

Injectivity of Algebras in a Grothendieck Topos Now we are going to see and investigate these notions and theorems in mod ( ∑, E ). To do this we compare the two categories mod ( ∑, E ) and mod ( ∑). Def. Note.

Def. Note. Coro. Def.

Lem. Res. Coro. The. Prop.

The. Prop. Lem.

The.