Loading [MathJax]/extensions/mml2jax.js
Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

Search

  • Filter Results
  • Location
  • Classification
    • Article type
    • Stage
    • Author
    • Embed Hypothes.is?
    • Cover Page
    • License
    • Show Page TOC
    • Transcluded
    • PrintOptions
    • OER program or Publisher
    • Autonumber Section Headings
    • License Version
    • Print CSS
    • Screen CSS
  • Include attachments
Searching in
About 3 results
  • https://math.libretexts.org/Courses/SUNY_Schenectady_County_Community_College/Discrete_Structures/07%3A_Equivalence_Relations/7.02%3A_Equivalence_Relations
    An equivalence relation on a set is a relation with a certain combination of properties that allow us to sort the elements of the set into certain classes. Let A be a nonempty set. A relation ∼ on...An equivalence relation on a set is a relation with a certain combination of properties that allow us to sort the elements of the set into certain classes. Let A be a nonempty set. A relation ∼ on the set A is an equivalence relation provided that ∼ is reflexive, symmetric, and transitive. For a,b∈A , if ∼ is an equivalence relation on A and a ∼ b , we say that a is equivalent to b. In this section, we will focus on the properties that define an equivalence relation.
  • https://math.libretexts.org/Bookshelves/Abstract_and_Geometric_Algebra/Rings_with_Inquiry_(Janssen_and_Lindsey)/01%3A_The_Integers/1.04%3A_The_Integers_modulo__m
    The foundation for our exploration of abstract algebra is nearly complete. We need the basics of one more "number system" in order to appreciate the abstract approach developed in subsequent chapters.
  • https://math.libretexts.org/Bookshelves/Mathematical_Logic_and_Proof/Book%3A_Mathematical_Reasoning__Writing_and_Proof_(Sundstrom)/07%3A_Equivalence_Relations/7.02%3A_Equivalence_Relations
    An equivalence relation on a set is a relation with a certain combination of properties that allow us to sort the elements of the set into certain classes. Let A be a nonempty set. A relation ∼ on...An equivalence relation on a set is a relation with a certain combination of properties that allow us to sort the elements of the set into certain classes. Let A be a nonempty set. A relation ∼ on the set A is an equivalence relation provided that ∼ is reflexive, symmetric, and transitive. For a,b∈A , if ∼ is an equivalence relation on A and a ∼ b , we say that a is equivalent to b. In this section, we will focus on the properties that define an equivalence relation.

Support Center

How can we help?