DeepAI AI Chat
Log In Sign Up

A Formalization of Finite Group Theory

by   David M. Russinoff, et al.

Previous formulations of group theory in ACL2 and Nqthm, based on either "encapsulate" or "defn-sk", have been limited by their failure to provide a path to proof by induction on the order of a group, which is required for most interesting results in this domain beyond Lagrange's Theorem (asserting the divisibility of the order of a group by that of a subgroup). We describe an alternative approach to finite group theory that remedies this deficiency, based on an explicit representation of a group as an operation table. We define a "defgroup" macro for generating parametrized families of groups, which we apply to the additive and multiplicative groups of integers modulo n, the symmetric groups, arbitrary quotient groups, and cyclic subgroups. In addition to a proof of Lagrange's Theorem, we present an inductive proof of the abelian case of a theorem of Cauchy: If the order of a group G is divisible by a prime p, then G has an element of order p.


page 1

page 2

page 3

page 4


Higher Groups in Homotopy Type Theory

We present a development of the theory of higher groups, including infin...

Frobenius Groups with Perfect Order Classes

The purpose of this paper is to investigate the finite Frobenius groups ...

Revisiting the generalized Łoś-Tarski theorem

We present a new proof of the generalized Łoś-Tarski theorem (GLT(k)) in...

Testability in group theory

This paper is a journal counterpart to our FOCS 2021 paper, in which we ...

Fixpoint Theory – Upside Down

Knaster-Tarski's theorem, characterising the greatest fixpoint of a mono...

Mixing of 3-term progressions in Quasirandom Groups

In this note, we show the mixing of three-term progressions (x, xg, xg^2...

Homomorphic encoders of profinite abelian groups II

Let {G_i :i∈} be a family of finite Abelian groups. We say that a subgro...