Scribd
Upload
9 views

MATHS130_Study_Guide_Part1

The document is a study guide for MATHS130 covering proof techniques, logic and quantifiers, sets and operations, and functions. It includes examples of direct proof, contrapositive proof, proof by contradiction, and counterexamples, along with explanations of logical connectives and set operations. Additionally, it provides exercises and answers related to these topics.

Uploaded by

mazibukonkosingimele
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
9 views

MATHS130_Study_Guide_Part1

The document is a study guide for MATHS130 covering proof techniques, logic and quantifiers, sets and operations, and functions. It includes examples of direct proof, contrapositive proof, proof by contradiction, and counterexamples, along with explanations of logical connectives and set operations. Additionally, it provides exercises and answers related to these topics.

Uploaded by

mazibukonkosingimele
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

MATHS130 Study Guide - Part 1 (Pages

1–20)
1. Proof Techniques
Direct Proof: Start by assuming the hypothesis is true, then use logical steps to prove the
conclusion.
Example: Prove that if x is even, then x^2 is even.
Proof: Let x = 2k for some integer k. Then x^2 = (2k)^2 = 4k^2 = 2(2k^2), which is even.

Contrapositive Proof: Prove the contrapositive instead of the original implication.


Example: To prove 'If x^2 is odd, then x is odd', prove 'If x is even, then x^2 is even'.

Proof by Contradiction: Assume the statement is false and derive a contradiction.


Example: Prove sqrt(2) is irrational by assuming it’s rational and showing a contradiction.

Counterexample: Disprove statements by providing a single counterexample.


Example: 'All prime numbers are odd' is false because 2 is prime and even.

2. Logic and Quantifiers


Logical Connectives:
- and (∧), or (∨), not (¬), implies (⇒), if and only if (⇔)
Truth Tables: Used to determine the truth value of compound statements.
Quantifiers:
- ∀ (for all), ∃ (there exists)
Negation of quantifiers:
- ¬(∀x P(x)) ≡ ∃x ¬P(x)
- ¬(∃x P(x)) ≡ ∀x ¬P(x)

3. Sets and Operations


Set Notation: {}, ∈, ∉, ⊆, ⊂, ∪, ∩, −, P(A)
Set Operations:
- Union (A ∪ B): Elements in A or B
- Intersection (A ∩ B): Elements in both A and B
- Set Difference (A − B): Elements in A not in B
- Complement (A'): Elements not in A (within universal set)
Power Set: P(A) = set of all subsets of A
Cartesian Product: A × B = {(a, b) | a ∈ A, b ∈ B}

4. Functions
Function: A relation where every input has exactly one output.
Types of functions:
- Injective (one-to-one): No two inputs map to the same output.
- Surjective (onto): Every output has at least one input.
- Bijective: Both injective and surjective.
Function Composition: (f ∘ g)(x) = f(g(x))
Inverse Functions: Only exist for bijective functions.

Exercises
1. Prove that if n is odd, then n^2 is odd.
2. Let A = {1, 2, 3}, B = {a, b}. Find A × B.
3. Is the function f(x) = x^2 injective on R? On R^+?
4. Use induction to prove: 1 + 2 + ... + n = n(n+1)/2
5. Prove: If a | b and a | c, then a | (b + c)
6. Negate: 'For all x in R, x^2 ≥ 0'
7. Write the contrapositive: 'If x is rational, then x can be written as a/b'

Answers
1. Proof: Let n = 2k + 1 (odd). Then n^2 = (2k + 1)^2 = 4k^2 + 4k + 1 = 2(2k^2 + 2k) + 1 →
odd.
2. A × B = {(1,a), (1,b), (2,a), (2,b), (3,a), (3,b)}
3. f(x) = x^2 is not injective on R (e.g., f(2) = f(-2)) but is injective on R^+.
4. Base case: n = 1. 1 = 1(1+1)/2 = 1. Inductive step follows as standard.
5. b = ak, c = al ⇒ b + c = a(k + l), so a divides b + c.
6. There exists x in R such that x^2 < 0.
7. Contrapositive: If x cannot be written as a/b, then x is not rational.

You might also like