# GetWiki

*equivalence class*

ARTICLE SUBJECTS

being →

database →

ethics →

fiction →

history →

internet →

language →

linux →

logic →

method →

news →

policy →

purpose →

religion →

science →

software →

truth →

unix →

wiki →

ARTICLE TYPES

essay →

feed →

help →

system →

wiki →

ARTICLE ORIGINS

critical →

forked →

imported →

original →

equivalence class

[ temporary import ]

**please note:**

- the content below is remote from Wikipedia

- it has been imported raw for GetWiki

*S*}} have a notion of equivalence (formalized as an equivalence relation) defined on them, then one may naturally split the set {{math|

*S*}} into

**equivalence classes**. These equivalence classes are constructed so that elements {{math|

*a*}} and {{math|

*b*}} belong to the same

**equivalence class**if and only if they are equivalent.Formally, given a set {{math|

*S*}} and an equivalence relation {{math|~}} on {{math|

*S*}}, the

*equivalence class*of an element {{math|

*a*}} in {{math|

*S*}} is the set

{ x in S mid x sim a }

of elements which are equivalent to {{math|*a*}}. It may be proven from the defining properties of equivalence relations that the equivalence classes form a partition of {{math|

*S*}}. This partition â€“ the set of equivalence classes â€“ is sometimes called the

**quotient set**or the

**quotient space**of {{math|

*S*}} by {{math|~}} and is denoted by {{math|

*S*/ ~}}.When the set {{math|

*S*}} has some structure (such as a group operation or a topology) and the equivalence relation {{math|~}} is compatible with this structure, the quotient set often inherits a similar structure from its parent set. Examples include quotient spaces in linear algebra, quotient spaces in topology, quotient groups, homogeneous spaces, quotient rings, quotient monoids, and quotient categories.

## Examples

- If {{mvar|X}} is the set of all cars, and {{math|~}} is the equivalence relation "has the same color as", then one particular equivalence class consists of all green cars. {{math|
*X*/~}} could be naturally identified with the set of all car colors. - Let {{mvar|X}} be the set of all rectangles in a plane, and {{math|~}} the equivalence relation "has the same area as". For each positive real number
*A*there will be an equivalence class of all the rectangles that have area*A*.{{harvnb|Avelsgaard|1989|loc=p. 127}} - Consider the modulo 2 equivalence relation on the set {{math|
**Z**}} of integers: {{math|*x*~*y*}} if and only if their difference {{math|*x*−*y*}} is an even number. This relation gives rise to exactly two equivalence classes: one class consisting of all even numbers, and the other consisting of all odd numbers. Under this relation {{math|[7]}}, {{math|[9]}}, and {{math|[1]}} all represent the same element of {{math|**Z**/~}}.{{harvnb|Devlin|2004|loc=p. 123}} - Let {{mvar|X}} be the set of ordered pairs of integers {{math|(
*a*,*b*)}} with {{mvar|b}} not zero, and define an equivalence relation {{math|~}} on {{mvar|X}} according to which {{math|(*a*,*b*) ~ (*c*,*d*)}} if and only if {{math|1=*ad*=*bc*}}. Then the equivalence class of the pair {{math|(*a*,*b*)}} can be identified with the rational number {{math|*a*/*b*}}, and this equivalence relation and its equivalence classes can be used to give a formal definition of the set of rational numbers.{{harvnb|Maddox|2002|loc=pp. 77â€“78}} The same construction can be generalized to the field of fractions of any integral domain. - If {{mvar|X}} consists of all the lines in, say the Euclidean plane, and
*L*~*M*means that*L*and*M*are parallel lines, then the set of lines that are parallel to each other form an equivalence class as long as a line is considered parallel to itself. In this situation, each equivalence class determines a point at infinity.

## Notation and formal definition

An equivalence relation on a set {{mvar|X}} is a binary relation {{math|~}} on {{mvar|X}} satisfying the three properties:{{harvnb|Devlin|2004|loc=p. 122}}- {{math|
*a*~*a*}} for all {{mvar|a}} in {{mvar|X}} (reflexivity), - {{math|
*a*~*b*}} implies {{math|*b*~*a*}} for all {{mvar|a}} and {{mvar|b}} in {{mvar|X}} (symmetry), - if {{math|
*a*~*b*}} and {{math|*b*~*c*}} then {{math|*a*~*c*}} for all {{mvar|a}}, {{mvar|b}}, and {{mvar|c}} in {{mvar|X}} (transitivity).

*a*]}} or {{math|[

*a*]~}}, and is defined as the set { x in X mid a sim x } of elements that are related to {{mvar|a}} by {{math|~}}. The word "class" in the term "equivalence class" does not refer to classes as defined in set theory, however equivalence classes do often turn out to be proper classes.The set of all equivalence classes in {{mvar|X}} with respect to an equivalence relation {{math|

*R*}} is denoted as {{math|

*X*/

*R*}} and called {{mvar|X}}

**modulo**{{mvar|R}} (or the

**quotient set**of {{mvar|X}} by {{math|

*R*}}).{{harvnb|Wolf|1998|loc=p. 178}} The surjective map xmapsto [x] from {{mvar|X}} onto {{math|

*X*/

*R*}}, which maps each element to its equivalence class, is called the

**canonical surjection**or the

**canonical projection map**.When an element is chosen (often implicitly) in each equivalence class, this defines an injective map called a

*section*. If this section is denoted by {{math|

*s*}}, one has {{math|1= [

*s*(

*c*)] =

*c*}} for every equivalence class {{math|

*c*}}. The element {{math|

*s*(

*c*)}} is called a

**representative**of {{math|

*c*}}. Any element of a class may be chosen as a representative of the class, by choosing the section appropriately.Sometimes, there is a section that is more "natural" than the other ones. In this case, the representatives are called

*canonical representatives*. For example, in modular arithmetic, consider the equivalence relation on the integers defined by {{math|

*a*~

*b*}} if {{math|

*a*âˆ’

*b*}} is a multiple of a given positive integer {{math|

*n*}}, called the

*modulus*. Each class contains a unique non-negative integer smaller than {{math|

*n*}}, and these integers are the canonical representatives. The class and its representative are more or less identified, as is witnessed by the fact that the notation {{math|

*a*mod

*n*}} may denote either the class or its canonical representative (which is the remainder of the division of {{math|

*a*}} by {{math|

*n*}}).

## Properties

Every element {{mvar|x}} of {{mvar|X}} is a member of the equivalence class {{math|[*x*]}}. Every two equivalence classes {{math|[

*x*]}} and {{math|[

*y*]}} are either equal or disjoint. Therefore, the set of all equivalence classes of {{mvar|X}} forms a partition of {{mvar|X}}: every element of {{mvar|X}} belongs to one and only one equivalence class.{{harvnb|Maddox|2002|loc=p. 74, Thm. 2.5.15}} Conversely every partition of {{mvar|X}} comes from an equivalence relation in this way, according to which {{math|

*x*~

*y*}} if and only if {{mvar|x}} and {{mvar|y}} belong to the same set of the partition.{{harvnb|Avelsgaard|1989|loc=p. 132, Thm. 3.16}}It follows from the properties of an equivalence relation that

{{math|

*x*~*y*}} if and only if {{math|1=[*x*] = [*y*]}}.*X*}}, and {{mvar|x}} and {{mvar|y}} are two elements of {{mvar|X}}, then these statements are equivalent:

- x sim y
- [x] = [y]
- [x] cap [y] ne emptyset.

## Graphical representation

(File:Equivalentie.svg|thumb|160px|Graph of an example equivalence with 7 classes)An undirected graph may be associated to any symmetric relation on a set {{math|*X*}}, where the vertices are the elements of {{math|

*X*}}, and two vertices {{mvar|s}} and {{mvar|t}} are joined if and only if {{math|

*s*~

*t*}}. Among these graphs are the graphs of equivalence relations; they are characterized as the graphs such that the connected components are cliques.{{harvnb|Devlin|2004|loc=p. 123}}

## Invariants

If {{math|~}} is an equivalence relation on {{mvar|X}}, and {{math|*P*(

*x*)}} is a property of elements of {{mvar|X}} such that whenever {{math|

*x*~

*y*}}, {{math|

*P*(

*x*)}} is true if {{math|

*P*(

*y*)}} is true, then the property {{mvar|P}} is said to be an invariant of {{math|~}}, or well-defined under the relation {{math|~}}.A frequent particular case occurs when {{mvar|f}} is a function from {{mvar|X}} to another set {{mvar|Y}}; if {{math|1=

*f*(

*x*1) =

*f*(

*x*2)}} whenever {{math|

*x*1 ~

*x*2}}, then {{mvar|f}} is said to be

*class invariant under*{{math|~}}, or simply

*invariant under*{{math|~}}. This occurs, e.g. in the character theory of finite groups. Some authors use "compatible with {{math|~}}" or just "respects {{math|~}}" instead of "invariant under {{math|~}}".Any function {{math|

*f*:

*X*â†’

*Y*}} itself defines an equivalence relation on {{mvar|X}} according to which {{math|

*x*1 ~

*x*2}} if and only if {{math|1=

*f*(

*x*1) =

*f*(

*x*2)}}. The equivalence class of {{mvar|x}} is the set of all elements in {{mvar|X}} which get mapped to {{math|

*f*(

*x*)}}, i.e. the class {{math|[

*x*]}} is the inverse image of {{math|

*f*(

*x*)}}. This equivalence relation is known as the kernel of {{mvar|f}}.More generally, a function may map equivalent arguments (under an equivalence relation {{math|~

*X*}} on {{mvar|X}}) to equivalent values (under an equivalence relation {{math|~

*Y*}} on {{mvar|Y}}). Such a function is a morphism of sets equipped with an equivalence relation.

## Quotient space in topology

In topology, a quotient space is a topological space formed on the set of equivalence classes of an equivalence relation on a topological space using the original space's topology to create the topology on the set of equivalence classes.In abstract algebra, congruence relations on the underlying set of an algebra allow the algebra to induce an algebra on the equivalence classes of the relation, called a quotient algebra. In linear algebra, a quotient space is a vector space formed by taking a quotient group where the quotient homomorphism is a linear map. By extension, in abstract algebra, the term quotient space may be used for quotient modules, quotient rings, quotient groups, or any quotient algebra. However, the use of the term for the more general cases can as often be by analogy with the orbits of a group action.The orbits of a group action on a set may be called the quotient space of the action on the set, particularly when the orbits of the group action are the right cosets of a subgroup of a group, which arise from the action of the subgroup on the group by left translations, or respectively the left cosets as orbits under right translation.A normal subgroup of a topological group, acting on the group by translation action, is a quotient space in the senses of topology, abstract algebra, and group actions simultaneously.Although the term can be used for any equivalence relation's set of equivalence classes, possibly with further structure, the intent of using the term is generally to compare that type of equivalence relation on a set {{math|*X*}} either to an equivalence relation that induces some structure on the set of equivalence classes from a structure of the same kind on {{math|

*X*}}, or to the orbits of a group action. Both the sense of a structure preserved by an equivalence relation and the study of invariants under group actions lead to the definition of invariants of equivalence relations given above.

## See also

- Equivalence partitioning, a method for devising test sets in software testing based on dividing the possible program inputs into equivalence classes according to the behavior of the program on those inputs
- Homogeneous space, the quotient space of Lie groups
- Transversal (combinatorics)

## Notes

{{reflist|30em}}## References

- {{citation|first=Carol|last=Avelsgaard|title=Foundations for Advanced Mathematics|publisher=Scott Foresman|year=1989|isbn=0-673-38152-8}}
- {{citation|last=Devlin|first=Keith|title=Sets, Functions, and Logic: An Introduction to Abstract Mathematics|year=2004|publisher=Chapman & Hall/ CRC Press|edition=3rd|isbn=978-1-58488-449-1}}
- {{citation|last=Maddox|first=Randall B.|title=Mathematical Thinking and Writing|year=2002|publisher=Harcourt/ Academic Press|isbn=0-12-464976-9}}
- {{citation|last=Morash|first=Ronald P.|title=Bridge to Abstract Mathematics|publisher=Random House|year=1987|isbn=0-394-35429-X}}
- {{citation|last=Wolf|first=Robert S.|title=Proof, Logic and Conjecture: A Mathematician's Toolbox|year=1998|publisher=Freeman|isbn=978-0-7167-3050-7}}

## Further reading

This material is basic and can be found in any text dealing with the fundamentals of proof technique, such as any of the following:- {{citation|last=Sundstrom|title=Mathematical Reasoning: Writing and Proof|year=2003|publisher=Prentice-Hall}}
- {{citation|last1=Smith|last2=Eggen|last3=St.Andre|title=A Transition to Advanced Mathematics (6th Ed.)|year=2006|publisher=Thomson (Brooks/Cole)}}
- {{citation|last=Schumacher|first=Carol|title=Chapter Zero: Fundamental Notions of Abstract Mathematics|year=1996|publisher=Addison-Wesley|isbn=0-201-82653-4}}
- {{citation|last=O'Leary|title=The Structure of Proof: With Logic and Set Theory|year=2003|publisher=Prentice-Hall}}
- {{citation|last=Lay|title=Analysis with an introduction to proof|year=2001|publisher=Prentice Hall}}
- {{citation|last1=Gilbert|last2=Vanstone|title=An Introduction to Mathematical Thinking|year=2005|publisher=Pearson Prentice-Hall}}
- {{citation|last1=Fletcher|last2=Patty|title=Foundations of Higher Mathematics|publisher=PWS-Kent}}
- {{citation|last1=Iglewicz|last2=Stoyle|title=An Introduction to Mathematical Reasoning|publisher=MacMillan}}
- {{citation|last1=D'Angelo|last2=West|title=Mathematical Thinking: Problem Solving and Proofs|year=2000|publisher=Prentice Hall}}
- {{citation|last=Cupillari|title=The Nuts and Bolts of Proofs|publisher=Wadsworth}}
- {{citation|last=Bond|title=Introduction to Abstract Mathematics|publisher=Brooks/Cole}}
- {{citation|last1=Barnier|last2=Feldman|title=Introduction to Advanced Mathematics|year=2000|publisher=Prentice Hall}}
- {{citation|last=Ash|title=A Primer of Abstract Mathematics|publisher=MAA}}

## External links

**- content above as imported from Wikipedia**

- "

- time: 4:44am EDT - Mon, Sep 16 2019

- "

__equivalence class__" does not exist on GetWiki (yet)- time: 4:44am EDT - Mon, Sep 16 2019

[ this remote article is provided by Wikipedia ]

LATEST EDITS [ see all ]

GETWIKI 09 JUL 2019

GETWIKI 09 MAY 2016

GETWIKI 18 OCT 2015

GETWIKI 20 AUG 2014

GETWIKI 19 AUG 2014

© 2019 M.R.M. PARROTT | ALL RIGHTS RESERVED