Jump to content

Commutative property

This is a good article. Click here for more information.
From Wikipedia, the free encyclopedia
(Redirected from Commutative law)

Commutative property
TypeProperty
FieldAlgebra
StatementA binary operation is commutative if changing the order of the operands does not change the result.
Symbolic statement

In mathematics, a binary operation is commutative if changing the order of the operands does not change the result. It is a fundamental property of many binary operations, and many mathematical proofs depend on it. Perhaps most familiar as a property of arithmetic, e.g. "3 + 4 = 4 + 3" or "2 × 5 = 5 × 2", the property can also be used in more advanced settings. The name is needed because there are operations, such as division and subtraction, that do not have it (for example, "3 − 5 ≠ 5 − 3"); such operations are not commutative, and so are referred to as noncommutative operations.

The idea that simple operations, such as the multiplication and addition of numbers, are commutative was for many years implicitly assumed. Thus, this property was not named until the 19th century, when mathematics started to become formalized.[1]

Definition

[edit]

A binary operation on a set S is commutative if for all .[2] An operation that is not commutative is said to be noncommutative.

One says that x commutes with y or that x and y commute under if

So, an operation is commutative if every two elements commute. An operation is noncommutative, if there are two elements such that This does not excludes the possibility that some pairs of elements commute.

Examples

[edit]
The cumulation of apples, which can be seen as an addition of natural numbers, is commutative.

Commutative operations

[edit]
The addition of vectors is commutative, because

Noncommutative operations

[edit]

Division, subtraction, and exponentiation

[edit]

Division is noncommutative, since .[6]

Subtraction is noncommutative, since . However it is classified more precisely as anti-commutative, since .[6]

Exponentiation is noncommutative, since .[6] This property leads to two different "inverse" operations of exponentiation (namely, the nth-root operation and the logarithm operation), whereas multiplication only has one inverse operation.[citation needed]

Truth functions

[edit]

Some truth functions are noncommutative, since the truth tables for the functions are different when one changes the order of the operands.[7] For example, the truth tables for (A ⇒ B) = (¬A ∨ B) and (B ⇒ A) = (A ∨ ¬B) are

A B A ⇒ B B ⇒ A
F F T T
F T T F
T F F T
T T T T

Function composition of linear functions

[edit]

Function composition of linear functions from the real numbers to the real numbers is almost always noncommutative.[citation needed] For example, let and . Then and This also applies more generally for linear and affine transformations from a vector space to itself.[citation needed]

Matrix multiplication

[edit]

Matrix multiplication of square matrices is almost always noncommutative, for example:[8]

Vector product

[edit]

The vector product (or cross product) of two vectors in three dimensions is anti-commutative; i.e., .[9]

Set theory

[edit]

In group and set theory, many algebraic structures are called commutative when certain operands satisfy the commutative property. In higher branches of mathematics, such as analysis and linear algebra the commutativity of well-known operations (such as addition and multiplication on real and complex numbers) is often used (or implicitly assumed) in proofs.[10][11][12]

Mathematical structures and commutativity

[edit]

History and etymology

[edit]

Records of the implicit use of the commutative property go back to ancient times. The Egyptians used the commutative property of multiplication to simplify computing products.[15] Euclid is known to have assumed the commutative property of multiplication in his book Elements.[16] Formal uses of the commutative property arose in the late 18th and early 19th centuries when mathematicians began to work on a theory of functions. Nowadays, the commutative property is a well-known and basic property used in most branches of mathematics.[2]

The first known use of the term was in a French Journal published in 1814

The first recorded use of the term commutative was in a memoir by François Servois in 1814, which used the word commutatives when describing functions that have what is now called the commutative property.[17] Commutative is the feminine form of the French adjective commutatif, which is derived from the French noun commutation and the French verb commuter, meaning "to exchange" or "to switch", a cognate of to commute. The term then appeared in English in 1838. in Duncan Gregory's article entitled "On the real nature of symbolical algebra" published in 1840 in the Transactions of the Royal Society of Edinburgh.[18]

Non-commuting operators in quantum mechanics

[edit]

In quantum mechanics as formulated by Schrödinger, physical variables are represented by linear operators such as (meaning multiply by ), and . These two operators do not commute as may be seen by considering the effect of their compositions and (also called products of operators) on a one-dimensional wave function :

According to the uncertainty principle of Heisenberg, if the two operators representing a pair of variables do not commute, then that pair of variables are mutually complementary, which means they cannot be simultaneously measured or known precisely. For example, the position and the linear momentum in the -direction of a particle are represented by the operators and , respectively (where is the reduced Planck constant). This is the same example except for the constant , so again the operators do not commute and the physical meaning is that the position and linear momentum in a given direction are complementary.

See also

[edit]

Notes

[edit]
  1. ^ Rice 2011, p. 4.
  2. ^ a b Saracino 2008, p. 11.
  3. ^ Rosen 2013, See the Appendix I.
  4. ^ Sterling 2009, p. 248.
  5. ^ O'Regan 2008, p. 33.
  6. ^ a b c Posamentier et al. 2013, p. 71.
  7. ^ Medina et al. 2004, p. 617.
  8. ^ Cooke 2014, p. 7.
  9. ^ Haghighi, Kumar & Mishev 2024, p. 118.
  10. ^ Axler 1997, p. 2
  11. ^ a b Gallian 2006, p. 34
  12. ^ Gallian 2006, pp. 26, 87
  13. ^ Gallian 2006, p. 236
  14. ^ Gallian 2006, p. 250
  15. ^ Gay & Shute 1987, p. 16‐17.
  16. ^ Barbeau 1968, p. 183. See Heath 1956, p. 304 at Book VII, Proposition 5.
  17. ^ Allaire & Bradley 2002.
  18. ^ Rice 2011, p. 4; Gregory 1840.

References

[edit]
  • Allaire, Patricia R.; Bradley, Robert E. (2002). "Symbolical Algebra as a Foundation for Calculus: D. F. Gregory's Contribution". Historia Mathematica. 29: 395–426. doi:10.1006/hmat.2002.2358.
  • Axler, Sheldon (1997). Linear Algebra Done Right, 2e. Springer. ISBN 0-387-98258-2.
  • Barbeau, Alice Mae (1968). A Historical Approach to the Theory of Groups. Vol. 2. University of Wisconsin--Madison.
  • Cooke, Richard G. (2014). Infinite Matrices and Sequence Spaces. Dover Publications. ISBN 978-0-486-78083-2.
  • Gallian, Joseph (2006). Contemporary Abstract Algebra (6e ed.). Houghton Mifflin. ISBN 0-618-51471-6.
  • Gay, Robins R.; Shute, Charles C. D. (1987). The Rhind Mathematical Papyrus: An Ancient Egyptian Text. British Museum. ISBN 0-7141-0944-4.
  • Gregory, D. F. (1840). "On the real nature of symbolical algebra". Transactions of the Royal Society of Edinburgh. 14: 208–216.
  • Haghighi, Aliakbar Montazer; Kumar, Abburi Anil; Mishev, Dimitar (2024). Higher Mathematics for Science and Engineering. Springer.
  • Heath, Thomas L. (1956) [1925]. The Thirteen Books of Euclid's Elements. Vol. 2 (2nd ed.). New York: Dover Publications. ISBN 0-486-60088-2. {{cite book}}: ISBN / Date incompatibility (help)
  • Medina, Jesús; Ojeda-Aciego, Manuel; Valverde, Agustín; Vojtáš, Peter (2004). "Towards Biresiduated Multi-adjoint Logic Programming". In Conejo, Ricardo; Urretavizcaya, Maite; Pérez-de-la-Cruz, José-Luis (eds.). Current Topics in Artificial Intelligence: 10th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2003, and 5th Conference on Technology Transfer, TTIA 2003, November 12-14, 2003. San Sebastian, Spain: Springer. doi:10.1007/b98369.
  • O'Regan, Gerard (2008). A brief history of computing. Springer. ISBN 978-1-84800-083-4.
  • Posamentier, Alfred S.; Farber, William; Germain-Williams, Terri L.; Paris, Elaine; Thaller, Bernd; Lehmann, Ingmar (2013). 100 Commonly Asked Questions in Math Class. Corwin Press. ISBN 978-1-4522-4308-5.
  • Rice, Adrian (2011). "Introduction". In Flood, Raymond; Rice, Adrian; Wilson, Robin (eds.). Mathematics in Victorian Britain. Oxford University Press. ISBN 9780191627941.
  • Rosen, Kenneth (2013). Discrete Maths and Its Applications Global Edition. McGraw Hill. ISBN 978-0-07-131501-2.
  • Saracino, Dan (2008). Abstract Algebra: A First Course (2nd ed.). Waveland Press Inc.
  • Sterling, Mary J. (2009). Linear Algebra For Dummies. John & Wiley Sons. ISBN 978-0-470-43090-3.