Commutative property in the context of Binary operation

In logic, a rule of replacement is a transformation rule that may be applied to only a particular segment of an expression. A logical system may be constructed so that it uses either axioms, rules of inference, or both as transformation rules for logical expressions in the system. Whereas a rule of inference is always applied to a whole logical expression, a rule of replacement may be applied to only a particular segment. Within the context of a logical proof, logically equivalent expressions may replace each other. Rules of replacement are used in propositional logic to manipulate propositions.

Common rules of replacement include de Morgan's laws, commutation, association, distribution, double negation, transposition, material implication, logical equivalence, exportation, and tautology.

In abstract algebra, a cyclic group or monogenous group is a group, denoted C_n (also frequently ${\displaystyle \mathbb {Z} }$_n or Z_n, not to be confused with the commutative ring of p-adic numbers), that is generated by a single element. That is, it is a set of invertible elements with a single associative binary operation, and it contains an element g such that every other element of the group may be obtained by repeatedly applying the group operation to g or its inverse. Each element can be written as an integer power of g in multiplicative notation, or as an integer multiple of g in additive notation. This element g is called a generator of the group.

Every infinite cyclic group is isomorphic to the additive group of Z, the integers. Every finite cyclic group of order n is isomorphic to the additive group of Z/nZ, the integers modulo n. Every cyclic group is an abelian group (meaning that its group operation is commutative), and every finitely generated abelian group is a direct product of cyclic groups.

In mathematics, a noncommutative ring is a ring whose multiplication is not commutative; that is, there exist a and b in the ring such that ab and ba are different. Equivalently, a noncommutative ring is a ring that is not a commutative ring.

Noncommutative algebra is the part of ring theory devoted to study of properties of the noncommutative rings, including the properties that apply also to commutative rings.

The Rubik's Cube group ${\displaystyle (G,\cdot )}$ represents the mathematical structure of the Rubik's Cube mechanical puzzle. Each element of the set ${\displaystyle G}$ corresponds to a cube move, which is the effect of any sequence of rotations of the cube's faces. With this representation, not only can any cube move be represented, but any position of the cube as well, by detailing the cube moves required to rotate the solved cube into that position. Indeed with the solved position as a starting point, there is a one-to-one correspondence between each of the legal positions of the Rubik's Cube and the elements of ${\displaystyle G}$. The group operation ${\displaystyle \cdot }$ is the composition of cube moves, corresponding to the result of performing one cube move after another.

The Rubik's Cube is constructed by labeling each of the 48 non-center facets with the integers 1 to 48. Each configuration of the cube can be represented as a permutation of the labels 1 to 48, depending on the position of each facet. Using this representation, the solved cube is the identity permutation which leaves the cube unchanged, while the twelve cube moves that rotate a layer of the cube 90 degrees are represented by their respective permutations. The Rubik's Cube group is the subgroup of the symmetric group ${\displaystyle S_{48}}$ generated by the six permutations corresponding to the six clockwise cube moves. With this construction, any configuration of the cube reachable through a sequence of cube moves is within the group. Its operation ${\displaystyle \cdot }$ refers to the composition of two permutations; within the cube, this refers to combining two sequences of cube moves together, doing one after the other. The Rubik's Cube group is non-abelian as composition of cube moves is not commutative; doing a sequence of cube moves in a different order can result in a different configuration.

In mathematics, specifically group theory, a nilpotent group G is a group that has an upper central series that terminates with G. Equivalently, it has a central series of finite length or its lower central series terminates with {1}.

Intuitively, a nilpotent group is a group that is "almost abelian". This idea is motivated by the fact that nilpotent groups are solvable, and for finite nilpotent groups, two elements having relatively prime orders must commute. It is also true that finite nilpotent groups are supersolvable. The concept is credited to work in the 1930s by Russian mathematician Sergei Chernikov.

Quantum information is the information of the state of a quantum system. It is the basic entity of study in quantum information science, and can be manipulated using quantum information processing techniques. Quantum information refers to both the technical definition in terms of von Neumann entropy and the general computational term.

It is an interdisciplinary field that involves quantum mechanics, computer science, information theory, philosophy and cryptography among other fields. Its study is also relevant to disciplines such as cognitive science, psychology and neuroscience. Its main focus is in extracting information from matter at the microscopic scale. Observation in science is one of the most important ways of acquiring information and measurement is required in order to quantify the observation, making this crucial to the scientific method. In quantum mechanics, due to the uncertainty principle, non-commuting observables cannot be precisely measured simultaneously, as an eigenstate in one basis is not an eigenstate in the other basis. According to the eigenstate–eigenvalue link, an observable is well-defined (definite) when the state of the system is an eigenstate of the observable. Since any two non-commuting observables are not simultaneously well-defined, a quantum state can never contain definitive information about both non-commuting observables.

In mathematics, equivariance is a form of symmetry for functions from one space with symmetry to another (such as symmetric spaces). A function is said to be an equivariant map when its domain and codomain are acted on by the same symmetry group, and when the function commutes with the action of the group. That is, applying a symmetry transformation and then computing the function produces the same result as computing the function and then applying the transformation.

Equivariant maps generalize the concept of invariants, functions whose value is unchanged by a symmetry transformation of their argument. The value of an equivariant map is often (imprecisely) called an invariant.