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.
Eksempel på arbeid · truth table of p implies q
Truth table of p implies q
Steg for trinn
- p \Rightarrow q
2 variable(s) → 4 rows. Fill in every combination.
- \
Contingent: true for some inputs, false for others.
Vis svaret
Nå har du Velg et problem, eller skriv inn, eller tegne din egen. Hvert steg, et bilde, svaret skjult til du spør.
Symboler som brukes her
Trykk på et symbol for den fulle definisjonen, et bilde og hva hver bokstav i det betyr.
Hvordan: Relations, functions and equivalence
- 2 variable(s) → 4 rows. Fill in every combination.
- Contingent: true for some inputs, false for others.
Spørsmål folk stiller
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.
Mer i Set Theory & Logic
Sets and operationsCardinality and infinityLogic and methods of proof