February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1 Addition of Integers Example: Add a = (1110) 2 and b = (1011) 2. a 0 + b.

Slides:



Advertisements
Similar presentations
Discrete Mathematics University of Jazeera College of Information Technology & Design Khulood Ghazal Mathematical Reasoning Methods of Proof.
Advertisements

Rules of Inferences Section 1.5. Definitions Argument: is a sequence of propositions (premises) that end with a proposition called conclusion. Valid Argument:
1 Section 1.5 Rules of Inference. 2 Definitions Theorem: a statement that can be shown to be true Proof: demonstration of truth of theorem –consists of.
CSNB143 – Discrete Structure
Chapter Matrices Matrix Arithmetic
Applied Informatics Štefan BEREŽNÝ
Chapter 4 Systems of Linear Equations; Matrices
Chapter 4 Systems of Linear Equations; Matrices
Chapter 3. Mathematical Reasoning 3.1 Methods of proof A theorem is a statement that can be shown to be true. A proof is to demonstrate that a theorem.
Matrix Definition: An array of numbers in m rows and n colums is called an mxn matrix A square matrix of order n, is an (nxn) matrix.
Mathematics. Matrices and Determinants-1 Session.
Ch 7.2: Review of Matrices For theoretical and computation reasons, we review results of matrix theory in this section and the next. A matrix A is an m.
Fall 2002CMSC Discrete Structures1 Let’s proceed to… Mathematical Reasoning.
MATRICES. Matrices A matrix is a rectangular array of objects (usually numbers) arranged in m horizontal rows and n vertical columns. A matrix with m.
Division in the Integers Theorem 1. If n and m are integers and n>0, then m=qn+r for unique integers q and r with 0
CSE 504 Discrete Mathematics & Foundations of Computer Science
February 25, 2002Applied Discrete Mathematics Week 5: Mathematical Reasoning 1 Addition of Integers How do we (humans) add two integers? Example: 7583.
Chapter 3: The Fundamentals: Algorithms, the Integers, and Matrices
Introduction to Proofs
MATH 224 – Discrete Mathematics
10/17/2015 Prepared by Dr.Saad Alabbad1 CS100 : Discrete Structures Proof Techniques(1) Dr.Saad Alabbad Department of Computer Science
1 C ollege A lgebra Systems and Matrices (Chapter5) 1.
Lecture 7 Matrices CSCI – 1900 Mathematics for Computer Science Fall 2014 Bill Pine.
13.1 Matrices and Their Sums
Chapter 4 – Matrix CSNB 143 Discrete Mathematical Structures.
1 Sections 1.5 & 3.1 Methods of Proof / Proof Strategy.
Discrete Structures (DS)
Meeting 18 Matrix Operations. Matrix If A is an m x n matrix - that is, a matrix with m rows and n columns – then the scalar entry in the i th row and.
CSCI 171 Presentation 9 Matrix Theory. Matrix – Rectangular array –i th row, j th column, i,j element –Square matrix, diagonal –Diagonal matrix –Equality.
2 2.1 © 2012 Pearson Education, Inc. Matrix Algebra MATRIX OPERATIONS.
Matrices Section 2.6. Section Summary Definition of a Matrix Matrix Arithmetic Transposes and Powers of Arithmetic Zero-One matrices.
Chapter 2 … part1 Matrices Linear Algebra S 1. Ch2_2 2.1 Addition, Scalar Multiplication, and Multiplication of Matrices Definition A matrix is a rectangular.
CSNB143 – Discrete Structure Topic 3 – Matrices. Learning Outcomes Students should understand all matrices operations. Students should be able to differentiate.
CompSci 102 Discrete Math for Computer Science February 7, 2012 Prof. Rodger Slides modified from Rosen.
Greatest Common Divisors & Least Common Multiples  Definition 4 Let a and b be integers, not both zero. The largest integer d such that d|a and d|b is.
Module #1 - Logic Based on Rosen, Discrete Mathematics & Its Applications. Prepared by (c) , Michael P. Frank. Modified By Mingwu Chen 1 Module.
Fall 2008/2009 I. Arwa Linjawi & I. Asma’a Ashenkity 11 The Foundations: Logic and Proofs Rules of inference.
Matrices and Determinants
CSci 2011 Discrete Mathematics Lecture 4 CSci 2011.
Foundations of Discrete Mathematics Chapter 1 By Dr. Dalia M. Gil, Ph.D.
Discrete Mathematical Structures: Theory and Applications 1 Logic: Learning Objectives  Learn about statements (propositions)  Learn how to use logical.
Section 2.4. Section Summary  Sequences. o Examples: Geometric Progression, Arithmetic Progression  Recurrence Relations o Example: Fibonacci Sequence.
Matrix Algebra Definitions Operations Matrix algebra is a means of making calculations upon arrays of numbers (or data). Most data sets are matrix-type.
CS 285- Discrete Mathematics Lecture 11. Section 3.8 Matrices Introduction Matrix Arithmetic Transposes and Power of Matrices Zero – One Matrices Boolean.
A very brief introduction to Matrix (Section 2.7) Definitions Some properties Basic matrix operations Zero-One (Boolean) matrices.
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.
2.1 Matrix Operations 2. Matrix Algebra. j -th column i -th row Diagonal entries Diagonal matrix : a square matrix whose nondiagonal entries are zero.
Matrices. Matrix A matrix is an ordered rectangular array of numbers. The entry in the i th row and j th column is denoted by a ij. Ex. 4 Columns 3 Rows.
Chapter 1 Logic and proofs
CSE15 Discrete Mathematics 03/01/17
The Euclidean Algorithm
CSE 504 Discrete Mathematics & Foundations of Computer Science
Discrete Structures – CNS2300
Applied Discrete Mathematics Week 5: Mathematical Reasoning
1.5 Matricies.
CSE15 Discrete Mathematics 01/30/17
Discrete Mathematics Logic.
Proof Techniques.
Applied Discrete Mathematics Week 4: Number Theory
Module #10: Proof Strategies
2. Matrix Algebra 2.1 Matrix Operations.
Mathematical Reasoning
Applied Discrete Mathematics Week 1: Logic
CS100: Discrete structures
Discrete Mathematics Logic.
Module #10: Proof Strategies
Foundations of Discrete Mathematics
Mathematical Reasoning
Applied Discrete Mathematics Week 4: Functions
Rules of inference Section 1.5 Monday, December 02, 2019
Presentation transcript:

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 1 Addition of Integers Example: Add a = (1110) 2 and b = (1011) 2. a 0 + b 0 = = 0  2 + 1, so that c 0 = 0 and s 0 = 1. a 1 + b 1 + c 0 = = 1  2 + 0, so c 1 = 1 and s 1 = 0. a 2 + b 2 + c 1 = = 1  2 + 0, so c 2 = 1 and s 2 = 0. a 3 + b 3 + c 2 = = 1  2 + 1, so c 3 = 1 and s 3 = 1. s 4 = c 3 = 1. Therefore, s = a + b = (11001) 2.

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 2 Addition of Integers procedure add(a, b: positive integers) c := 0 for j := 0 to n-1 {larger integer (a or b) has n digits} begin d :=  (a j + b j + c)/2  s j := a j + b j + c – 2d c := d end s n := c {the binary expansion of the sum is (s n s n-1 …s 1 s 0 ) 2 }

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 3Matrices A matrix is a rectangular array of numbers. A matrix with m rows and n columns is called an m  n matrix. Example: is a 3  2 matrix. A matrix with the same number of rows and columns is called square. Two matrices are equal if they have the same number of rows and columns and the corresponding entries in every position are equal.

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 4Matrices A general description of an m  n matrix A = [a ij ]: i-th row of A j-th column of A

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 5 Matrix Addition Let A = [a ij ] and B = [b ij ] be m  n matrices. The sum of A and B, denoted by A+B, is the m  n matrix that has a ij + b ij as its (i, j)th element. In other words, A+B = [a ij + b ij ]. Example:

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 6 Matrix Multiplication Let A be an m  k matrix and B be a k  n matrix. The product of A and B, denoted by AB, is the m  n matrix with (i, j)th entry equal to the sum of the products of the corresponding elements from the i-th row of A and the j-th column of B. In other words, if AB = [c ij ], then

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 7 Matrix Multiplication A more intuitive description of calculating C = AB: - Take the first column of B - Turn it counterclockwise by 90  and superimpose it on the first row of A - Multiply corresponding entries in A and B and add the products: 3    3 = 9 - Enter the result in the upper-left corner of C

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 8 Matrix Multiplication - Now superimpose the first column of B on the second, third, …, m-th row of A to obtain the entries in the first column of C (same order). - Then repeat this procedure with the second, third, …, n-th column of B, to obtain to obtain the remaining columns in C (same order). - After completing this algorithm, the new matrix C contains the product AB.

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 9 Matrix Multiplication Let us calculate the complete matrix C:

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 10 Identity Matrices The identity matrix of order n is the n  n matrix I n = [  ij ], where  ij = 1 if i = j and  ij = 0 if i  j: Multiplying an m  n matrix A by an identity matrix of appropriate size does not change this matrix: AI n = I m A = A

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 11 Powers and Transposes of Matrices The power function can be defined for square matrices. If A is an n  n matrix, we have: A 0 = I n, A r = AAA…A (r times the letter A) The transpose of an m  n matrix A = [a ij ], denoted by A t, is the n  m matrix obtained by interchanging the rows and columns of A. In other words, if A t = [b ij ], then b ij = a ji for i = 1, 2, …, n and j = 1, 2, …, m.

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 12 Powers and Transposes of Matrices Example: A square matrix A is called symmetric if A = A t. Thus A = [a ij ] is symmetric if a ij = a ji for all i = 1, 2, …, n and j = 1, 2, …, n. A is symmetric, B is not.

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 13 Zero-One Matrices A matrix with entries that are either 0 or 1 is called a zero-one matrix. Zero-one matrices are often used like a “table” to represent discrete structures. We can define Boolean operations on the entries in zero-one matrices: ab abababab ab abababab

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 14 Zero-One Matrices Let A = [a ij ] and B = [b ij ] be m  n zero-one matrices. Then the join of A and B is the zero-one matrix with (i, j)th entry a ij  b ij. The join of A and B is denoted by A  B. The meet of A and B is the zero-one matrix with (i, j)th entry a ij  b ij. The meet of A and B is denoted by A  B.

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 15 Zero-One Matrices Example: Join: Meet:

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 16 Zero-One Matrices Let A = [a ij ] be an m  k zero-one matrix and B = [b ij ] be a k  n zero-one matrix. Then the Boolean product of A and B, denoted by A  B, is the m  n matrix with (i, j)th entry [c ij ], where c ij = (a i1  b 1j )  (a i2  b 2i )  …  (a ik  b kj ). Note that the actual Boolean product symbol has a dot in its center. Basically, Boolean multiplication works like the multiplication of matrices, but with computing  instead of the product and  instead of the sum.

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 17 Zero-One Matrices Example:

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 18 Zero-One Matrices Let A be a square zero-one matrix and r be a positive integer. The r-th Boolean power of A is the Boolean product of r factors of A. The r-th Boolean power of A is denoted by A [r]. A [0] = I n, A [r] = A  A  …  A (r times the letter A)

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 19 Let’s proceed to… Mathematical Reasoning

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 20 Mathematical Reasoning We need mathematical reasoning to determine whether a mathematical argument is correct or incorrect and determine whether a mathematical argument is correct or incorrect and construct mathematical arguments. construct mathematical arguments. Mathematical reasoning is not only important for conducting proofs and program verification, but also for artificial intelligence systems (drawing inferences).

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 21Terminology An axiom is a basic assumption about mathematical structures that needs no proof. We can use a proof to demonstrate that a particular statement is true. A proof consists of a sequence of statements that form an argument. The steps that connect the statements in such a sequence are the rules of inference. Cases of incorrect reasoning are called fallacies. A theorem is a statement that can be shown to be true.

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 22Terminology A lemma is a simple theorem used as an intermediate result in the proof of another theorem. A corollary is a proposition that follows directly from a theorem that has been proved. A conjecture is a statement whose truth value is unknown. Once it is proven, it becomes a theorem.

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 23 Rules of Inference Rules of inference provide the justification of the steps used in a proof. One important rule is called modus ponens or the law of detachment. It is based on the tautology (p  (p  q))  q. We write it in the following way: p p  q ____  q q q q The two hypotheses p and p  q are written in a column, and the conclusion below a bar, where  means “therefore”.

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 24 Rules of Inference The general form of a rule of inference is: p 1 p 1 p 2 p 2... p n p n____  q q q q The rule states that if p 1 and p 2 and … and p n are all true, then q is true as well. These rules of inference can be used in any mathematical argument and do not require any proof.

February 26, 2015Applied Discrete Mathematics Week 5: Mathematical Reasoning 25 Rules of Inference p_____  pq pq pq pq Addition pq pq pq pq_____  p p p p Simplification p q_____  pq pq pq pq Conjunction q q q q pq pq pq pq_____  p p p p Modus tollens pq pq pq pq qr qr qr qr_____  pr pr pr pr Hypothetical syllogism pq pq pq pq p p p p_____  q q q q Disjunctive syllogism