This document discusses the language and symbols used in mathematics. It covers expressions versus sentences, unary and binary operations, and some fundamentals of logic. The key topics covered include the nature of mathematics as a language, evaluating mathematical expressions, and recognizing properties of operations like identity, inverses, commutativity, and associativity. Example problems demonstrate working with binary operation tables and using properties of operations to prove statements in algebraic structures like the integers.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
0 ratings0% found this document useful (0 votes)
129 views85 pages
UNIT 2 Mathematical Language and Symbols
This document discusses the language and symbols used in mathematics. It covers expressions versus sentences, unary and binary operations, and some fundamentals of logic. The key topics covered include the nature of mathematics as a language, evaluating mathematical expressions, and recognizing properties of operations like identity, inverses, commutativity, and associativity. Example problems demonstrate working with binary operation tables and using properties of operations to prove statements in algebraic structures like the integers.
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 85
MATHEMATICAL LANGUAGE AND
SYMBOLS
2.1 The Language of Mathematics
2.2 Expressions vs Sentences 2.3 Unary and Binary Operations 2.4 Some Fundamentals of Logic LEARNING OBJECTIVES
1. Discuss the language, symbols, and conventions
used in mathematics 2. Explain the nature of mathematics as language; 3. Evaluate mathematical expressions correctly; 4. Recognize that mathematics is a useful language THE LANGUANGE OF MATHEMATICS 2.1 EXPRESSION VS SENTENCES 2.2 UNARY AND BINARY 2.3 OPERATIONS UNARY OPERATION accepts only one value or operand
Examples: 1.-5 2.Sin x 3.Cos 45⁰ 4.Tan BINARY OPERATIONS *take two values, and include the operations of addition, subtraction, multiplication, division and exponentiation *An operation is binary if it takes two real numbers as arguments to produce another real number Examples: 1.Addition 4+5=9 2.Subtraction 10 – 8 = 2 PROPERTIES OF BINARY OPERATIONS PROPERTIES OF BINARY OPERATIONS CONTINUED Binary Operation Tables 0 1 2 3 If ° is a binary operation on a finite set S, then we can represent ° in 0 0 1 2 3 1 1 2 3 0 table form, where the entry in row x and column y is the value x ° y. 2 2 3 0 1 Example. Let S = N4 = {0, 1, 2, 3} and let x ° y = (x + y) mod 4. 3 3 0 1 2 Then the operation table for ° is pictured. Quiz (1 minute). For the table pictured in the previous example, state whether ° satisfies any of the following properties: commutative, associative, identity, zero, inverses. Answer. Is commutative; is associative; has identity 0; no zero; has inverses 1 ° 3 = 0, 2 ° 2 = 0, and 0 ° 0 = 0. Quiz (6 minutes). Let S = {a, b, c} and let ° be a binary operation on S. In each case, find an operation table for ° that satisfies the given conditions. 1. b is a zero, a is an identity, every element except b has an inverse, and ° is commutative. Answers. 2. ° is commutative a b c (1) associative. but not (2) a b c (3) a b c a a b c a a b c a a b c 3. ° is associative but not commutative. b b b b b b b a b a b c c c b a c c a b c a b c
In (2) we have b ° (b ° c) = b ° a = b and (b ° b) ° c = b ° c = a. So ° is not associative.
In (3) we have x ° y = y for x, y S. So (x ° y) ° z = z and x ° (y ° z) = x ° z = z for x, y, z S. So ° is associative. Using Properties of Operations Algebras are useful when we apply properties of the operations to solve problems. Example. Suppose we want to prove the following statement about integers: x + x = x implies x = 0. Here is an “equational proof” with reasons in parentheses. Proof: x =x+0 (0 is identity for +) = x + (x + –x) (–x is the inverse of x with respect to +) = (x + x) + –x (+ is associative) = x + –x (hypothesis) =0 (–x is the inverse of x with respect to +). QED. Notice in the example that we used several properties of the algebra Z; 0, +. Namely, that + has an identity, + is associative, and an inverse exists for every integer. Quiz (3 minutes). Given the algebra Z; 0, +. Prove the cancellation law: x + z = y + z implies x = y. Answer. x = x + 0 (0 is identity for +) = x + (z + –z) (–z is the inverse of z with respect to +) = (x + z) + –z (+ is associative) = (y + z) + –z (hypothesis) = y + (z + –z) (+ is associative) =y+0 (–z is the inverse of z with respect to +) =y (0 is identity for +). QED. SOME FUNDAMENTALS OF LOGIC 2.4 PROPOSITIONAL CONNECTIVES PROPOSITIONAL LOGIC