انتقل إلى المحتوى
cookie

VCE Specialist Mathematics

VCE · VCAAMathematics44 ملاحظة في 10 مجلدات، 267 KB

44 ملاحظات للمذاكرة لمادة VCAA VCE Mathematics، أعدّها cookie، في 6 أقسام تتبع موضوعات المنهج.

Notes for VCE Specialist Mathematics Units 3 and 4 (VCAA), in folders for the study design's six areas of study: logic and proof, functions and graphs, complex numbers, calculus, vectors, and statistical inference. Each note has the definitions, results and methods for one topic with worked examples. Follows the Mathematics Study Design accredited from 2023. Delete any folder or note you don't need once the notes are yours.

ما المحتوى؟

الملاحظة الأولى

Discrete mathematics / Statements, implications and quantifiers

Statements and conjectures

A statement (or proposition) is a sentence that is either true or false, never both. "77 is prime" and "every square number is even" are statements, the first true and the second false. "x+2=5x + 2 = 5" is not a statement on its own, because its truth depends on xx; it becomes one when xx is given a value or quantified.

A conjecture is a statement put forward as possibly true, which has then to be proved or disproved. Mathematicians usually reach one by looking at examples and spotting a pattern. The values n2−n+41n^2 - n + 41 are prime for n=1,2,3,…,40n = 1, 2, 3, \dots, 40, which might suggest that the expression is always prime, but n=41n = 41 gives 41241^2, which is not. Examples therefore support a conjecture without establishing it, whereas one failure disproves it.

Connectives

Statements are combined with the connectives "and" (∧\wedge), "or" (∨\vee) and "not" (¬\neg). In mathematics "or" is inclusive: P∨QP \vee Q is true when PP is true, when QQ is true, or when both are.

PPQQP∧QP \wedge QP∨QP \vee Q¬P\neg P
TTTTF
TFFTF
FTFTT
FFFFT

The negation of "PP and QQ" is "not PP or not QQ", and the negation of "PP or QQ" is "not PP and not QQ". For example, the negation of "x>2x > 2 and x<5x < 5" is "x≤2x \le 2 or x≥5x \ge 5".

Implications

The implication P⇒QP \Rightarrow Q ("if PP then QQ", "PP implies QQ") says that whenever PP is true, QQ is also true. It is false in exactly one case, when PP is true and QQ is false.

PPQQP⇒QP \Rightarrow Q
TTT
TFF
FTT
FFT

When PP is false the implication makes no claim, so it counts as true (it is vacuously true). The statement "if xx is a multiple of 44 then xx is even" is not contradicted by the number 77, which is neither.

Converse, inverse and contrapositive

From P⇒QP \Rightarrow Q three related statements can be formed.

StatementFormSame truth value as P⇒QP \Rightarrow Q?
ConverseQ⇒PQ \Rightarrow PNot necessarily
Inverse¬P⇒¬Q\neg P \Rightarrow \neg QNot necessarily
Contrapositive¬Q⇒¬P\neg Q \Rightarrow \neg PAlways

The contrapositive is logically equivalent to the original, which is why proving it proves the original. Take "if I have a tiger then I have a cat". Its contrapositive is "if I do not have a cat then I do not have a tiger", which is true for the same reason. The converse, "if I have a cat then I have a tiger", is false.

The converse of a true statement can be true or false: "if x=2x = 2 then x2=4x^2 = 4" is true, but its converse "if x2=4x^2 = 4 then x=2x = 2" is false because x=−2x = -2 also works.

Equivalence and "if and only if"

If both P⇒QP \Rightarrow Q and Q⇒PQ \Rightarrow P hold, the statements are equivalent, written P⇔QP \Leftrightarrow Q and read "PP if and only if QQ". To prove an "if and only if" statement, prove both directions separately, unless every step of one argument is reversible.

An integer is divisible by 66 if and only if it is divisible by both 22 and 33. Each direction needs its own argument: if 6∣n6 \mid n then n=6k=2(3k)=3(2k)n = 6k = 2(3k) = 3(2k), and if 2∣n2 \mid n and 3∣n3 \mid n then n=2an = 2a and 3∣2a3 \mid 2a, so 3∣a3 \mid a because 33 shares no factor with 22, giving 6∣n6 \mid n.

Necessary and sufficient conditions

When P⇒QP \Rightarrow Q, the condition PP is sufficient for QQ (knowing PP is enough to be sure of QQ) and QQ is necessary for PP (if QQ fails, PP cannot hold). When P⇔QP \Leftrightarrow Q, each is necessary and sufficient for the other.

For real xx, "x>3x > 3" is sufficient for "x2>9x^2 > 9", since x>3x > 3 forces x2>9x^2 > 9. It is not necessary, because x=−4x = -4 has x2>9x^2 > 9 without x>3x > 3. Being a square is necessary for a number to be a perfect fourth power, but it is not sufficient, since 99 is a square and not a fourth power.

Quantifiers

A statement about a variable needs to say how many values of it the claim covers.

  • The universal quantifier ∀\forall, "for all" or "for every": ∀x∈R, x2≥0\forall x \in \mathbb{R},\ x^2 \ge 0.
  • The existential quantifier ∃\exists, "there exists" or "for some": ∃x∈R, x2=2\exists x \in \mathbb{R},\ x^2 = 2.

The set the variable comes from matters. "∃x, x2=2\exists x,\ x^2 = 2" is true over R\mathbb{R} and false over Q\mathbb{Q}, since 2\sqrt{2} is irrational. "There exists an xx with x2=−1x^2 = -1" is false over R\mathbb{R} and true over C\mathbb{C}.

Negating quantified statements

To negate a statement with a quantifier, swap the quantifier and negate what follows.

¬(∀x, P(x))  ⇔  ∃x, ¬P(x),¬(∃x, P(x))  ⇔  ∀x, ¬P(x). \neg\big(\forall x,\ P(x)\big) \;\Leftrightarrow\; \exists x,\ \neg P(x), \qquad \neg\big(\exists x,\ P(x)\big) \;\Leftrightarrow\; \forall x,\ \neg P(x).

The negation of "every prime is odd" is "some prime is even", which is true because of 22. The negation of "there is a real xx with x2+1=0x^2 + 1 = 0" is "for every real xx, x2+1≠0x^2 + 1 \ne 0", which is true. With two quantifiers, each is swapped in turn: the negation of ∀x ∃y, y>x\forall x\ \exists y,\ y > x is ∃x ∀y, y≤x\exists x\ \forall y,\ y \le x.

Examples and counter-examples

An example cannot prove a universal statement, because no number of cases covers every case. A single counter-example disproves one, because a statement that holds "for all xx" fails as soon as it fails for one xx.

To disprove "for all real xx, x2>xx^2 > x", take x=12x = \tfrac{1}{2}: then x2=14x^2 = \tfrac{1}{4}, which is less than 12\tfrac{1}{2}. To disprove "if f′(a)=0f'(a) = 0 then ff has a turning point at x=ax = a", take f(x)=x3f(x) = x^3 and a=0a = 0: the derivative 3x23x^2 is zero at 00, but the gradient is non-negative on both sides, so there is a stationary point of inflection and no turning point.

An existence claim ("there exists") is the opposite: one example proves it, and showing that it fails for some values disproves nothing. Disproving "there exists xx such that …\dots" needs an argument covering every xx.

An implication is disproved by a case where PP holds and QQ fails. For "if nn is prime then nn is odd", the counter-example is n=2n = 2. A counter-example to "if f(0)=0f(0) = 0 then ff has a point of inflection at x=0x = 0" is f(x)=x2f(x) = x^2, which has a minimum at the origin.

Stating what has to be proved

Before writing a proof, put the claim into the form P⇒QP \Rightarrow Q (or P⇔QP \Leftrightarrow Q, or a quantified statement), name the assumptions PP, and name the goal QQ. "The sum of two odd integers is even" becomes: for all integers aa and bb, if aa and bb are odd then a+ba + b is even. The same statement tells you which proof technique suits it: a direct argument from the assumptions, an argument from the contrapositive, or a contradiction.

و43 أخرى: افتح أياً منها من القائمة أعلاه.

التقييمات

لا توجد مراجعات مكتوبة بعد. أضف هذه الملاحظات إلى مجموعتك، ويمكنك أن تكون أول من يكتب مراجعة.