Equivalence relation in the context of "Transitive relation"

Play Trivia Questions online!

or

Skip to study material about Equivalence relation in the context of "Transitive relation"

Ad spacer

⭐ Core Definition: Equivalence relation

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 is equal to itself (reflexive). If , then (symmetric). If and , then (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.

↓ Menu

>>>PUT SHARE BUTTONS HERE<<<

πŸ‘‰ Equivalence relation in the context of Transitive relation

In mathematics, a binary relation R on a set X is transitive if, for all elements a, b, c in X, whenever R relates a to b and b to c, then R also relates a to c.

Every partial order and every equivalence relation is transitive. For example, less than and equality among real numbers are both transitive: If a < b and b < c then a < c; and if x = y and y = z then x = z.

↓ Explore More Topics
In this Dossier

Equivalence relation in the context of Mathematical structure

In mathematics, a structure on a set (or on some sets) refers to providing or endowing it (or them) with certain additional features (e.g. an operation, relation, metric, or topology). Ξ€he additional features are attached or related to the set (or to the sets), so as to provide it (or them) with some additional meaning or significance.

A partial list of possible structures is measures, algebraic structures (groups, fields, etc.), topologies, metric structures (geometries), orders, graphs, events, differential structures, categories, setoids, and equivalence relations.

↑ Return to Menu

Equivalence relation in the context of Reflexive relation

In mathematics, a binary relation on a set is reflexive if it relates every element of to itself.

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. Along with symmetry and transitivity, reflexivity is one of three properties defining equivalence relations.

↑ Return to Menu

Equivalence relation in the context of Partition of a set

In mathematics, a partition of a set is a grouping of its elements into non-empty subsets, in such a way that every element is included in exactly one subset.

Every equivalence relation on a set defines a partition of this set, and every partition defines an equivalence relation. A set equipped with an equivalence relation or a partition is sometimes called a setoid, typically in type theory and proof theory.

↑ Return to Menu

Equivalence relation in the context of Up to

Two mathematical objects a and b are called "equal up to an equivalence relation R"

  • if a and b are related by R, that is,
  • if aRb holds, that is,
  • if the equivalence classes of a and b with respect to R are equal.

This figure of speech is mostly used in connection with expressions derived from equality, such as uniqueness or count.For example, "x is unique up to R" means that all objects x under consideration are in the same equivalence class with respect to the relation R.

↑ Return to Menu

Equivalence relation in the context of Invariant (mathematics)

In mathematics, an invariant is a property of a mathematical object (or a class of mathematical objects) which remains unchanged after operations or transformations of a certain type are applied to the objects. The particular class of objects and type of transformations are usually indicated by the context in which the term is used. For example, the area of a triangle is an invariant with respect to isometries of the Euclidean plane. The phrases "invariant under" and "invariant to" a transformation are both used. More generally, an invariant with respect to an equivalence relation is a property that is constant on each equivalence class.

Invariants are used in diverse areas of mathematics such as geometry, topology, algebra and discrete mathematics. Some important classes of transformations are defined by an invariant they leave unchanged. For example, conformal maps are defined as transformations of the plane that preserve angles. The discovery of invariants is an important step in the process of classifying mathematical objects.

↑ Return to Menu

Equivalence relation in the context of Sides of an equation

In mathematics, LHS is informal shorthand for the left-hand side of an equation. Similarly, RHS is the right-hand side. The two sides have the same value, expressed differently, since equality is symmetric.

More generally, these terms may apply to an inequation or inequality; the right-hand side is everything on the right side of a test operator in an expression, with LHS defined similarly.

↑ Return to Menu

Equivalence relation in the context of Setoid

In mathematics, a setoid (X, ~) is a set (or type) X equipped with an equivalence relation ~. A setoid may also be called E-set, Bishop set, or extensional set.

Setoids are studied especially in proof theory and in type-theoretic foundations of mathematics. Often in mathematics, when one defines an equivalence relation on a set, one immediately forms the quotient set (turning equivalence into equality). In contrast, setoids may be used when a difference between identity and equivalence must be maintained, often with an interpretation of intensional equality (the equality on the original set) and extensional equality (the equivalence relation, or the equality on the quotient set).

↑ Return to Menu