maths.free › Set Theory & Logic › Relations, functions and equivalence
Relations, functions and equivalence
Relations as sets of pairs; reflexive, symmetric, transitive; functions and bijections.
A relation is a set of ordered pairs; an equivalence relation (reflexive, symmetric, transitive) partitions its set into classes; a function is a relation with exactly one output per input. Picture it: "same remainder mod 3" splits the integers into three columns. Think it: a bijection is how we say two sets have the same size — including infinite ones.
工作范例: truth table of p implies q
Truth table of p implies q
一步
- p \Rightarrow q
2 variable(s) → 4 rows. Fill in every combination.
- \
Contingent: true for some inputs, false for others.
发送答案
Symbols used here
Logical connectives.
The two sides are different.
Not a number: "grows without bound" in limits and intervals.
Naturals, integers, rationals, reals, complex numbers.
x belongs to A; every element of A is in B.
In either; in both; in A but not B.
The set with no elements; the number of elements of A.
Quantifiers: every x; at least one x.
Marks the point where the statement has been established.
How to: Relations, functions and equivalence
- 2 variable(s) → 4 rows. Fill in every combination.
- Contingent: true for some inputs, false for others.
Questions people ask
Are some infinities bigger than others?
Yes. The integers and the rationals can be listed; the real numbers cannot (Cantor's diagonal argument), so there are strictly more reals than integers.
What is the difference between a relation and a function?
A relation pairs inputs with outputs freely; a function is a relation in which every input gets exactly one output.
试试你自己试试
更多 Set Theory & Logic
Sets and operationsCardinality and infinityLogic and methods of proof