Section 3.3 Proving set properties. Element-wise set proofs Claim. For all sets A and B, (A  B)  A. Proof. Let sets A and B be given. Since every element.

Slides:



Advertisements
Similar presentations
With examples from Number Theory
Advertisements

Mathematical Induction
Introduction to Proofs
PROOF BY CONTRADICTION
To prove by induction that 2 n ≥ n 2 for n ≥ 4, n  N Next (c) Project Maths Development Team 2011.
DEFINITION A function f : A  B is a one-to-one correspondence (called a bijection) iff f is one-to-one and onto B. We write f : A  B to indicate that.
© 2003, Yishai Feldman Proving Sufficient Completeness Example: Set ADT.
Instructor: Hayk Melikya
(CSC 102) Discrete Structures Lecture 14.
3.3 Divisibility Definition If n and d are integers, then n is divisible by d if, and only if, n = dk for some integer k. d | n  There exists an integer.
Proving Angles Congruent
The first of many fun lessons….  We will utilize class time and discussions to determine if a statement is true.
CS5371 Theory of Computation
Logic: Connectives AND OR NOT P Q (P ^ Q) T F P Q (P v Q) T F P ~P T F
1 Inference Supplementary Notes Prepared by Raymond Wong Presented by Raymond Wong.
MAT 3749 Introduction to Analysis Section 0.2 Mathematical Induction
Copyright © 2007 Pearson Education, Inc. Slide 8-1.
In previous sections we have been using calculators and graphs to guess the values of limits. Sometimes, these methods do not work! In this section we.
Mathematical Induction. F(1) = 1; F(n+1) = F(n) + (2n+1) for n≥ F(n) n F(n) =n 2 for all n ≥ 1 Prove it!
1 Introduction to Abstract Mathematics Chapter 4: Sequences and Mathematical Induction Instructor: Hayk Melikya 4.1- Sequences. 4.2,
MATH 224 – Discrete Mathematics
Rules of Fractions Investigation. What do you understand from this statement? What can we say about this? What do we need to know first? What should we.
Section 2.7 PROVE ANGLE PAIR RELATIONSHIPS. In this section… We will continue to look at 2 column proofs The proofs will refer to relationships with angles.
Section 2.6 Representation of numbers. Decimal representation (base 10) Given a positive integer X, the decimal representation of X is a string of digits.
9.4 Mathematical Induction
In this section, we will investigate a new technique for finding derivatives of curves that are not necessarily functions.
Honors Geometry Intro. to Deductive Reasoning. Reasoning based on observing patterns, as we did in the first section of Unit I, is called inductive reasoning.
Chapter 3 Determinants Linear Algebra. Ch03_2 3.1 Introduction to Determinants Definition The determinant of a 2  2 matrix A is denoted |A| and is given.
Continuity Chapter 2: Limits and Continuity.
Logical Reasoning:Proof Prove the theorem using the basic axioms of algebra.
Boolean Algebras Lecture 27 Section 5.3 Wed, Mar 7, 2007.
Section 3.3: Mathematical Induction Mathematical induction is a proof technique that can be used to prove theorems of the form:  n  Z +,P(n) We have.
2.1 Sets 2.2 Set Operations –Set Operations –Venn Diagrams –Set Identities –Union and Intersection of Indexed Collections 2.3 Functions 2.4 Sequences and.
Properties of Sets Lecture 26 Section 5.2 Tue, Mar 6, 2007.
2-3: Proving Theorems. Reasons used in Proofs Given information Definitions Postulates (Algebraic Properties included) Theorems that have already been.
Math 3121 Abstract Algebra I Lecture 11 Finish Section 13 Section 14.
Proving Angles Congruent Chapter 2 Section 6. Theorem A conjecture or statement that you can prove true. You can use given information, definitions, properties,
2-6 Proving Angles Congruent. Theorem: a conjecture or statement that you prove true.
MAT 2720 Discrete Mathematics Section 2.2 More Methods of Proof Part II
CHARACTERIZATIONS OF INVERTIBLE MATRICES
Types of Proof Lecture 4 Sections 0.4 Wed, Aug 29, 2007.
Section 6: Fundamental Theorem of Algebra Use the Fundamental Theorem of Algebra and its corollary to write a polynomial equation of least degree with.
Binomial Coefficients and Identities
1 Section 4.4 Inductive Proof What do we believe about nonempty subsets of N? Since  N, <  is well-founded, and in fact it is linear, it follows that.
Chapter 1 Logic and Proof.
Chapter 6 Differentiation.
Proving Segment and Angle Relationships
Antidifferentiation Find an antiderivative of a function.
Chapter 3 The Real Numbers.
LATTICES AND BOOLEAN ALGEBRA
Algebra 1 Section 2.3 Subtract real numbers
Chapter 2 Sets and Functions.
Proving Statements about Segments
Algebraic Limits and Continuity
PROOF BY CONTRADICTION
Algebraic Limits and Continuity
ROLLES THEOREM AND THE EXTREME VALUE THEOREM
Instructor: Alexander Stoytchev
Proving Statements about Segments
Chapter 11: Further Topics in Algebra
To prove by induction that n! > 2n for n > 3, n  N
ROLLES THEOREM AND THE EXTREME VALUE THEOREM
Copyright © Cengage Learning. All rights reserved.
Mathematical Induction
Proving Lines Parallel
Kleene’s Theorem (Part-3)
Eigenvalues and Eigenvectors
Copyright © Cengage Learning. All rights reserved.
THE WELL ORDERING PROPERTY
Chapter 2 Reasoning and Proof.
Presentation transcript:

Section 3.3 Proving set properties

Element-wise set proofs Claim. For all sets A and B, (A  B)  A. Proof. Let sets A and B be given. Since every element of A  B is necessarily in A, this shows that (A  B)  A.

Element-wise set proofs Claim. For all sets A and B, (A  B)  A. Proof. Let sets A and B be given. Let x  A  B be given. This means x  A and x  B. Therefore x  A. Since every element of A  B is necessarily in A, this shows that (A  B)  A.

Element-wise set proofs Claim. For all sets A and B, if A  B, then A  (A  B) Proof. Let sets A and B be given such that A  B. Since every element of A is necessarily in A  B, this shows that A  (A  B).

Element-wise set proofs Claim. For all sets A and B, if A  B, then A  (A  B) Proof. Let sets A and B be given such that A  B. Let x  A be given. Since A  B, this implies that x  B. Since x  A and x  B, then x  A  B. Since every element of A is necessarily in A  B, this shows that A  (A  B).

Practice Claim. For all sets A, B, and C, if A  B and B  C, then A  C. Proof. Let sets A, B, and C be given such that ______________________________. Let x  ______ be given. _______________________________________ Therefore x  ______. Since every element of A is necessarily in C, this shows that A  C.

Set equality To prove that two sets A and B are equal, you must do two separate proofs: one to show that A  B and one to show that B  A. Example. We have shown that A  B  A always and that A  A  B when A  B. We can conclude from these two proofs that the following is true: If A  B, then A  B = A

Algebraic properties of sets Theorem. For all sets A and B, A  (A  B) = A. Proof. We must show two different things! Claim 1. A  (A  B)  A Claim 2. A  A  (A  B) This is called the absorption property and it can thought of as an algebra simplification rule. Other rules like this are given on page 215.

Properties of set operations

Proving new properties from old Claim. For all sets A and B, A  (B’  A)’ = A  B Proof. A  (B’  A)’ = ____________ by ______ = ____________ by ______

Proving new properties from old Claim. For all sets A and B, A  (A’  B) = A  B Proof. A  (A’  B) = (A  A’)  (A  B) by _______ = U  (A  B) by __________ = (A  B)  U by __________ = A  Bby __________

Prove the following result by quoting appropriate properties of sets.

Further Section 3.3 Practice Do the Flash applets for this section as well since they will give feedback on the proofs.