Countable and uncountable sets. Matrices.

Similar documents
Countable and uncountable sets. Matrices.

Section Summary. Sequences. Recurrence Relations. Summations. Examples: Geometric Progression, Arithmetic Progression. Example: Fibonacci Sequence

Sets are one of the basic building blocks for the types of objects considered in discrete mathematics.

Section Summary. Sequences. Recurrence Relations. Summations Special Integer Sequences (optional)

CS100: DISCRETE STRUCTURES. Lecture 3 Matrices Ch 3 Pages:

Section Summary. Definition of a Function.

Discrete Structures for Computer Science

Section 7.5: Cardinality

Announcements. CS243: Discrete Structures. Sequences, Summations, and Cardinality of Infinite Sets. More on Midterm. Midterm.

Chapter 2 - Basics Structures MATH 213. Chapter 2: Basic Structures. Dr. Eric Bancroft. Fall Dr. Eric Bancroft MATH 213 Fall / 60

Section 9.2: Matrices.. a m1 a m2 a mn

Chapter 2 - Basics Structures

Mathematics 13: Lecture 10

A Short Review of Cardinality

Sequences are ordered lists of elements

Matrix Arithmetic. j=1

Math 3361-Modern Algebra Lecture 08 9/26/ Cardinality

Discrete Mathematics for CS Spring 2007 Luca Trevisan Lecture 27

Section 9.2: Matrices. Definition: A matrix A consists of a rectangular array of numbers, or elements, arranged in m rows and n columns.

Chapter 1: Systems of linear equations and matrices. Section 1.1: Introduction to systems of linear equations

CSE 311: Foundations of Computing. Lecture 26: Cardinality

CSE 20 DISCRETE MATH. Fall

Functions. Definition 1 Let A and B be sets. A relation between A and B is any subset of A B.

Math.3336: Discrete Mathematics. Cardinality of Sets

ICS 6N Computational Linear Algebra Matrix Algebra

Harvard CS 121 and CSCI E-207 Lecture 6: Regular Languages and Countability

10. Linear Systems of ODEs, Matrix multiplication, superposition principle (parts of sections )

Matrix Algebra Determinant, Inverse matrix. Matrices. A. Fabretti. Mathematics 2 A.Y. 2015/2016. A. Fabretti Matrices

Algorithms: Lecture 2

MATH FINAL EXAM REVIEW HINTS

Finite Mathematics Chapter 2. where a, b, c, d, h, and k are real numbers and neither a and b nor c and d are both zero.

Lecture 3 Linear Algebra Background

MATH31011/MATH41011/MATH61011: FOURIER ANALYSIS AND LEBESGUE INTEGRATION. Chapter 2: Countability and Cantor Sets

Math 105A HW 1 Solutions

Matrix Arithmetic. a 11 a. A + B = + a m1 a mn. + b. a 11 + b 11 a 1n + b 1n = a m1. b m1 b mn. and scalar multiplication for matrices via.

Example. We can represent the information on July sales more simply as

CLASS 12 ALGEBRA OF MATRICES

Mathematics Course 111: Algebra I Part I: Algebraic Structures, Sets and Permutations

A Universal Turing Machine

Definition: Let S and T be sets. A binary relation on SxT is any subset of SxT. A binary relation on S is any subset of SxS.

Introduction to Decision Sciences Lecture 6

A FIRST COURSE IN LINEAR ALGEBRA. An Open Text by Ken Kuttler. Matrix Arithmetic

Lecture Notes in Linear Algebra

CITS2211 Discrete Structures (2017) Cardinality and Countability

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

Matrix representation of a linear map

Introduction. Vectors and Matrices. Vectors [1] Vectors [2]

MATRICES. a m,1 a m,n A =

Discrete Structures - CM0246 Cardinality

Prepared by: M. S. KumarSwamy, TGT(Maths) Page

Chapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in

Discrete Mathematics 2007: Lecture 5 Infinite sets

Kevin James. MTHSC 3110 Section 2.1 Matrix Operations

ELEMENTARY LINEAR ALGEBRA

Matrices BUSINESS MATHEMATICS

Mathematics 220 Workshop Cardinality. Some harder problems on cardinality.

Final Exam Review. 2. Let A = {, { }}. What is the cardinality of A? Is

A matrix over a field F is a rectangular array of elements from F. The symbol

One-to-one functions and onto functions

Linear Algebra V = T = ( 4 3 ).

Phys 201. Matrices and Determinants

Algebra & Trig. I. For example, the system. x y 2 z. may be represented by the augmented matrix

Matrices. Math 240 Calculus III. Wednesday, July 10, Summer 2013, Session II. Matrices. Math 240. Definitions and Notation.

LECTURE 22: COUNTABLE AND UNCOUNTABLE SETS

Stage-structured Populations

CS 441 Discrete Mathematics for CS Lecture 19. Probabilities. CS 441 Discrete mathematics for CS. Probabilities

1.4 Cardinality. Tom Lewis. Fall Term Tom Lewis () 1.4 Cardinality Fall Term / 9

Announcements Monday, October 02

Announcements Wednesday, October 10

Evaluating Determinants by Row Reduction

Matrix operations Linear Algebra with Computer Science Application

CSE 311: Foundations of Computing. Lecture 26: Cardinality, Uncomputability

NOTE: You have 2 hours, please plan your time. Problems are not ordered by difficulty.

Linear Algebra March 16, 2019

1 Partitions and Equivalence Relations

DS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.

16.1 Countability. CS125 Lecture 16 Fall 2014

MATHEMATICS. IMPORTANT FORMULAE AND CONCEPTS for. Final Revision CLASS XII CHAPTER WISE CONCEPTS, FORMULAS FOR QUICK REVISION.

MATH 3300 Test 1. Name: Student Id:

Matrix Algebra 2.1 MATRIX OPERATIONS Pearson Education, Inc.

Definition. A matrix is a rectangular array of numbers enclosed by brackets (plural: matrices).

Economics 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:

MATH Mathematics for Agriculture II

Linear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8.

Undecidability. We are not so much concerned if you are slow as when you come to a halt. (Chinese Proverb)

ELEMENTARY LINEAR ALGEBRA

Elementary Row Operations on Matrices

8-15. Stop by or call (630)

Intro to Theory of Computation

Economics 204 Summer/Fall 2017 Lecture 1 Monday July 17, 2017

Linear Algebra. The analysis of many models in the social sciences reduces to the study of systems of equations.

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2

ICS141: Discrete Mathematics for Computer Science I

6.1 Matrices. Definition: A Matrix A is a rectangular array of the form. A 11 A 12 A 1n A 21. A 2n. A m1 A m2 A mn A 22.

Lecture 3: Matrix and Matrix Operations

Matrices and Vectors

Fundamentals of Engineering Analysis (650163)

2.1 Sets. Definition 1 A set is an unordered collection of objects. Important sets: N, Z, Z +, Q, R.

ICS141: Discrete Mathematics for Computer Science I

MATH Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product.

Transcription:

CS 441 Discrete Mathematics for CS Lecture 11 Countable and uncountable sets. Matrices. Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Arithmetic series Definition: The sum of the terms of the arithmetic progression a, a+d,a+2d,, a+nd is called an arithmetic series. Theorem: The sum of the terms of the arithmetic progression a, a+d,a+2d,, a+nd is n S ( a jd) na d j 1 j 1 n n( n 1) j na d 2 1

Geometric series Definition: The sum of the terms of a geometric progression a, ar, ar 2,..., ar k is called a geometric series. Theorem: The sum of the terms of a geometric progression a, ar, ar 2,..., ar n is n n n 1 j j r 1 S ( ar ) a r a j 0 j 0 r 1 Infinite geometric series Infinite geometric series can be computed in the closed form for x<1 How? k k 1 n n x 1 1 1 x lim k x lim k x 1 x 1 1 x n 0 n 0 Thus: n 1 x 1 n 0 x 2

Cardinality Recall: The cardinality of a finite set is defined by the number of elements in the set. Definition: The sets A and B have the same cardinality if there is a one-to-one correspondence between elements in A and B. In other words if there is a bijection from A to B. Recall bijection is one-to-one and onto. Assume A = {a,b,c} and B = {α,β,γ} and function f defined as: a α b β c γ F defines a bijection. Therefore A and B have the same cardinality, i.e. A = B = 3. Cardinality Definition: A set that is either finite or has the same cardinality as the set of positive integers Z + is called countable. A set that is not countable is called uncountable. Why these are called countable? The elements of the set can be enumerated and listed. 3

Countable sets Assume A = {0, 2, 4, 6,... } set of even numbers. Is it countable? Countable sets Assume A = {0, 2, 4, 6,... } set of even numbers. Is it countable? Using the definition: Is there a bijective function f: Z + A Z+ = {1, 2, 3, 4, } 4

Countable sets Assume A = {0, 2, 4, 6,... } set of even numbers. Is it countable? Using the definition: Is there a bijective function f: Z + A Z+ = {1, 2, 3, 4, } Define a function f: x 2x - 2 (an arithmetic progression) 1 2(1)-2 = 0 2 2(2)-2 = 2 3 2(3)-2 = 4... Countable sets Assume A = {0, 2, 4, 6,... } set of even numbers. Is it countable? Using the definition: Is there a bijective function f: Z + A Z+ = {1, 2, 3, 4, } Define a function f: x 2x - 2 (an arithmetic progression) 1 2(1)-2 = 0 2 2(2)-2 = 2 3 2(3)-2 = 4... one-to-one (why?) 5

Countable sets Assume A = {0, 2, 4, 6,... } set of even numbers. Is it countable? Using the definition: Is there a bijective function f: Z + A Z+ = {1, 2, 3, 4, } Define a function f: x 2x - 2 (an arithmetic progression) 1 2(1)-2 = 0 2 2(2)-2 = 2 3 2(3)-2 = 4... one-to-one (why?) 2x-2 = 2y-2 => 2x = 2y =>x = y. onto (why?) a A, (a+2) / 2 is the pre-image in Z +. Therefore A = Z +. Countable sets Theorem: The set of integers Z is countable. Solution: Can list a sequence: 0, 1, 1, 2, 2, 3, 3,.. Or can define a bijection from Z + to Z: When n is even: f(n) = n/2 When n is odd: f(n) = (n 1)/2 6

Countable sets Definition: A rational number can be expressed as the ratio of two integers p and q such that q 0. ¾ is a rational number 2is not a rational number. Theorem: The positive rational numbers are countable. Solution: The positive rational numbers are countable since they can be arranged in a sequence: r 1, r 2, r 3, Countable sets Theorem: The positive rational numbers are countable. First row q = 1. Second row q = 2. etc. Constructing the List First list p/q with p + q = 2. Next list p/q with p + q = 3 And so on. 7

Cardinality Theorem: The set of real numbers (R) is an uncountable set. Proof by a contradiction. 1) Assume that the real numbers are countable. 2) Then every subset of the reals is countable, in particular, the interval from 0 to 1 is countable. This implies the elements of this set can be listed say r1, r2, r3,... where r1 = 0.d 11 d 12 d 13 d 14... r2 = 0.d 21 d 22 d 23 d 24... r3 = 0.d 31 d 32 d 33 d 34... where the d ij {0,1,2,3,4,5,6,7,8,9}. Real numbers are uncountable Proof cont. 3) Want to show that not all reals in the interval between 0 and 1 are in this list. Form a new number called r = 0.d 1 d 2 d 3 d 4... where d i = 2, if d ii 2 3 if d ii = 2 suppose r1 = 0.75243... d1 = 2 r2 = 0.524310... d2 = 3 r3 = 0.131257... d3 = 2 r4 = 0.9363633... d4 = 2...... rt = 0.23222222... dt = 3 8

Real numbers are uncountable r = 0.d 1 d 2 d 3 d 4... where 2, if d ii 2 d i = 3 if d ii = 2 Claim: r is different than each member in the list. Is each expansion unique? Yes, if we exclude an infinite string of 9s..02850 =.02849 Therefore r and r i differ in the i-th decimal place for all i. Matrices 9

Matrices Definitions: A matrix is a rectangular array of numbers. A matrix with m rows and n columns is called an m x n matrix. Note: The plural of matrix is matrices. Matrices Definitions: A matrix is a rectangular array of numbers. A matrix with m rows and n columns is called an m x n matrix. Note: The plural of matrix is matrices. Definitions: A matrix with the same number of rows as columns is called a square matrix. Two matrices are equal if they have the same number of rows and the same number of columns and the corresponding entries in every position are equal. 10

Matrices Let m and n be positive integers and let The ith row of A is the 1 x n matrix [a i1, a i2,,a in ]. The jth column of A is the m x 1matrix: The (i,j)th element or entry of A is the element a ij. We can use A = [a ij ] to denote the matrix with its (i,j)th element equal to a ij. Matrix addition Defintion: Let A a ij and B b ij be m x n matrices. The sum of A and B, denoted by A + B, is the m x n matrix that has a ij b ij as its i,j th element. In other words, A + B = [a ij b ij. Note: matrices of different sizes can not be added. 11

Matrix multiplication Definition: Let A be an m x k matrix and B be a k x n matrix. The product of A and B, denoted by AB, is the m x n matrix that has its i,j th element equal to the sum of the products of the corresponding elments from the ith row of A and the jth column of B. In other words, if AB = [c ij then c ij a i1 b 1j a i2 b 2j a jk b kj. The product is not defined when the number of columns in the first matrix is not equal to the number of rows in the second matrix Matrix multiplication The Product of A = [a ij and B = [b ij 12

Matrix multiplication 2 4 3 1 1 2 2 4 6 * 1 4 2 1 2 2 1 5 3 =????????? Matrix multiplication Properties of matrix multiplication: Does AB = BA? AB BA 13

Matrix multiplication Properties of matrix multiplication: Does AB = BA? AB:? Matrix multiplication Properties of matrix multiplication: Does AB = BA? AB: 3 14

Matrix multiplication Properties of matrix multiplication: Does AB = BA? AB: BA:? 3 Matrix multiplication Properties of matrix multiplication: Does AB = BA? AB: BA: 3 Conclusion: AB BA 15

Matrices Definition: The identity matrix (of order n) is the n x n matrix I n = [ ij ], where ij 1 if i j and ij 0 if i j. Properties: Assume A is an m x n matrix. Then: AI n A and I m A A Assume A is an n x n matrix. Then: A 0 I n Matrices Definition: Powers of square matrices When A is an n n matrix, we have: A 0 I n A r AAA A r 16

Matrix transpose Definition: Let A = [a ij ] be an m x n matrix. The transpose of A, denoted by A T,is the n x m matrix obtained by interchanging the rows and columns of A. If A T =[b ij ], then b ij a ji for i 1,2,,n and j 1,2,...,m. Matrix inverse Definition: Let A = [a ij ] be an n x n matrix. The inverse of A, denoted by A -1, is the n x m matrix such that A A -1 = A -1 A = I Note: the inverse of the matrix A may not exist. 17