Preprint Article Version 3 Preserved in Portico This version is not peer-reviewed

Canonical Description of Group Theory: A Linear Order on All Finite Groups

Version 1 : Received: 6 June 2020 / Approved: 7 June 2020 / Online: 7 June 2020 (15:18:59 CEST)
Version 2 : Received: 17 June 2020 / Approved: 18 June 2020 / Online: 18 June 2020 (05:09:36 CEST)
Version 3 : Received: 4 July 2020 / Approved: 5 July 2020 / Online: 5 July 2020 (05:08:00 CEST)

How to cite: Ramirez, J.P. Canonical Description of Group Theory: A Linear Order on All Finite Groups. Preprints 2020, 2020060098 (doi: 10.20944/preprints202006.0098.v3). Ramirez, J.P. Canonical Description of Group Theory: A Linear Order on All Finite Groups. Preprints 2020, 2020060098 (doi: 10.20944/preprints202006.0098.v3).

Abstract

We provide an axiomatic base for the set of natural numbers, that has been proposed as a canonical construction, and use this definition of $\mathbb N$ to find several results on finite group theory. Every finite group $G$, is well represented with a natural number $N_G$; if $N_G=N_H$ then $H,G$ are in the same isomorphism class. We have a linear order, on the quotient space of isomorphism classes of finite groups, that is well behaved with respect to cardinality. If $H,G$ are two finite groups such that $|H|=m<n=|G|$, then $H<\mathbb Z_n\leq G\leq\mathbb Z_{p_1}^{n_1}\oplus\mathbb Z_{p_2}^{n_2}\oplus\cdots\oplus\mathbb Z_{p_k}^{n_k}$ where $n=p_1^{n_1}p_2^{n_2}\cdots p_{k}^{n_k}$ is the prime factorization of $n$. We find a canonical order for the objects of $G$ and define equivalent objects of $G$, thus finding the automorphisms of $G$. The Cayley table of $G$ takes canonical block form, and we are provided with a minimal set of independent equations that define the group. We show how to find all groups of order $n$, and order them. We give examples using all groups with order smaller than $10$, and we find the canonical block form of the symmetry group $\Delta_4$. In the next section, we extend our results to the infinite case, which defines a real number as an infinite set of natural numbers. A real function is a set of real numbers, and a sequence of real functions $f_1,f_2,\ldots$ is well represented by a set of real numbers, as well. In general, we represent mathematical objects using the smallest possible data-type. In the last section, mathematical objects are well assigned to tree structures. We conclude with brief comments on type theory and future work on computational aspects of these representations.

Supplementary and Associated Material

https://arxiv.org/abs/1509.03649: Supplementary Material

Subject Areas

Finite Group; Finite Permutation; Set Theory; Mathematical Structuralism; Type Theory; Tree; Data Type; Benacerraf's Identification Problem

Comments (1)

Comment 1
Received: 5 July 2020
Commenter: Juan Ramirez
Commenter's Conflict of Interests: Author
Comment: The last part of the first section has been carefully re written to incorporate the definition of Module. Corrections in the style were made in the second and third sections, along with minor "writing corrections". The abstract, introduction and conclusions have also been updated.
+ Respond to this comment

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 1
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.