Math 2.0

Mathematical logic and foundations Concept

Set-builder notation

Builds on SetPredicate

Summary

Set-builder notation describes a set by a property of its elements. For a set XX and a predicate P(x)P(x) on XX, the set {x∈X∣P(x)}\{x \in X \mid P(x)\} has as elements exactly the a∈Xa \in X such that P(a)P(a) is true.

Remarks

A colon is a common alternative to the bar: {x∈X:P(x)}\{x \in X : P(x)\}. Example: {n∈ℤ∣n is even}\{n \in \mathbb{Z} \mid n \text{ is even}\} is the set of even integers. The form {f(x)∣x∈X}\{f(x) \mid x \in X\} denotes the set of the values f(x)f(x). This is the image of XX under ff. Without the bound x∈Xx \in X, the notation {x∣P(x)}\{x \mid P(x)\} can lead to Russell's paradox.

Reading path

To understand this page from the ground up, read these 5 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Element definition
  2. Proposition concept
  3. Set definition
  4. Predicate definition
  5. Set-builder notation concept

Where this leads

63 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Set-builder_notation, lead section
About this page
Tag0TMZ89Q5KA
URIm2://0TMZ89Q5KA
Aliasesset-comprehension
Kindconcept
WritingW0 stub
MSC03E20
UsesSet, Predicate
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by