Difference between revisions of "Noncommutative"
(→Composition of functions) |
|||
(One intermediate revision by one other user not shown) | |||
Line 1: | Line 1: | ||
− | Informally, '''noncommutative''' means | + | Informally, '''noncommutative''' means "order matters". |
− | More formally, if <math> | + | More formally, if <math>\star</math> is some [[binary operation]] on a [[set]], and <math>x</math> and <math>y</math> are elements of that set, then noncommutative means that <math>x \star y</math> doesn't necessarily equal <math>y \star x</math>. |
− | Most common operations, such as addition | + | Most common operations, such as [[addition]] and [[multiplication]] of numbers, are [[commutative]]. For example, <math>4\cdot3=3\cdot4=12</math>, and <math>2+3=3+2=5</math>. |
==Examples of noncommutative operations== | ==Examples of noncommutative operations== | ||
− | |||
===Composition of functions=== | ===Composition of functions=== | ||
+ | If <math>f(x)</math> and <math>g(x)</math> are functions, then usually, <math>(f\circ g)(x)\ne(g\circ f)(x)</math>. This can also be written <math>f(g(x))\ne g(f(x))</math>. | ||
− | + | For example, suppose <math>f(x) = x^2</math> and <math>g(x) = x+1</math>. Then <math>(f \circ g)(x)=f(g(x))=f(x+1)=(x+1)^2=x^2+2x+1</math>, and <math>(g \circ f)(x)=g(f(x))=g(x^2)=x^2+1</math>. Unless <math>x=0</math>, <math>(f\circ g)(x)</math> will not be the same as <math>(g\circ f)(x)</math>. | |
− | |||
− | |||
===Matrix multiplication=== | ===Matrix multiplication=== | ||
+ | If <math>A</math> and <math>B</math> are both <math>n\times n</math> [[matrix|matrices]], then usually, <math>AB\ne BA</math>. For example: | ||
− | + | <math>\begin{pmatrix}1&2\\3&4\end{pmatrix}\begin{pmatrix}5&6\\7&8\end{pmatrix}=\begin{pmatrix}19&22\\43&50\end{pmatrix}</math> | |
− | |||
− | |||
− | \begin{pmatrix}1&2\\3&4\end{pmatrix} | ||
− | \begin{pmatrix}5&6\\7&8\end{pmatrix} = | ||
− | \begin{pmatrix}19&22\\43&50\end{pmatrix} | ||
− | </math> | ||
whereas | whereas | ||
− | <math> | + | <math>\begin{pmatrix}5&6\\7&8\end{pmatrix}\begin{pmatrix}1&2\\3&4\end{pmatrix}=\begin{pmatrix}23&34\\31&46\end{pmatrix}</math> |
− | \begin{pmatrix}5&6\\7&8\end{pmatrix} | ||
− | \begin{pmatrix}1&2\\3&4\end{pmatrix} = | ||
− | \begin{pmatrix}23&34\\31&46\end{pmatrix} | ||
− | </math> | ||
===Symmetries of a regular n-gon=== | ===Symmetries of a regular n-gon=== | ||
+ | The symmetries of a regular n-gon form a noncommutative [[group]] called a [[dihedral group]]. | ||
− | + | [[Category:Definition]] |
Latest revision as of 14:30, 26 December 2017
Informally, noncommutative means "order matters".
More formally, if is some binary operation on a set, and and are elements of that set, then noncommutative means that doesn't necessarily equal .
Most common operations, such as addition and multiplication of numbers, are commutative. For example, , and .
Contents
Examples of noncommutative operations
Composition of functions
If and are functions, then usually, . This can also be written .
For example, suppose and . Then , and . Unless , will not be the same as .
Matrix multiplication
If and are both matrices, then usually, . For example:
whereas
Symmetries of a regular n-gon
The symmetries of a regular n-gon form a noncommutative group called a dihedral group.