Mathematical logic and foundations Definition
Antisymmetric relation
Builds on Binary relation
Definition
Let be a binary relation on a set . The relation is antisymmetric when, for all , and imply .
Remarks
The relation on and the relation on sets are antisymmetric. Divisibility is antisymmetric on but not on , because and . Antisymmetric is not the opposite of symmetric: equality is both symmetric and antisymmetric.
Reading path
To understand this page from the ground up, read these 11 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Element definition
- Proposition concept
- Set definition
- Implication definition
- Predicate definition
- Ordered pair definition
- Universal quantifier definition
- Cartesian product definition
- Subset definition
- Binary relation definition
- Antisymmetric relation definition
Where this leads
111 pages build on this one.
- Hasse diagram
- Partial order
- Well-founded relation
- Total order
- Zorn's lemma
- The reals have the cardinality of the continuum
- Well-order
- Lexicographic order
- Antichain
- Chain
- Upper bound
- Hausdorff maximal principle
- Minimal element
- Continuum hypothesis
- Well-ordering theorem
- Cardinal number
- Ordinal number
- Least element
- Maximal element
- Aleph-null
- Cardinality of the continuum
- Order isomorphism
- Greatest element
- Transfinite induction
- Closure operator
- Linearly ordered group
- Order type
- Ordinal arithmetic
- Kleene algebra
- Nilradical is the intersection of the prime ideals
- Ultrafilter lemma
- Von Neumann universe
- Fodor's lemma
- Ordinal analysis
- Woodin cardinal
- Naive set theory
- Stationary set
- Cantor normal form
- Veblen function
- Axiom of regularity
- Riesz space
- Kunen's inconsistency theorem
- Singular cardinals hypothesis
- Bourbaki–Witt theorem
- Partially ordered ring
- Ordered group
- Cantor's isomorphism theorem
- Baire function
- Order dimension
- Order embedding
- Interior operator
- Duality in order theory
- Upper set
- Proof-theoretic ordinal
- Ordinal analysis
- Proof-theoretic ordinal
- Archimedean equivalence classes
- Hölder's theorem on Archimedean groups
- Category of posets
- Birkhoff's subdirect representation theorem
- Suslin's problem
- Characterizations of semisimple modules
- Covering relation
- Cohen's independence of CH
- f-ring
- Hahn embedding theorem
- Lattice-ordered group
- Club set
- Diamond principle
- Dense order
- Ordered ring
- Set theory
- Proper forcing axiom
- Aronszajn tree
- Epsilon nought
- Galois connection
- Suslin line
- Baer's criterion
- Idempotent semiring
- Alexander subbase theorem
- Cofinality
- Transcendence degree
- Normal function
- Gödel's consistency of CH and AC
- Left-orderable group
- Gentzen's consistency proof
- Ordered semigroup
- Cardinal characteristics of the continuum
- Erdős–Rado theorem
- Maximum and minimum
- Ultrafilter
- Boolean prime ideal theorem
- Bounded poset
- Residuated mapping
- Szpilrajn extension theorem
- Aleph number
- Down-closure
- Hahn series
- Von Neumann–Bernays–Gödel set theory
- Class
- Existence of transcendence bases
- Positive cone
- Easton's theorem
- Maximal chain
- Ordered vector space
- Galois insertion
- Vaught conjecture
- Martin's axiom
- Beth number
- Regular cardinal
- Orderable group
Further reading
- Web https://en.wikipedia.org/wiki/Antisymmetric_relation, lead section
About this page
| Tag | 01MGYYBB9R |
|---|---|
| URI | m2://01MGYYBB9R |
| Kind | definition |
| Writing | W1 stated |
| MSC | 03E20 |
| Defines | Antisymmetric relation |
| Uses | Binary relation |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.