Ruka hadi maudhui
The Lumenary
Darasa la 6–8FoundationsImepangwa

Set-builder notation, quantifiers and infinite sets

Describing sets by properties, reading and writing 'for all' and 'there exists', negating quantified statements, and meeting the first infinite sets such as the natural numbers and the even numbers.

math.found.quantifiers

Onyesha kila kinachohitajika kufikia mada hii

Somo la mada hii bado halijaandikwa. Muhtasari ulio hapa chini ni sehemu ya ramani ya mtaala na haujakaguliwa.

Inajengwa juu ya

SetsTrue, false, and, or, not

Masharti ya awali ya lazima 3 (hadi chini kabisa)

Utajifunza

  • Read and write sets in set-builder notation, such as {n ∈ ℕ : n is even}.
  • Translate between everyday sentences and statements using ∀ and ∃, and negate them correctly.
  • Recognise ℕ, ℤ and the even numbers as infinite sets and explain why no finite list contains all natural numbers.

Fasili

  • {x ∈ A : P(x)} is the set of those elements x of A for which P(x) is true.
  • ∀x ∈ A, P(x) means P(x) holds for every x in A; ∃x ∈ A, P(x) means P(x) holds for at least one x in A.
  • A set is finite if its elements can be listed as a₁, …, aₙ for some natural number n (n = 0 gives the empty set); otherwise it is infinite.

Nadharia

  • 'Not every x has P' is equivalent to 'some x does not have P', and 'no x has P' is equivalent to 'every x fails P'.
  • The order of mixed quantifiers matters: in ℕ, ∀x ∃y (y > x) is true but ∃y ∀x (y > x) is false.
  • ℕ is infinite: given any finite list of natural numbers, one more than the largest is not on the list.

Mawazo potofu ya kawaida

  • Swapping the order of ∀ and ∃ and expecting the meaning to stay the same.
  • Thinking a statement about all elements of the empty set must be false; it is vacuously true.
  • Treating 'infinity' as a very large natural number.

Inaelekea kwa

Propositional logic and truth tablesRussell's paradox and why sets need axioms

Ugunduzi wa hiari