World Library  
Flag as Inappropriate
Email this Article

Irreflexive relation

Article Id: WHEBN0000200455
Reproduction Date:

Title: Irreflexive relation  
Author: World Heritage Encyclopedia
Language: English
Subject: Weak ordering, Relation algebra
Collection:
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Irreflexive relation

In mathematics, a reflexive relation is a binary relation on a set for which every element is related to itself. In other words, a relation ~ on a set S is reflexive when x ~ x holds true for every x in S.[1][2] An example of a reflexive relation is the relation "is equal to" on the set of real numbers, since every real number is equal to itself. A reflexive relation is said to have the reflexive property or is said to possess reflexivity.

Related terms

A relation that is irreflexive, or anti-reflexive, is a binary relation on a set where no element is related to itself. An example is the "greater than" relation (x>y) on the real numbers. Note that not every relation which is not reflexive is irreflexive; it is possible to define relations where some elements are related to themselves but others are not related to themselves (i.e., neither all nor none). For example, the binary relation "the product of x and y is even" is reflexive on the set of even numbers, irreflexive on the set of odd numbers, and neither reflexive nor irreflexive on the set of natural numbers.

A relation is called quasi-reflexive if every element that is related to some element is related to itself. An example is the relation "has the same limit as" on the set of sequences of real numbers: not every sequence has a limit, and thus the relation is not reflexive, but if a sequence has the same limit as some sequence, then it has the same limit as itself.

The reflexive closure of a binary relation ~ on a set S is the smallest reflexive relation on S which is a superset of ~. Equivalently, it is the union of ~ and the identity relation on S. For example, the reflexive closure of x<y is xy.

The reflexive reduction of a binary relation ~ on a set S is the smallest relation ~′ such that ~′ shares the same reflexive closure as ~. It can be seen in a way as the opposite of the reflexive closure. It is equivalent to the complement of the identity relation on S with regard to ~. That is, it is equivalent to ~ except for where x~x is true. For example, the reflexive reduction of xy is x<y.

Examples

250px
250px

Examples of reflexive relations include:

  • "is equal to" (equality)
  • "is a subset of" (set inclusion)
  • "divides" (divisibility)
  • "is greater than or equal to"
  • "is less than or equal to"

Examples of irreflexive relations include:

  • "is not equal to"
  • "is coprime to"(for the integers>1, since 1 is coprime to itself)
  • "is a proper subset of"
  • "is greater than"
  • "is less than"


Number of reflexive relations

The number of reflexive relations on an n-element set is 2n2n.[3]

Number of n-element binary relations of different types
n all transitive reflexive preorder partial order total preorder total order equivalence relation
0 1 1 1 1 1 1 1 1
1 2 2 1 1 1 1 1 1
2 16 13 4 4 3 3 2 2
3 512 171 64 29 19 13 6 5
4 65536 3994 4096 355 219 75 24 15
OEIS A002416 A006905 A053763 A000798 A001035 A000670 A000142 A000110

See also

Notes

References

  • Levy, A. (1979) Basic Set Theory, Perspectives in Mathematical Logic, Springer-Verlag. Reprinted 2002, Dover. ISBN 0-486-42079-5
  • Lidl, R. and Pilz, G. (1998). Applied abstract algebra, Undergraduate Texts in Mathematics, Springer-Verlag. ISBN 0-387-98290-6
  • Quine, W. V. (1951). Mathematical Logic, Revised Edition. Reprinted 2003, Harvard University Press. ISBN 0-674-55451-5
  • Gunther Schmidt, 2010. Relational Mathematics. Cambridge University Press, ISBN 978-0-521-76268-7.

External links

  • Template:Springer
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.