2024-11-10

863: For Permutations Group, Its Element, Element of Permutations Domain, and Sequence of Power Operations of Element on Domain Element, Another Sequence with Another Domain Element Not Contained in 1st Sequence Is Disjoint from 1st Sequence

<The previous article in this series | The table of contents of this series | The next article in this series>

description/proof of that for permutations group, its element, element of permutations domain, and sequence of power operations of element on domain element, another sequence with another domain element not contained in 1st sequence is disjoint from 1st sequence

Topics


About: group

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that for any permutations group, its any element, any element of the permutations domain, and the sequence of the power operations of the element on the domain element, another sequence with any another domain element not contained in the 1st sequence is disjoint from the 1st sequence.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Structured Description


Here is the rules of Structured Description.

Entities:
\(S\): \(\in \{\text{ the finite sets }\}\), with any linear order
\(G\): \(= \text{ the permutations group of } S\)
\(\sigma\): \(\in G\)
\(p\): \(\in S\)
\((\sigma (p), \sigma^2 (p), ...)\):
\(p'\): \(\in S \setminus \{\sigma (p), \sigma^2 (p), ...\}\)
\((\sigma (p'), \sigma^2 (p'), ...)\):
//

Statements:
\(\{\sigma (p), \sigma^2 (p), ...\} \cap \{\sigma (p'), \sigma^2 (p'), ...\} = \emptyset\)
//


2: Note


There may not be such any \(p'\); in that case, this proposition is vacuously true.


3: Proof


Whole Strategy: Step 1: see that \((\sigma (p'), \sigma^2 (p'), ...)\) inevitably comes to \(p'\) as \(\sigma^n (p')\); Step 2: suppose that \(\sigma^k (p) = \sigma^l (p')\) and find a contradiction.

Step 1:

\((\sigma (p'), \sigma^2 (p'), ...)\) inevitably comes to \(p'\) as \(\sigma^n (p')\), by the proposition that for any permutations group, its any element, and any element of the permutations domain, the sequence of the power operations of the element on the domain element returns back from the domain element.

Step 2:

Let us suppose that there were a \(k \in \mathbb{N}\) such that \(1 \le k\) and a \(l \in \mathbb{N}\) such that \(1 \le l\) such that \(\sigma^k (p) = \sigma^l (p')\). We can suppose that \(l \le n\), because the sequence is cyclic with the order, \(n\).

\(\sigma^{k + n - l} (p) = \sigma^{n - l} (\sigma^k (p)) = \sigma^{n - l} (\sigma^l (p')) = \sigma^n (p') = p'\), a contradiction against \(p'\)'s not in the 1st sequence.

So, the intersection is empty.


References


<The previous article in this series | The table of contents of this series | The next article in this series>