Difference between revisions of "Directory talk:Jon Awbrey/Papers/Inquiry Driven Systems : Part 6"
MyWikiBiz, Author Your Legacy — Saturday November 30, 2024
Jump to navigationJump to searchJon Awbrey (talk | contribs) |
Jon Awbrey (talk | contribs) |
||
| Line 13: | Line 13: | ||
: The <math>n^\text{th}\!</math> '''multiple''' of an element <math>x\!</math> in a semigroup <math>\underline{X} = (X, +, 0),\!</math> for integer <math>n > 0,\!</math> is notated as <math>nx\!</math> and defined as follows. Proceeding recursively, for <math>n = 1,\!</math> let <math>1x = x,\!</math> and for <math>n > 1,\!</math> let <math>nx = (n-1)x + x.\!</math> | : The <math>n^\text{th}\!</math> '''multiple''' of an element <math>x\!</math> in a semigroup <math>\underline{X} = (X, +, 0),\!</math> for integer <math>n > 0,\!</math> is notated as <math>nx\!</math> and defined as follows. Proceeding recursively, for <math>n = 1,\!</math> let <math>1x = x,\!</math> and for <math>n > 1,\!</math> let <math>nx = (n-1)x + x.\!</math> | ||
| − | : | + | : <math>n^\text{th}\!</math> '''multiple''' of <math>x\!</math> in a monoid <math>\underline{X} = (X, +, 0),\!</math> for integer <math>n \ge 0,\!</math> is defined the same way for <math>n > 0,\!</math> letting <math>0x = 0\!</math> when <math>n = 0.\!</math> |
| − | : | + | : <math>n^\text{th}\!</math> '''multiple''' of <math>x\!</math> in a group <math>\underline{X} = (X, +, 0),\!</math> for any integer <math>n,\!</math> is defined the same way for <math>n \ge 0,\!</math> letting <math>nx = (-n)(-x)\!</math> for <math>n < 0.\!</math> |
| − | : A group X = | + | : A group <math>\underline{X} = (X, +, 0)\!</math> is '''cyclic''' if and only if there is an element <math>g \in X\!</math> such that every <math>x \in X\!</math> can be written as <math>x = ng\!</math> for some <math>n \in \mathbb{Z}.\!</math> In this case, an element such as <math>g\!</math> is called a '''generator''' of the group. |
====Version 2==== | ====Version 2==== | ||
| Line 23: | Line 23: | ||
: In a semigroup <math>\underline{X} = (X, +, 0),\!</math> the <math>n^\text{th}\!</math> '''multiple''' of an element <math>x\!</math> is notated as <math>nx\!</math> and defined for every positive integer <math>n\!</math> in the following manner. Proceeding recursively, let <math>1x = x\!</math> and let <math>nx = (n-1)x + x\!</math> for all <math>n > 1.\!</math> | : In a semigroup <math>\underline{X} = (X, +, 0),\!</math> the <math>n^\text{th}\!</math> '''multiple''' of an element <math>x\!</math> is notated as <math>nx\!</math> and defined for every positive integer <math>n\!</math> in the following manner. Proceeding recursively, let <math>1x = x\!</math> and let <math>nx = (n-1)x + x\!</math> for all <math>n > 1.\!</math> | ||
| − | : In a monoid <math>\underline{X} = (X, +, 0),\!</math> <math>nx\!</math> is defined for every non-negative integer <math>n\!</math> by letting <math>0x = 0\!</math> and proceeding the same way for <math>n > 0.\!</math> | + | : In a monoid <math>\underline{X} = (X, +, 0),\!</math> the multiple <math>nx\!</math> is defined for every non-negative integer <math>n\!</math> by letting <math>0x = 0\!</math> and proceeding the same way for <math>n > 0.\!</math> |
| − | : In a group <math>\underline{X} = (X, +, 0),\!</math> <math>nx\!</math> is defined for every integer <math>n\!</math> by letting <math>nx = (-n)(-x)\!</math> for <math>n < 0\!</math> and proceeding the same way for <math>n \ge 0.\!</math> | + | : In a group <math>\underline{X} = (X, +, 0),\!</math> the multiple <math>nx\!</math> is defined for every integer <math>n\!</math> by letting <math>nx = (-n)(-x)\!</math> for <math>n < 0\!</math> and proceeding the same way for <math>n \ge 0.\!</math> |
| − | : A group <math>\underline{X} = (X, +, 0) | + | : A group <math>\underline{X} = (X, +, 0)\!</math> is '''cyclic''' if and only if there is an element <math>g \in X\!</math> such that every <math>x \in X\!</math> can be written as <math>x = ng\!</math> for some <math>n \in \mathbb{Z}.\!</math> In this case, an element such as <math>g\!</math> is called a '''generator''' of the group. |
Revision as of 13:45, 20 April 2012
Discussion
Work Area
Alternate Text
A semigroup consists of a nonempty set with an associative LOC on it. On formal occasions, a semigroup is introduced by means a formula like \(X = (X, *),\!\) interpreted to mean that a semigroup \(X\!\) is specified by giving two pieces of data, a nonempty set that conventionally, if somewhat ambiguously, goes under the same name \({}^{\backprime\backprime} X {}^{\prime\prime},\!\) plus an associative binary operation denoted by \({}^{\backprime\backprime} * {}^{\prime\prime}.\!\) In contexts where there is only one semigroup being discussed, or where the additional structure is otherwise understood, it is common practice to call the semigroup by the name of the underlying set. In contexts where more than one semigroup is formed on the same set, one may use notations like \(X_i = (X, *_i)\!\) to distinguish them.
Additive Presentation
Version 1
- The \(n^\text{th}\!\) multiple of an element \(x\!\) in a semigroup \(\underline{X} = (X, +, 0),\!\) for integer \(n > 0,\!\) is notated as \(nx\!\) and defined as follows. Proceeding recursively, for \(n = 1,\!\) let \(1x = x,\!\) and for \(n > 1,\!\) let \(nx = (n-1)x + x.\!\)
\[n^\text{th}\!\] multiple of \(x\!\) in a monoid \(\underline{X} = (X, +, 0),\!\) for integer \(n \ge 0,\!\) is defined the same way for \(n > 0,\!\) letting \(0x = 0\!\) when \(n = 0.\!\)
\[n^\text{th}\!\] multiple of \(x\!\) in a group \(\underline{X} = (X, +, 0),\!\) for any integer \(n,\!\) is defined the same way for \(n \ge 0,\!\) letting \(nx = (-n)(-x)\!\) for \(n < 0.\!\)
- A group \(\underline{X} = (X, +, 0)\!\) is cyclic if and only if there is an element \(g \in X\!\) such that every \(x \in X\!\) can be written as \(x = ng\!\) for some \(n \in \mathbb{Z}.\!\) In this case, an element such as \(g\!\) is called a generator of the group.
Version 2
- In a semigroup \(\underline{X} = (X, +, 0),\!\) the \(n^\text{th}\!\) multiple of an element \(x\!\) is notated as \(nx\!\) and defined for every positive integer \(n\!\) in the following manner. Proceeding recursively, let \(1x = x\!\) and let \(nx = (n-1)x + x\!\) for all \(n > 1.\!\)
- In a monoid \(\underline{X} = (X, +, 0),\!\) the multiple \(nx\!\) is defined for every non-negative integer \(n\!\) by letting \(0x = 0\!\) and proceeding the same way for \(n > 0.\!\)
- In a group \(\underline{X} = (X, +, 0),\!\) the multiple \(nx\!\) is defined for every integer \(n\!\) by letting \(nx = (-n)(-x)\!\) for \(n < 0\!\) and proceeding the same way for \(n \ge 0.\!\)
- A group \(\underline{X} = (X, +, 0)\!\) is cyclic if and only if there is an element \(g \in X\!\) such that every \(x \in X\!\) can be written as \(x = ng\!\) for some \(n \in \mathbb{Z}.\!\) In this case, an element such as \(g\!\) is called a generator of the group.
