equivalence relation

Uses your system voice; voice and rate in settings.

Q130998Snapshot

≈ 6 min read

Names in other languages

  • pmsrelassion d'equivalensa
  • Polskirelacja równoważności
  • Englishequivalence relation
  • 中文等价关系
  • 简体中文等价关系
  • 繁體中文等價關係
  • 中文等價關係
  • 中文等价关系
  • 中文等價關係

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

equivalence relations on a 5-element set depicted as 5 \times 5 logical matrices (colored fields, including those in light gray, stand for ones; white fields for zeros). The row and column indices of nonwhite cells are the related elements, while the different colors, other than light gray, indicate the equivalence classes (each light gray cell is its own equivalence class). In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric, and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. A simpler example is numerical equality. Any number a is equal to itself (reflexive). If a = b , then b = a (symmetric). If a = b and b = c , then a = c (transitive). Each equivalence relation provides a partition of the underlying set into disjoint equivalence classes. Two elements of the given set are equivalent to each other if and only if they belong to the same equivalence class.

equivalence relations on a 5-element set depicted as 5 \times 5 logical matrices (colored fields, including those in light gray, stand for ones; white fields for zeros). The row and column indices of nonwhite cells are the related elements, while the different colors, other than light gray, indicate the equivalence classes (each light gray cell is its own equivalence class). In mathematics, an equivalence relation is a binary relation that is reflexive, symmetric, and transitive. The equipollence relation between line segments in geometry is a common example of an equivalence relation. A simpler example is numerical equality. Any number a is equal to itself (reflexive). If a = b , then b = a (symmetric). If a = b and b = c , then a = c (transitive). Each equivalence relation provides a partition of the underlying set into disjoint equivalence classes. Two elements of the given set are equivalent to each other if and only if they belong to the same equivalence class. X together with the relation \,\sim\, is called a setoid. The equivalence class of a under \,\sim, denoted [a], is defined as [a] = \{x \in X : x \sim a\}. R=R^{-1} (symmetry). RR\subseteq R (transitivity). On the set X = \{a, b, c\} , the relation R = \{(a, a), (b, b), (c, c), (b, c), (c, b)\} is an equivalence relation. The following sets are equivalence classes of this relation: [a] = \{a\}, ~~~~ [b] = [c] = \{b, c\}. The set of all equivalence classes for R is \{\{a\}, \{b, c\}\}. This set is a partition of the set X . It is also called the quotient set of X by R . A frequent particular case occurs when f is a function from X to another set Y; if x_1 \sim x_2 implies f\left(x_1\right) = f\left(x_2\right) then f is said to be a for \,\sim, a \,\sim, or simply \,\sim. This occurs, e.g. in the character theory of finite groups. The latter case with the function f can be expressed by a commutative triangle. See also invariant. Some authors use "compatible with \,\sim " or just "respects \,\sim " instead of "invariant under \,\sim ". More generally, a function may map equivalent arguments (under an equivalence relation \,\sim_A ) to equivalent values (under an equivalence relation \,\sim_B ). Such a function is known as a morphism from \,\sim_A to \,\sim_B. A subset Y of X such that a \sim b holds for all a and b in Y , and never for a in Y and b outside Y , is called an equivalence class of X by \sim . Let [a] := \{x \in X : a \sim x\} denote the equivalence class to which a belongs. All elements of X equivalent to each other are also elements of the same equivalence class. The set of all equivalence classes of X by \sim, denoted X / \mathord{\sim} := \{[x] : x \in X\}, is the quotient set of X by \sim. If X is a topological space, there is a natural way of transforming X / \sim into a topological space; see Quotient space for the details. The projection of \,\sim\, is the function \pi : X \to X/\mathord{\sim} defined by \pi(x) = [x] which maps elements of X into their respective equivalence classes by \,\sim. Theorem on projections: Let the function f : X \to B be such that if a \sim b then f(a) = f(b). Then there is a unique function g : X / \sim \to B such that f = g \pi. If f is a surjection and a \sim b \text{ if and only if } f(a) = f(b), then g is a bijection. The equivalence kernel of a function f is the equivalence relation ~ defined by x \sim y \text{ if and only if } f(x) = f(y). The equivalence kernel of an injection is the identity relation. B_n = \frac{1}{e} \sum_{k=0}^\infty \frac{k^n}{k!} \quad (Dobinski's formula). a \sim b if there exists a natural number n and elements x_0, \ldots, x_n \in X such that a = x_0 , b = x_n , and x_{i-1} \mathrel{R} x_i or x_i \mathrel{R} x_{i-1} , for i = 1, \ldots, n. The equivalence relation generated in this manner can be trivial. For instance, the equivalence relation generated by any total order on X has exactly one equivalence class, X itself. Equivalence relations can construct new spaces by "gluing things together." Let X be the unit Cartesian square [0, 1] \times [0, 1], and let ~ be the equivalence relation on X defined by (a, 0) \sim (a, 1) for all a \in [0, 1] and (0, b) \sim (1, b) for all b \in [0, 1], Then the quotient space X / \sim can be naturally identified (homeomorphism) with a torus: take a square piece of paper, bend and glue together the upper and lower edge to form a cylinder, then bend the resulting cylinder so as to glue together its two open ends, resulting in a torus.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1364233757 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot equivalence-relation-015735-3a915bb5b9d8c2dc · hash 3a915bb5b9d8c2dcf1ba60310e8a43351f2af5edf94c4c463b2a01c949b7fc2a · captured 1784101082.0 · version history

Cite this page as: encyclopegia.org, “equivalence relation”, snapshot equivalence-relation-015735-3a915bb5b9d8c2dc. https://encyclopegia.org/a/equivalence-relation

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.