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

NSW HSC Mathematics Extension 2

HSC · NESAMathematics Extension 236 ملاحظة في 5 مجلدات، 226 KB

36 ملاحظات للمذاكرة لمادة NESA HSC Mathematics Extension 2، أعدّها cookie، في 5 أقسام تتبع موضوعات المنهج.

Notes for NSW HSC Mathematics Extension 2, in folders for the five areas of the Mathematics Extension 2 11-12 Syllabus (2024) in its order: proof, vectors, complex numbers, further integration and mechanics. Each note has the definitions, results, proofs and methods for one topic, with worked examples. Delete any folder or note you don't need once the notes are yours.

ما المحتوى؟

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

Proof / The language and notation of proof: statements, connectives and quantifiers

Statements

A statement, also called a proposition, is a sentence with a definite truth value: it is true or it is false, and never both. "77 is prime" is a statement (true), "2+2=52 + 2 = 5" is a statement (false), and "x>3x > 3" is not a statement on its own, because its truth depends on the value of xx. It becomes a statement once xx is given a value or is quantified, as in "for all real xx, x2≥0x^2 \ge 0".

Statements are usually named with capital letters such as PP and QQ, and new statements are built from them with connectives.

Connectives

The conjunction P∧QP \land Q is read "PP and QQ" and is true only when both PP and QQ are true. The disjunction P∨QP \lor Q is read "PP or QQ" and is true when at least one of them is true, so it includes the case where both are true.

The negation of PP is "not PP", written ¬P\neg P or ∼P\sim P. It is true exactly when PP is false, and negating twice returns the original statement:

¬(¬P)=P. \neg(\neg P) = P.

The implication "if PP then QQ" is written P⇒QP \Rightarrow Q or P→QP \to Q and read "PP implies QQ". The statement PP is the hypothesis and QQ the conclusion. An implication is false in exactly one situation: PP true and QQ false. When PP is false the implication is true whatever QQ is, because nothing has been promised. For example, the statement "if x=3x = 3 then x2=10x^2 = 10" is true when it is applied to x=5x = 5, because its hypothesis is false there and nothing is claimed. It is false when applied to x=3x = 3, because the hypothesis holds and the conclusion does not.

The truth values can be set out in a table.

PPQQP∧QP \land QP∨QP \lor QP⇒QP \Rightarrow Q
TTTTT
TFFTF
FTFTT
FFFFT

Quantifiers

Two quantifiers turn a sentence about a variable into a statement.

  • ∀\forall means "for all" or "for every". The statement ∀x∈R, x2≥0\forall x \in \mathbb{R},\ x^2 \ge 0 says every real number has a non-negative square.
  • ∃\exists means "there exists" or "there is at least one". The statement ∃x∈Z, x2=49\exists x \in \mathbb{Z},\ x^2 = 49 says some integer has square 4949.

The set the variable is drawn from matters. "∃x, x2=2\exists x,\ x^2 = 2" is true over R\mathbb{R} and false over Q\mathbb{Q}, and "∃x, x2=−1\exists x,\ x^2 = -1" is false over R\mathbb{R} and true over C\mathbb{C}.

A statement with ∀\forall is shown false by a single example that fails, which is a counterexample. A statement with ∃\exists is shown true by a single example that works, but showing it false needs an argument covering every possible value.

Negating statements

Negation has to be done carefully, because the natural-sounding opposite is often wrong. The negation of "all the students passed" is "at least one student did not pass", and not "no student passed".

The rules are:

StatementNegation
¬(¬P)\neg(\neg P)PP
P∧QP \land Q¬P∨¬Q\neg P \lor \neg Q
P∨QP \lor Q¬P∧¬Q\neg P \land \neg Q
P⇒QP \Rightarrow QP∧¬QP \land \neg Q
∀x, P(x)\forall x,\ P(x)∃x, ¬P(x)\exists x,\ \neg P(x)
∃x, P(x)\exists x,\ P(x)∀x, ¬P(x)\forall x,\ \neg P(x)

The second and third rows say that negating a conjunction or a disjunction swaps the connective and negates each part. They are often called De Morgan's laws. The fourth row says that an implication fails only when its hypothesis holds and its conclusion does not.

The negation of an inequality uses the complementary one: ¬(a>b)\neg(a > b) is a≤ba \le b, and ¬(a=b)\neg(a = b) is a≠ba \ne b.

Examples

Negate "∀x∈Z, x2 is odd\forall x \in \mathbb{Z},\ x^2 \text{ is odd}". The negation swaps the quantifier and negates the property: ∃x∈Z\exists x \in \mathbb{Z} such that x2x^2 is even. The original is false and its negation is true, since x=2x = 2 gives 44.

Negate "∃n∈N, n>5∧n is even\exists n \in \mathbb{N},\ n > 5 \land n \text{ is even}". It becomes ∀n∈N, n≤5∨n is odd\forall n \in \mathbb{N},\ n \le 5 \lor n \text{ is odd}.

Negate "if x>2x > 2 then x2>4x^2 > 4". Using ¬(P⇒Q)=P∧¬Q\neg(P \Rightarrow Q) = P \land \neg Q it becomes "x>2x > 2 and x2≤4x^2 \le 4", which is impossible for real xx, which agrees with the fact that the original implication is true.

Negate "for every real ε>0\varepsilon > 0 there is an integer NN with 1/N<ε1/N < \varepsilon". Working from the left, ∀\forall becomes ∃\exists and then ∃\exists becomes ∀\forall, and the last inequality is reversed: there is a real ε>0\varepsilon > 0 such that for every integer NN, 1/N≥ε1/N \ge \varepsilon. A statement with several quantifiers is negated one quantifier at a time, from the outside in, and the order of the quantifiers is kept.

Order of quantifiers

The order of different quantifiers changes the meaning. Over the real numbers, ∀x ∃y, y>x\forall x\ \exists y,\ y > x is true, since for any xx we may take y=x+1y = x + 1. But ∃y ∀x, y>x\exists y\ \forall x,\ y > x says one number exceeds every real number, which is false.

Using statements in mathematics

A result in mathematics is usually a true implication, "if PP then QQ", often with a quantifier hidden in it. "If nn is even then n2n^2 is even" means ∀n∈Z\forall n \in \mathbb{Z}, (nn even ⇒\Rightarrow n2n^2 even). To show it false one exhibits a single integer nn that is even while n2n^2 is odd, and no such integer exists, so the statement is true. Reading a worded result as a precisely quantified statement is the first step in both proving and disproving it.

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

التقييمات

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