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.
Voorbeeld van werk · truth table of p implies q
Truth table of p implies q
Stap voor stap
- p \Rightarrow q
2 variable(s) → 4 rows. Fill in every combination.
- \
Contingent: true for some inputs, false for others.
Onthul het antwoord
Nu jij. Kies een probleem, type of teken je eigen. Elke stap, een foto, het antwoord verborgen totdat je het vraagt.
Hier gebruikte symbolen
Tik op elk symbool voor de volledige definitie, een afbeelding en wat elke letter erin betekent.
Hoe: Relations, functions and equivalence
- 2 variable(s) → 4 rows. Fill in every combination.
- Contingent: true for some inputs, false for others.
Vragen die mensen stellen
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.
Meer in Set Theory & Logic
Sets and operationsCardinality and infinityLogic and methods of proof