2MA105 Algebraic Structures I
|
|
- Chad Turner
- 5 years ago
- Views:
Transcription
1 2MA105 Algebraic Structures I Per-Anders Svensson Lecture 12
2 Partially Ordered Sets Lattices Bounded Lattices Distributive Lattices Complemented Lattices Boolean Algebras December 19, (34)
3 Partially Ordered Sets Definition (Partial Ordering, Partially Ordered Set; Poset) A relation on a set X is called a partial ordering on X, if it is reflexive, i.e. a a for all a X, antisymmetric, i.e. if a b and b a imply a = b for all a,b X, and transitive, i.e. if a b and b c imply a c for all a,b,c X. We will sometimes write x y to point out that x y but x y. If is a partial ordering on X, then the pair (X, ) is called a partially ordered set (or poset, for short). December 19, (34)
4 Example Properties of the divisibility relation make (Z +, ) into a poset, since for all positive integers a,b,c we have a a (reflexivity) a b and b a = a = b (antisymmetry) a b and b c = a c (transitivity). Example Let M be a set. Then the power set P(M ), i.e. the set of all subsets of M, is a poset with respect to. This is due to A A (reflexivity) A B and B A = A = B (antisymmetry) A B and B C = A C (transitivity) for all subsets A,B,C of M. December 19, (34)
5 A finite poset X can be illustrated by a Hasse diagram; a graph, in which every node represents an element of X. If x,y X are such that x y, and if there are no elements z X such that x z y, then the graph has an edge between the two nodes that represent x and y. Furthermore, the node of y is placed higher up in the diagram, than the node of x (since x y). Example Let M = {a,b,c}. Then a Hasse diagram of the poset (P(M ), ) is {a,b,c} {a,b} {a,c} {b,c} {a} {b} {c} December 19, (34)
6 We may use a Hasse diagram to define a partial ordering on a finite set. Example Let X = {a,b,c,d,e,f,g,h}. The Hasse diagram below defines a partial ordering on this set. a b c d e f g According to the diagram we have for instance e b and h a (we can travel from h to a, only by moving upwards in the Hasse diagram). However, e d, since when going from e to d, you must at some occasion move downwards in the diagram. h December 19, (34)
7 Definition (Upper Bound, Supremum, Lower Bound, Infimum) Let (X, ) be a poset and Y a subset of X. An element s X is called an upper bound of Y, if y s for all y Y. If this s are such that s t for all upper bounds t of Y, then s is called a supremum of Y. An element i X is called a lower bound of Y, if i y for all y Y. If for this i, every lower bound j of Y fulfills j i, then i is called an infimum of Y. Theorem Let (X, ) be a poset and Y a subset of X. Then there are at most one supremum and at most one infimum of Y in X. Proof. Suppose s 1 and s 2 are two suprema of Y. Then s 1 and s 2 are upper bounds of Y. By regarding s 1 as a supremum and s 2 as an upper bound of Y, we obtain s 1 s 2. If we instead regard s 2 as a supremum and s 1 as an upper bound, we get s 2 s 1. Thus s 1 s 2 and s 2 s 1. Since is antisymmetric, s 1 = s 2 follows. The uniqueness of infimum is proved similarly. December 19, (34)
8 Since supremum and infimum of a subset Y of a poset are uniquely determined, in case they exist, we may introduce the notations sup Y for the supremum of Y and infy for the infimum of Y. If Y = {y 1,y 2,...,y n } is finite, we will write sup(y 1,y 2,...,y n ) instead of sup({y 1,y 2,...,y n }), and similarly for inf. Example Let X = {a,b,c,d,e,f,g,h} and consider the poset (X, ), where is defined by the adjoining Hasse diagram. Let Y = {c,e,f }. (The elements of Y are written in red in the diagram.) There are two upper bounds of Y, namely a and c, since these elements are both larger than or equal to every element of Y. The least upper bound is c, so supy = c. There are no lower bounds of Y, and therefore no infimum. a b c d e g f h December 19, (34)
9 Example Let M = {a,b,c} and consider the subset Y = { {a,b}, {b,c} } of the poset (P(M ), ). The upper bounds of Y are those elements in P(M ) that contain {a,b} as well as {b,c}. The only upper bound is M, so supy = M. An element of P(M ) is a lower bound of Y, if and only if it is a subset of both {a,b} and {b,c}. There are two such lower bounds: {b} and, so infy = {b}. {a,b,c} {a,b} {a,c} {b,c} {a} {b} {c} Note that supy = {a,b,c} = {a,b} {b,c} is the union and infy = {b} = {a,b} {b,c} is the intersection of the two members of Y. December 19, (34)
10 Lattices A closer inspection of the previous example reveals that supremum and infimum of any pair (A,B) of subsets of M exist and are equal to A B and A B, respectively. This is true in (P(M ), ), no matter what set M is, i.e. we have sup(a,b) = A B and inf(a,b) = A B for all A,B P(M ): That inf(a,b) = A B is due to A B being the largest subset of M, that is a subset of both A and B; A B is the greatest lower bound of A and B. That sup(a,b) = A B is due to A B being the smallest subset of M, that contains both A and B; A B is the least upper bound of A and B. Definition (Lattice) Let L be a poset. If sup(a,b) and inf(a,b) exist for every a,b L, then L is said to be a lattice. Example Let M be a set. By the discussion above, (P(M ), ) is a lattice. December 19, (34)
11 Example The poset (R, ) is a lattice, since for each pair (a,b) of real numbers, sup(a,b) and inf(a,b) exist and are given by max(a,b) and min(a,b), respectively. Example The poset (Z +, ) is also a lattice. To prove this: let a and b be two positive integers. Suppose c is a lower bound of a and b. Then c a and c b, i.e. c is a common divisor of a and b. If d = inf(a,b) exists, then on one hand d a and d b (i.e. d is a common divisor of a and b), and on the other hand c d (i.e. d is larger then any common divisor c, with respect to ). Hence inf(a,b) = gcd(a,b). By a similar argument, sup(a, b) = lcm(a, b). December 19, (34)
12 Since supremum and infimum of a set are uniquely determined (once they exist), and since we in a lattice L require that supremum and infimum exist, for each pair of elements in L, we can in a natural way define two binary operations on L. Definition (Join, Meet) Let L be a lattice. The binary operations and on L, defined by a b = inf(a,b) and a b = sup(a,b) for all a,b L, are called the meet and join, respectively, of a and b. Example When considering the power set P(M ) as a lattice, the meet corresponds to intersection of sets, and the join corresponds to union of sets. December 19, (34)
13 Example On the lattice (Z +, ) we have a b = gcd(a,b) and a b = lcm(a,b) (see the previous example). Hence we have, for instance, 3 (5 6) = 3 lcm(5,6) = 3 30 = gcd(3,30) = 3. Example The Hasse diagram to the right defines a lattice on the set X = {a 1,a 2,...,a 9 }. Using the diagram, we may compute e.g. a 2 a 3 = a 5, a 2 a 3 = a 1 a 5 a 6 = a 3, a 5 a 6 = a 9 a 7 a 6 = a 9, a 7 a 6 = a 3 a 3 a 8 = a 3, a 3 a 8 = a 8 a 2 (a 3 a 4 ) = a 2 a 1 = a 2 (a 2 a 3 ) (a 2 a 4 ) = a 5 a 9 = a 5 a 1 a 2 a 3 a 4 a 5 a 6 a 7 a 8 a 9 December 19, (34)
14 The following theorem establishes a connection between the binary operations and, and the partial ordering, and will therefore frequently be referred to. Theorem Let a and b be elements of a lattice L. Then a b a b = a a b = b. Corollary In a lattice, each element is idempotent with respect to both and, meaning that a a = a a = a for all a L. December 19, (34)
15 Theorem Let L be a lattice. Then (i) and are commutative (ii) and are associative (iii) a (a b) = a and a (a b) = a for all a,b L, i.e. the so-called absorption laws are fulfilled. Given a purely algebraic structure (L,, ), where and are binary operations on L that satisfies the laws in the theorem above, we can on L define a partial ordering that makes (L, ) into a lattice. Theorem Let (L,, ) be an algebraic structure, such that and are commutative, associative, and fulfills the two absorption laws. Then the relation on L, defined by a b a b = a for all a,b L, is a partial ordering on L. For we have that sup(a,b) and inf(a,b) both exist, for all a,b L, and are equal to a b and a b, respectively. In other words, (L, ) is a lattice. December 19, (34)
16 Bounded Lattices When dealing with sets, we recognize among other things, the following rules: Suppose A,B,C P(M ). Then (i) A (B C ) = (A B) C; A (B C ) = (A B) C (ii) A B = B A; A B = B A (iii) A M = A; A = A (iv) A = ; A M = M (v) A (A B) = A; A (A B) = A (vi) A A = M; A A = (vii) A (B C ) = (A B) (A C ); A (B C ) = (A B) (A C ). Here we recognize the associative laws (i), commutative laws (ii), and absorption laws (v), which together imply that (P(M ),, ) is a lattice. We now intend to generalize the remaining laws above, to any lattice (L,, ), starting with (iii) and (iv). December 19, (34)
17 Definition (Universal Upper/Lower Bound) Let (X, ) be a poset. An element a X is called a universal upper bound of X, if x a for all x X. Similarly, if a x for all x X, we say that a is a universal lower bound of X. Universal upper and lower bounds are uniquely determined, in case they exist. Example In the power set P(M ) we have that M is the universal upper bound, since A M for all A P(M ). The universal lower bound of P(M ) is, since A for all A P(M ). a Example b In the poset defined by the adjoining Hasse diagram (taken from a previous example), a is the universal c d upper bound. There is no universal lower bound. (A reason that e.g. h is not the universal lower bound, is that h e.) e g f h December 19, (34)
18 Definition (Bounded Lattice) A lattice L is said to be bounded, if it contains both universal upper and lower bounds. If this is the case, these elements are denoted 1 L (upper bound) and 0 L (lower bound). Theorem A lattice (L,, ) is bounded, if and only if it contains identity elements with respect to and, in shape of 1 L and 0 L, respectively. Example In the lattice (P(M ),, ) we have that M (the universal upper bound) is an identity element with respect to, while (the universal lower bound) is an identity element with respect to. December 19, (34)
19 Example Consider the lattice (Z +, ). In an earlier example, we found that a b = lcm(a,b) and a b = gcd(a,b). According to the theorem above, an identity element with respect to should be the universal lower bound, which is 1, since 1 a for all a Z +. This is actually the case, since a 1 = lcm(a,1) = a for all a Z +. Since there is no universal upper bound in Z + (there is no b Z + such that a b for all a Z + ), there is no identity element with respect to. December 19, (34)
20 Distributive Lattices Among the rules of arithmetics for union and intersection of sets, we find the distributive laws A (B C ) = (A B) (A C ); A (B C ) = (A B) (A C ). These are now to be generalized to arbitrarily lattices. Definition (Distributive Lattice) A lattice L is said to be distributive, if the distributive laws are fulfilled for any a,b,c L. a (b c) = (a b) (a c) a (b c) = (a b) (a c) Example (P(M ),, ) is a distributive lattice. December 19, (34)
21 Example Suppose A,B,C P(M ). Is it then true that the cancellation laws holds, i.e. A B = A C = B = C (1) for, and for? A B = A C = B = C (2) Let M = {1,2,3,4,5}, A = {1,2,3}, B = {3,4}, and C = {3,5}. Then A B = A C = {3} but B C, which contradicts (1). (Find your own counterexample of (2).) But if we know that both A B = A C and A B = A C, then we must have B = C. December 19, (34)
22 Theorem (Cancellation Law) Let a, b, and c be elements of a distributive lattice L. Suppose a b = a c and a b = a c. Then b = c. Proof. On one hand b = b (a b) while on the other hand, Absorption Law = b (a c) a b = a c = (b a) (b c) Distributive Law, c = c (a c) Absorption Law = c (a b) a b = a c = (c a) (c b) Distributive Law. But since a b = a c (and is commutative), the two right-hand sides above are equal. Hence b = c. December 19, (34)
23 Complemented Lattices Among the different laws that are valid in the lattice (P(M ),, ), we have left to formulate A A = ; A A = M for general lattices. We note that this cannot be done for all possible lattices; in the formulae above we find M and, the universal upper and lower bounds of P(M ), which means that the lattice in question has to be bounded. Definition (Complement, Complementary Lattice) Let L be a bounded lattice and a an element of L. An element b L is called a complement of a, if a b = 0 L and a b = 1 L. If each element of L have a complement, we say that L is a complementary lattice. Example The power set P(M ) is a complementary lattice. Each A P(M ) has a uniquely determined complement, namely A = M \ A, since A A = och A A = M. December 19, (34)
24 Example Let L = {1,2,3,4,6,12} be all positive divisors of 12. Then (L,, ) is a bounded lattice, if a b = gcd(a,b) and a b = lcm(a,b); we have 1 L = 12 and 0 L = 1, see the adjoining Hasse diagram. The only elements of L, having a complement, are 1, 3, 4, and 12; we see that 1 and 12 are each others complements, as well as 3 and 4. The elements 6 and 2 have no complements. For example 4 cannot be a complement of 6; certainly 6 4 = 12 = 1 L but on the other hand, 6 4 = 2 0 L. This lattice is thus not complementary. Example An element of a bounded lattice has not necessarily a uniquely determined complement. Consider e.g. the lattice defined by the Hasse diagram to the right. Here a has two complements: b and c. Is the lattice complementary? a 1 L 0 L b c December 19, (34)
25 As we saw in the previous example, an element of a bounded lattice has not necessarily a uniquely determined complement. What must be fulfilled for this to be the case? Theorem An element in a bounded lattice has at most one complement, whenever the lattice is distributive. Proof. Let L be a bounded distributive lattice. Suppose a L has two complements b and c. Then a b = a c = 0 L and a b = a c = 1 L. But in a distributive lattice, the Cancellation Law holds (i.e. if a b = a c and a b = a c, then b = c). Hence the two complements of a are equal. December 19, (34)
26 Boolean Algebras Definition (Boolean Algebra) A Boolean algebra is a lattice that is both distributive and complementary. A Boolean algebra is a bounded lattice and therefore contains universal upper and lower bounds In a Boolean algebra, the Cancellation Law is valid Each element of a Boolean algebra has exactly one complement Sometimes we write (B,,,,0 B,1 B ) for a Boolean algebra. Here B is a set and are the two binary operations meet (a b = inf(a,b)) and join (a b = sup(a,b)) on B denotes the mapping on B that maps each element a B onto its uniquely determined complement (which we denote by a ) 0 B and 1 B are the universal lower and upper bounds of B. December 19, (34)
27 Example The classical example of a Boolean algebra is the power set (P(M ),,,,,M). We have defined a Boolean algebra as a certain kind of poset. But we may also define a Boolean algebra as a purely algebraic structure: Theorem Let B be a set, furnished with two binary operations and such that (i) and are commutative (ii) and are associative (iii) and are distributive over one another (iv) B contains an identity element 1 B with respect to and an identity element 0 B with respect to (v) for each a B there is an a B such that a a = 0 B and a a = 1 B. Then the relation on B, defined by a b a b = a for all a,b B, is a partial ordering on B, and the poset (B, ) is a Boolean algebra. December 19, (34)
28 From elementary set theory we recall De Morgan s Laws: (A B) = A B and (A B) = A B. De Morgan s Laws are thus valid in the Boolean algebra (P(M ),,,,,M). We will now show that it can be generalized to any Boolean algebra. Theorem (De Morgan s Laws) Let a,b B, where B is a Boolean algebra. Then (a b) = a b and (a b) = a b. December 19, (34)
29 Proof. We will prove one of the two laws: (a b) = a b. In the left-hand side, we have the complement of a b. If we can show that a b also is a complement of a b, the proof will be finished, since each element of a Boolean algebra has a uniquely determined complement. To show that a b is a complement of a b, we have to show that (a b ) (a b) = 0 B and (a b ) (a b) = 1 B, by the definition of a complement. That (a b ) (a b) = 1 B follows from (a b ) (a b) = (a b a) (a b b) = (1 B b ) (a 1 B ) = 1 B 1 B = 1 B, and similar computations yields (a b ) (a b) = 0 B. December 19, (34)
30 Example 105 Let B = {1,3,5,7,15,21,35,105} be the set of all positive divisors of 105. Defining meet and 35 join as a b = gcd(a,b) and a b = lcm(a,b), respectively, B will be a bounded lattice (with 0 B = 1 and 1 B = 105). To the right we see a Hasse diagram for this lattice. Is B a Boolean algebra? {a,b,c} 1 {a,b} {a,c} To the left is shown a Hasse diagram for the Boolean algebra P(M ), where M = {a,b,c}. {b,c} Except for how the nodes of the diagram are labelled, the diagram looks exactly the same {a} {b} {c} as the Hasse diagram for B. This indicates that B actually is a Boolean algebra; in fact a Boolean algebra that is isomorphic to P(M ). December 19, (34)
31 Definition (Boolean Homomorphism, Boolean Isomorphism) Let B and C be Boolean algebras. A mapping φ: B C is called a Boolean homomorphism, if (i) φ(a b) = φ(a) φ(b) (ii) φ(a b) = φ(a) φ(b) (iii) φ(a ) = φ(a) If φ in addition is bijective, then φ is a Boolean isomorphism. The Boolean algebras B and C are then isomorphic; we write B C. Theorem Let φ : B C be a Boolean homomorphism. Then (i) If a,b B fulfills a b, then φ(a) φ(b) in C (ii) φ(0 B ) = 0 C and φ(1 B ) = 1 C. Unlike e.g. groups, there are not that many Boolean algebras, up to isomorphism. December 19, (34)
32 Theorem Let B be a finite Boolean algebra. Then B P(M ) for some finite set M. Sketch of proof. Let {x 1,x 2,...,x n } be a non-empty subset of M. Then we can write {x 1,x 2,...,x n } = {x 1 } {x 2 } {x n } = n {x i }. (3) For each i, there is no set A P(M ) such that A {x i }, i.e. the sets {x i } are so small as possible, without being equal to the universal lower bound of P(M ). The representation (3) is also unique, if you not consider the succession of the sets {x i }. One can show that each b B, where b 0 B, has a unique representation in the form n b = a 1 a 2 a n = a i, (4) where each a i B is as small as possible, without being equal to 0 B, i.e. for each i there is no c B such that 0 B c a i. We say that a i is a atom of B. December 19, (34) i=1 i=1
33 Let M be the set of all atoms in B. We define a mapping φ: B P(M ) in the following manner: Take any b B. If b = 0 B, we put φ(b) =. If b 0 B, we know that there is a uniquely determined set {a 1,a 2,...,a n } of atoms in B (i.e. a subset of M and thereby an element of P(M )) such that b = n i=1 a i. We put φ(b) = {a 1,a 2,...,a n }. One can now show that φ: B P(M ) is a Boolean isomorphism. Corollary Let B be a finite Boolean algebra. Then B = 2 n for some n N. Proof. We know that B P(M ) for some finite set M. Suppose M = n. When constructing an element of P(M ), i.e. a subset of M, we have 2 choices for each one of the n elements in M: either we include it in the subset we want to construct, or we do not. Due to this, there are 2 n possible subsets of M, whence B = P(M ) = 2 n. December 19, (34)
34 Example In a previous example we concluded that the bounded lattice (L,, ), where L = {1,2,3,4,6,12} consists of all positive divisors of 12, and where 12 a b = gcd(a,b), a b = lcm(a,b), is not complementary (2 and 6 have no complements). Therefore L cannot be a Boolean algebra. Alternatively, we can make the same conclusion 6 4 about L, by counting the number of elements in L; we 3 2 have in this case L = 6. If L is a Boolean algebra, then L must be a power of 2, which is not the case. 1 Exercise Let B be the set of all positive divisors of 252, and construct a bounded lattice of B in the same spirit as in the example above. Is B a Boolean algebra? If this is the case, find a set M for which B P(M ). December 19, (34)
Sets and Motivation for Boolean algebra
SET THEORY Basic concepts Notations Subset Algebra of sets The power set Ordered pairs and Cartesian product Relations on sets Types of relations and their properties Relational matrix and the graph of
More informationCommutative Algebra Lecture 3: Lattices and Categories (Sept. 13, 2013)
Commutative Algebra Lecture 3: Lattices and Categories (Sept. 13, 2013) Navid Alaei September 17, 2013 1 Lattice Basics There are, in general, two equivalent approaches to defining a lattice; one is rather
More informationLecture 4. Algebra, continued Section 2: Lattices and Boolean algebras
V. Borschev and B. Partee, September 21-26, 2006 p. 1 Lecture 4. Algebra, continued Section 2: Lattices and Boolean algebras CONTENTS 1. Lattices.... 1 1.0. Why lattices?... 1 1.1. Posets... 1 1.1.1. Upper
More information3 Boolean Algebra 3.1 BOOLEAN ALGEBRA
3 Boolean Algebra 3.1 BOOLEAN ALGEBRA In 1854, George Boole introduced the following formalism which eventually became Boolean Algebra. Definition. An algebraic system consisting of a set B of elements
More informationProperties of Boolean Algebras
Phillip James Swansea University December 15, 2008 Plan For Today Boolean Algebras and Order..... Brief Re-cap Order A Boolean algebra is a set A together with the distinguished elements 0 and 1, the binary
More informationGENERALIZED DIFFERENCE POSETS AND ORTHOALGEBRAS. 0. Introduction
Acta Math. Univ. Comenianae Vol. LXV, 2(1996), pp. 247 279 247 GENERALIZED DIFFERENCE POSETS AND ORTHOALGEBRAS J. HEDLÍKOVÁ and S. PULMANNOVÁ Abstract. A difference on a poset (P, ) is a partial binary
More information2 Elementary number theory
2 Elementary number theory 2.1 Introduction Elementary number theory is concerned with properties of the integers. Hence we shall be interested in the following sets: The set if integers {... 2, 1,0,1,2,3,...},
More informationRelations. Relations. Definition. Let A and B be sets.
Relations Relations. Definition. Let A and B be sets. A relation R from A to B is a subset R A B. If a A and b B, we write a R b if (a, b) R, and a /R b if (a, b) / R. A relation from A to A is called
More informationBoolean Algebras. Chapter 2
Chapter 2 Boolean Algebras Let X be an arbitrary set and let P(X) be the class of all subsets of X (the power set of X). Three natural set-theoretic operations on P(X) are the binary operations of union
More informationcse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska
cse547, math547 DISCRETE MATHEMATICS Professor Anita Wasilewska LECTURE 12 CHAPTER 4 NUMBER THEORY PART1: Divisibility PART 2: Primes PART 1: DIVISIBILITY Basic Definitions Definition Given m,n Z, we say
More informationChapter One. The Real Number System
Chapter One. The Real Number System We shall give a quick introduction to the real number system. It is imperative that we know how the set of real numbers behaves in the way that its completeness and
More information2MA105 Algebraic Structures I
2MA105 Algebraic Structures I Per-Anders Svensson http://homepage.lnu.se/staff/psvmsi/2ma105.html Lecture 7 Cosets once again Factor Groups Some Properties of Factor Groups Homomorphisms November 28, 2011
More informationNotation Index. gcd(a, b) (greatest common divisor) NT-16
Notation Index (for all) B A (all functions) B A = B A (all functions) SF-18 (n) k (falling factorial) SF-9 a R b (binary relation) C(n,k) = n! k! (n k)! (binomial coefficient) SF-9 n! (n factorial) SF-9
More informationDescribing the Real Numbers
Describing the Real Numbers Anthony Várilly Math 25a, Fall 2001 1 Introduction The goal of these notes is to uniquely describe the real numbers by taking certain statements as axioms. This exercise might
More information1 Invertible Elements, Pure Monoids
MONOIDS Notes by Walter Noll (1992) 1 Invertible Elements, Pure Monoids We assume that a monoid M, described with multiplicative notation and terminology and with unit u, is given. Proposition 1: For every
More information3. Abstract Boolean Algebras
3. ABSTRACT BOOLEAN ALGEBRAS 123 3. Abstract Boolean Algebras 3.1. Abstract Boolean Algebra. Definition 3.1.1. An abstract Boolean algebra is defined as a set B containing two distinct elements 0 and 1,
More informationThe Real Number System
MATH 337 The Real Number System Sets of Numbers Dr. Neal, WKU A set S is a well-defined collection of objects, with well-defined meaning that there is a specific description from which we can tell precisely
More informationPOL502: Foundations. Kosuke Imai Department of Politics, Princeton University. October 10, 2005
POL502: Foundations Kosuke Imai Department of Politics, Princeton University October 10, 2005 Our first task is to develop the foundations that are necessary for the materials covered in this course. 1
More information1. To be a grandfather. Objects of our consideration are people; a person a is associated with a person b if a is a grandfather of b.
20 [161016-1020 ] 3.3 Binary relations In mathematics, as in everyday situations, we often speak about a relationship between objects, which means an idea of two objects being related or associated one
More informationMATH 102 INTRODUCTION TO MATHEMATICAL ANALYSIS. 1. Some Fundamentals
MATH 02 INTRODUCTION TO MATHEMATICAL ANALYSIS Properties of Real Numbers Some Fundamentals The whole course will be based entirely on the study of sequence of numbers and functions defined on the real
More informationChapter 1. Sets and Numbers
Chapter 1. Sets and Numbers 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationClass Notes on Poset Theory Johan G. Belinfante Revised 1995 May 21
Class Notes on Poset Theory Johan G Belinfante Revised 1995 May 21 Introduction These notes were originally prepared in July 1972 as a handout for a class in modern algebra taught at the Carnegie-Mellon
More informationUnit I (Logic and Proofs)
SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : Part A questions : R2013 UPDATED ON : April-May 2018 (Scan the above QR code for the direct download of this material)
More informationDiscrete Structures Lecture Primes and Greatest Common Divisor
DEFINITION 1 EXAMPLE 1.1 EXAMPLE 1.2 An integer p greater than 1 is called prime if the only positive factors of p are 1 and p. A positive integer that is greater than 1 and is not prime is called composite.
More informationLogic Synthesis and Verification
Logic Synthesis and Verification Boolean Algebra Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 2014 1 2 Boolean Algebra Reading F. M. Brown. Boolean Reasoning:
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationSection Summary. Relations and Functions Properties of Relations. Combining Relations
Chapter 9 Chapter Summary Relations and Their Properties n-ary Relations and Their Applications (not currently included in overheads) Representing Relations Closures of Relations (not currently included
More informationDefinition: A binary relation R from a set A to a set B is a subset R A B. Example:
Chapter 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 B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B.
More informationTutorial Obtain the principal disjunctive normal form and principal conjunction form of the statement
Tutorial - 1 1. Obtain the principal disjunctive normal form and principal conjunction form of the statement Let S P P Q Q R P P Q Q R A: P Q Q R P Q R P Q Q R Q Q R A S Minterm Maxterm T T T F F T T T
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationStructure of R. Chapter Algebraic and Order Properties of R
Chapter Structure of R We will re-assemble calculus by first making assumptions about the real numbers. All subsequent results will be rigorously derived from these assumptions. Most of the assumptions
More informationBoolean Algebra CHAPTER 15
CHAPTER 15 Boolean Algebra 15.1 INTRODUCTION Both sets and propositions satisfy similar laws, which are listed in Tables 1-1 and 4-1 (in Chapters 1 and 4, respectively). These laws are used to define an
More informationCIS 375 Intro to Discrete Mathematics Exam 3 (Section M004: Blue) 6 December Points Possible
Name: CIS 375 Intro to Discrete Mathematics Exam 3 (Section M004: Blue) 6 December 2016 Question Points Possible Points Received 1 12 2 14 3 14 4 12 5 16 6 16 7 16 Total 100 Instructions: 1. This exam
More informationSuppose R is an ordered ring with positive elements P.
1. The real numbers. 1.1. Ordered rings. Definition 1.1. By an ordered commutative ring with unity we mean an ordered sextuple (R, +, 0,, 1, P ) such that (R, +, 0,, 1) is a commutative ring with unity
More informationLecture 2. Econ August 11
Lecture 2 Econ 2001 2015 August 11 Lecture 2 Outline 1 Fields 2 Vector Spaces 3 Real Numbers 4 Sup and Inf, Max and Min 5 Intermediate Value Theorem Announcements: - Friday s exam will be at 3pm, in WWPH
More informationINTRODUCTION TO THE GROUP THEORY
Lecture Notes on Structure of Algebra INTRODUCTION TO THE GROUP THEORY By : Drs. Antonius Cahya Prihandoko, M.App.Sc e-mail: antoniuscp.fkip@unej.ac.id Mathematics Education Study Program Faculty of Teacher
More informationEconomics 204 Summer/Fall 2011 Lecture 2 Tuesday July 26, 2011 N Now, on the main diagonal, change all the 0s to 1s and vice versa:
Economics 04 Summer/Fall 011 Lecture Tuesday July 6, 011 Section 1.4. Cardinality (cont.) Theorem 1 (Cantor) N, the set of all subsets of N, is not countable. Proof: Suppose N is countable. Then there
More informationAN INTRODUCTION TO BOOLEAN ALGEBRAS
California State University, San Bernardino CSUSB ScholarWorks Electronic Theses, Projects, and Dissertations Office of Graduate Studies 12-2016 AN INTRODUCTION TO BOOLEAN ALGEBRAS Amy Schardijn California
More informationCIS 375 Intro to Discrete Mathematics Exam 3 (Section M001: Green) 6 December Points Possible
Name: CIS 375 Intro to Discrete Mathematics Exam 3 (Section M001: Green) 6 December 2016 Question Points Possible Points Received 1 12 2 14 3 14 4 12 5 16 6 16 7 16 Total 100 Instructions: 1. This exam
More informationECARES Université Libre de Bruxelles MATH CAMP Basic Topology
ECARES Université Libre de Bruxelles MATH CAMP 03 Basic Topology Marjorie Gassner Contents: - Subsets, Cartesian products, de Morgan laws - Ordered sets, bounds, supremum, infimum - Functions, image, preimage,
More informationLecture 1: Lattice(I)
Discrete Mathematics (II) Spring 207 Lecture : Lattice(I) Lecturer: Yi Li Lattice is a special algebra structure. It is also a part of theoretic foundation of model theory, which formalizes the semantics
More informationOn the Truth Values of Fuzzy Statements
International Journal of Applied Computational Science and Mathematics. ISSN 2249-3042 Volume 3, Number 1 (2013), pp. 1-6 Research India Publications http://www.ripublication.com/ijacsm.htm On the Truth
More informationIs g one-to-one? Is g onto? Why? Solution: g is not one-to-one, since for c A, g(b) = g(c) = c. g is not onto, since a / g(a).
Discrete Structures: Exam 2 Solutions to Sample Questions, 1. Let A = B = {a, b, c}. Consider the relation g = {(a, b), (b, c), (c, c)}. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one,
More informationEcon Lecture 2. Outline
Econ 204 2010 Lecture 2 Outline 1. Cardinality (cont.) 2. Algebraic Structures: Fields and Vector Spaces 3. Axioms for R 4. Sup, Inf, and the Supremum Property 5. Intermediate Value Theorem 1 Cardinality
More informationChapter 1 The Real Numbers
Chapter 1 The Real Numbers In a beginning course in calculus, the emphasis is on introducing the techniques of the subject;i.e., differentiation and integration and their applications. An advanced calculus
More informationCHAPTEER - TWO SUBGROUPS. ( Z, + ) is subgroup of ( R, + ). 1) Find all subgroups of the group ( Z 8, + 8 ).
CHAPTEER - TWO SUBGROUPS Definition 2-1. Let (G, ) be a group and H G be a nonempty subset of G. The pair ( H, ) is said to be a SUBGROUP of (G, ) if ( H, ) is group. Example. ( Z, + ) is subgroup of (
More informationLecture Notes: Selected Topics in Discrete Structures. Ulf Nilsson
Lecture Notes: Selected Topics in Discrete Structures Ulf Nilsson Dept of Computer and Information Science Linköping University 581 83 Linköping, Sweden ulfni@ida.liu.se 2004-03-09 Contents Chapter 1.
More informationDiscrete Mathematics. 2. Relations
Discrete Mathematics 2. Relations Binary Relations Let A, B be any two sets. A binary relation R from A to B is a subset of A B. E.g., Let < : N N : {(n,m) n < m} The notation a R b or arb means (a,b)îr.
More information2.2 Some Consequences of the Completeness Axiom
60 CHAPTER 2. IMPORTANT PROPERTIES OF R 2.2 Some Consequences of the Completeness Axiom In this section, we use the fact that R is complete to establish some important results. First, we will prove that
More information1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty.
1. Supremum and Infimum Remark: In this sections, all the subsets of R are assumed to be nonempty. Let E be a subset of R. We say that E is bounded above if there exists a real number U such that x U for
More informationDiscrete Structures: Solutions to Sample Questions, Exam 2
Discrete Structures: Solutions to Sample Questions, Exam 2 1. Let A = B = {a, b, c}. Consider the relation g = {(a, b), (b, c), (c, c)}. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one,
More informationBOOLEAN ALGEBRA INTRODUCTION SUBSETS
BOOLEAN ALGEBRA M. Ragheb 1/294/2018 INTRODUCTION Modern algebra is centered around the concept of an algebraic system: A, consisting of a set of elements: ai, i=1, 2,, which are combined by a set of operations
More informationSets. We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth
Sets We discuss an informal (naive) set theory as needed in Computer Science. It was introduced by G. Cantor in the second half of the nineteenth century. Most students have seen sets before. This is intended
More informationTROPICAL SCHEME THEORY
TROPICAL SCHEME THEORY 5. Commutative algebra over idempotent semirings II Quotients of semirings When we work with rings, a quotient object is specified by an ideal. When dealing with semirings (and lattices),
More informationClosure operators on sets and algebraic lattices
Closure operators on sets and algebraic lattices Sergiu Rudeanu University of Bucharest Romania Closure operators are abundant in mathematics; here are a few examples. Given an algebraic structure, such
More information6.2 Deeper Properties of Continuous Functions
6.2. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 69 6.2 Deeper Properties of Continuous Functions 6.2. Intermediate Value Theorem and Consequences When one studies a function, one is usually interested in
More informationMA Discrete Mathematics
MA2265 - Discrete Mathematics UNIT I 1. Check the validity of the following argument. If the band could not play rock music or the refreshments were not delivered on time, then the New year s party would
More informationNumber Theory and Divisibility
Number Theory and Divisibility Recall the Natural Numbers: N = {1, 2, 3, 4, 5, 6, } Any Natural Number can be expressed as the product of two or more Natural Numbers: 2 x 12 = 24 3 x 8 = 24 6 x 4 = 24
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More information* 8 Groups, with Appendix containing Rings and Fields.
* 8 Groups, with Appendix containing Rings and Fields Binary Operations Definition We say that is a binary operation on a set S if, and only if, a, b, a b S Implicit in this definition is the idea that
More informationCHAPTER 1. Relations. 1. Relations and Their Properties. Discussion
CHAPTER 1 Relations 1. Relations and Their Properties 1.1. Definition of a Relation. Definition 1.1.1. A binary relation from a set A to a set B is a subset R A B. If (a, b) R we say a is Related to b
More informationExam 2. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one, since for c A, g(b) = g(c) = c. g is not onto, since a / g(a).
Discrete Structures: Exam 2 Solutions to Sample Questions, 1. Let A = B = {a, b, c}. Consider the relation g = {(a, b), (b, c), (c, c)}. Is g one-to-one? Is g onto? Why? Solution: g is not one-to-one,
More informationSimplification by Truth Table and without Truth Table
Engineering Mathematics 2013 SUBJECT NAME SUBJECT CODE MATERIAL NAME MATERIAL CODE REGULATION UPDATED ON : Discrete Mathematics : MA2265 : University Questions : SKMA1006 : R2008 : August 2013 Name of
More informationUniversal Algebra for Logics
Universal Algebra for Logics Joanna GRYGIEL University of Czestochowa Poland j.grygiel@ajd.czest.pl 2005 These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic
More informationCISC-102 Fall 2017 Week 6
Week 6 page 1! of! 15 CISC-102 Fall 2017 Week 6 We will see two different, yet similar, proofs that there are infinitely many prime numbers. One proof would surely suffice. However, seeing two different
More informationMaanavaN.Com MA1256 DISCRETE MATHEMATICS. DEPARTMENT OF MATHEMATICS QUESTION BANK Subject & Code : MA1256 DISCRETE MATHEMATICS
DEPARTMENT OF MATHEMATICS QUESTION BANK Subject & Code : UNIT I PROPOSITIONAL CALCULUS Part A ( Marks) Year / Sem : III / V. Write the negation of the following proposition. To enter into the country you
More informationReal Analysis. Joe Patten August 12, 2018
Real Analysis Joe Patten August 12, 2018 1 Relations and Functions 1.1 Relations A (binary) relation, R, from set A to set B is a subset of A B. Since R is a subset of A B, it is a set of ordered pairs.
More information0 Sets and Induction. Sets
0 Sets and Induction Sets A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a A to denote that a is an element of the set
More informationHow to use algebraic structures
How to use algebraic structures Branimir Šešelja Department of Mathematics and Informatics, Faculty of Sciences University of Novi Sad Trg D. Obradovića 4, Novi Sad, Serbia seselja@dmi.uns.ac.rs http://www.dmi.uns.ac.rs/faculty/seseljab
More informationChapter 1. Sets and Mappings
Chapter 1. Sets and Mappings 1. Sets A set is considered to be a collection of objects (elements). If A is a set and x is an element of the set A, we say x is a member of A or x belongs to A, and we write
More informationEquational Logic. Chapter Syntax Terms and Term Algebras
Chapter 2 Equational Logic 2.1 Syntax 2.1.1 Terms and Term Algebras The natural logic of algebra is equational logic, whose propositions are universally quantified identities between terms built up from
More informationCompleteness of Star-Continuity
Introduction to Kleene Algebra Lecture 5 CS786 Spring 2004 February 9, 2004 Completeness of Star-Continuity We argued in the previous lecture that the equational theory of each of the following classes
More informationChapter 1 : The language of mathematics.
MAT 200, Logic, Language and Proof, Fall 2015 Summary Chapter 1 : The language of mathematics. Definition. A proposition is a sentence which is either true or false. Truth table for the connective or :
More informationProblem 2: (Section 2.1 Exercise 10) (a.) How many elements are in the power set of the power set of the empty set?
Assignment 4 Solutions Problem1: (Section 2.1 Exercise 9) (a.) List all the subsets of the set {a, b, c, d} which contain: (i.) four elements (ii.) three elements (iii.) two elements (iv.) one element
More informationMathematical Reasoning & Proofs
Mathematical Reasoning & Proofs MAT 1362 Fall 2018 Alistair Savage Department of Mathematics and Statistics University of Ottawa This work is licensed under a Creative Commons Attribution-ShareAlike 4.0
More informationIntroduction to Number Theory
Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic principles of divisibility, greatest common divisors, least common multiples, and modular
More informationStone Duality. An application in the theory of formal languages. A Master thesis by Mirte Dekkers Under supervision of Prof. dr.
Stone Duality An application in the theory of formal languages A Master thesis by Mirte Dekkers Under supervision of Prof. dr. Mai Gehrke Stone duality An application in the theory of formal languages
More informationLecture Notes 1 Basic Concepts of Mathematics MATH 352
Lecture Notes 1 Basic Concepts of Mathematics MATH 352 Ivan Avramidi New Mexico Institute of Mining and Technology Socorro, NM 87801 June 3, 2004 Author: Ivan Avramidi; File: absmath.tex; Date: June 11,
More informationPart IA Numbers and Sets
Part IA Numbers and Sets Definitions Based on lectures by A. G. Thomason Notes taken by Dexter Chua Michaelmas 2014 These notes are not endorsed by the lecturers, and I have modified them (often significantly)
More informationLattices and Orders in Isabelle/HOL
Lattices and Orders in Isabelle/HOL Markus Wenzel TU München October 8, 2017 Abstract We consider abstract structures of orders and lattices. Many fundamental concepts of lattice theory are developed,
More informationEquivalence relations
Equivalence relations R A A is an equivalence relation if R is 1. reflexive (a, a) R 2. symmetric, and (a, b) R (b, a) R 3. transitive. (a, b), (b, c) R (a, c) R Example: Let S be a relation on people
More informationSimplification by Truth Table and without Truth Table
SUBJECT NAME SUBJECT CODE : MA 6566 MATERIAL NAME REGULATION : Discrete Mathematics : University Questions : R2013 UPDATED ON : June 2017 (Scan the above Q.R code for the direct download of this material)
More information5 Group theory. 5.1 Binary operations
5 Group theory This section is an introduction to abstract algebra. This is a very useful and important subject for those of you who will continue to study pure mathematics. 5.1 Binary operations 5.1.1
More information1. Foundations of Numerics from Advanced Mathematics. Mathematical Essentials and Notation
1. Foundations of Numerics from Advanced Mathematics Mathematical Essentials and Notation Mathematical Essentials and Notation, October 22, 2012 1 The main purpose of this first chapter (about 4 lectures)
More information5.5 Deeper Properties of Continuous Functions
5.5. DEEPER PROPERTIES OF CONTINUOUS FUNCTIONS 195 5.5 Deeper Properties of Continuous Functions 5.5.1 Intermediate Value Theorem and Consequences When one studies a function, one is usually interested
More informationCONSTRUCTION OF THE REAL NUMBERS.
CONSTRUCTION OF THE REAL NUMBERS. IAN KIMING 1. Motivation. It will not come as a big surprise to anyone when I say that we need the real numbers in mathematics. More to the point, we need to be able to
More informationDiscrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009
Discrete Mathematics: Lectures 6 and 7 Sets, Relations, Functions and Counting Instructor: Arijit Bishnu Date: August 4 and 6, 2009 Our main goal is here is to do counting using functions. For that, we
More informationChapter 5: The Integers
c Dr Oksana Shatalov, Fall 2014 1 Chapter 5: The Integers 5.1: Axioms and Basic Properties Operations on the set of integers, Z: addition and multiplication with the following properties: A1. Addition
More informationGoal. Partially-ordered set. Game plan 2/2/2013. Solving fixpoint equations
Goal Solving fixpoint equations Many problems in programming languages can be formulated as the solution of a set of mutually recursive equations: D: set, f,g:dxd D x = f(x,y) y = g(x,y) Examples Parsing:
More informationDiskrete Mathematik Solution 6
ETH Zürich, D-INFK HS 2018, 30. October 2018 Prof. Ueli Maurer Marta Mularczyk Diskrete Mathematik Solution 6 6.1 Partial Order Relations a) i) 11 and 12 are incomparable, since 11 12 and 12 11. ii) 4
More informationSet Theory Basics of Set Theory. 6.2 Properties of Sets and Element Argument. 6.3 Algebraic Proofs 6.4 Boolean Algebras.
9/6/17 Mustafa Jarrar: Lecture Notes in Discrete Mathematics. Birzeit University Palestine 2015 Set Theory 6.1. Basics of Set Theory 6.2 Properties of Sets and Element Argument 6.3 Algebraic Proofs 6.4
More informationNotes on Systems of Linear Congruences
MATH 324 Summer 2012 Elementary Number Theory Notes on Systems of Linear Congruences In this note we will discuss systems of linear congruences where the moduli are all different. Definition. Given the
More informationRings and Fields Theorems
Rings and Fields Theorems Rajesh Kumar PMATH 334 Intro to Rings and Fields Fall 2009 October 25, 2009 12 Rings and Fields 12.1 Definition Groups and Abelian Groups Let R be a non-empty set. Let + and (multiplication)
More informationNumber Theory and Graph Theory. Prime numbers and congruences.
1 Number Theory and Graph Theory Chapter 2 Prime numbers and congruences. By A. Satyanarayana Reddy Department of Mathematics Shiv Nadar University Uttar Pradesh, India E-mail: satya8118@gmail.com 2 Module-1:Primes
More informationSets. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing Spring, Outline Sets An Algebra on Sets Summary
An Algebra on Alice E. Fischer CSCI 1166 Discrete Mathematics for Computing Spring, 2018 Alice E. Fischer... 1/37 An Algebra on 1 Definitions and Notation Venn Diagrams 2 An Algebra on 3 Alice E. Fischer...
More information(a) We need to prove that is reflexive, symmetric and transitive. 2b + a = 3a + 3b (2a + b) = 3a + 3b 3k = 3(a + b k)
MATH 111 Optional Exam 3 lutions 1. (0 pts) We define a relation on Z as follows: a b if a + b is divisible by 3. (a) (1 pts) Prove that is an equivalence relation. (b) (8 pts) Determine all equivalence
More informationLecture Notes in Real Analysis Anant R. Shastri Department of Mathematics Indian Institute of Technology Bombay
Lecture Notes in Real Analysis 2010 Anant R. Shastri Department of Mathematics Indian Institute of Technology Bombay August 6, 2010 Lectures 1-3 (I-week) Lecture 1 Why real numbers? Example 1 Gaps in the
More informationAnalysis I. Classroom Notes. H.-D. Alber
Analysis I Classroom Notes H-D Alber Contents 1 Fundamental notions 1 11 Sets 1 12 Product sets, relations 5 13 Composition of statements 7 14 Quantifiers, negation of statements 9 2 Real numbers 11 21
More informationDiscrete Mathematics. CS204: Spring, Jong C. Park Computer Science Department KAIST
Discrete Mathematics CS204: Spring, 2008 Jong C. Park Computer Science Department KAIST Today s Topics Combinatorial Circuits Properties of Combinatorial Circuits Boolean Algebras Boolean Functions and
More informationMATH 117 LECTURE NOTES
MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set
More information