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.
답을 드러내세요
이제 너 문제를 선택하거나, 타이핑하거나, 자신만의 문제를 그려보세요. 모든 단계는 그림으로 표시되며, 답은 질문을 할 때까지 숨겨져 있습니다.
여기서 사용된 기호
기호를 탭하면 전체 정의, 이미지 및 각 문자의 의미를 확인할 수 있습니다.
어떻게: Relations, functions and equivalence
- 2 variable(s) → 4 rows. Fill in every combination.
- Contingent: true for some inputs, false for others.
사람들이 묻는 질문
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