Search results
Results from the WOW.Com Content Network
The equivalence relations on any set X, when ordered by set inclusion, form a complete lattice, called Con X by convention. The canonical map ker : X^X → Con X, relates the monoid X^X of all functions on X and Con X. ker is surjective but not injective. Less formally, the equivalence relation ker on X, takes each function f : X → X to its ...
An equivalence relation on a set is a binary relation on satisfying the three properties: [1] for all (reflexivity), implies for all (symmetry), if and then for all (transitivity). The equivalence class of an element is defined as [2] The word "class" in the term "equivalence class" may generally be considered as a synonym of "set", although ...
Matrix equivalence is an equivalence relation on the space of rectangular matrices. For two rectangular matrices of the same size, their equivalence can also be characterized by the following conditions. The matrices can be transformed into one another by a combination of elementary row and column operations. Two matrices are equivalent if and ...
Adequate equivalence relation. In algebraic geometry, a branch of mathematics, an adequate equivalence relation is an equivalence relation on algebraic cycles of smooth projective varieties used to obtain a well-working theory of such cycles, and in particular, well-defined intersection products. Pierre Samuel formalized the concept of an ...
Equivalence of categories. In category theory, a branch of abstract mathematics, an equivalence of categories is a relation between two categories that establishes that these categories are "essentially the same". There are numerous examples of categorical equivalences from many areas of mathematics. Establishing an equivalence involves ...
The quotient space is then defined as , the set of all equivalence classes induced by on . Scalar multiplication and addition are defined on the equivalence classes by [2][3] for all , and. . It is not hard to check that these operations are well-defined (i.e. do not depend on the choice of representatives). These operations turn the quotient ...
Then the relation x R y is equivalent with the equality x R = y R. It follows that equality is the finest equivalence relation on any set S in the sense that it is the relation that has the smallest equivalence classes (every class is reduced to a single element). In some contexts, equality is sharply distinguished from equivalence or ...
Matrix congruence is an equivalence relation. Matrix congruence arises when considering the effect of change of basis on the Gram matrix attached to a bilinear form or quadratic form on a finite-dimensional vector space: two matrices are congruent if and only if they represent the same bilinear form with respect to different bases.