A Free Group of Rotations of Rank 2

05/24/2022
by   Jagadish Bapanapally, et al.
0

One of the key steps in the proof of the Banach-Tarski Theorem is the introduction of a free group of rotations. First, a free group of reduced words is generated where each element of the set is represented as an ACL2 list. Then we demonstrate that there is a one-to-one relation between the set of reduced words and a set of 3D rotations. In this paper we present a way to generate this set of reduced words and we prove group properties for this set. Then, we show a way to generate a set of 3D matrices using the set of reduced words. Finally we show a formalization of 3D rotations and prove that every element of the 3D matrices set is a rotation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/15/2021

Solving one variable word equations in the free group in cubic time

A word equation with one variable in a free group is given as U = V, whe...
research
04/25/2018

Nyldon words

The Chen-Fox-Lyndon theorem states that every finite word over a fixed a...
research
06/12/2018

A Timed Version of the Plactic Monoid

Timed words are words where letters of the alphabet come with time stamp...
research
06/18/2020

The Only Undoable CRDTs are Counters

In comparing well-known CRDTs representing sets that can grow and shrink...
research
04/30/2023

Representing the Special Linear Group with Block Unitriangular Matrices

We prove that every element of the special linear group can be represent...
research
12/06/2022

Extending Snow's algorithm for computations in the finite Weyl groups

In 1990, D.Snow proposed an effective algorithm for computing the orbits...
research
12/15/2018

A Note on a Picture-Hanging Puzzle

In the picture-hanging puzzle we are to hang a picture so that the strin...

Please sign up or login with your details

Forgot password? Click here to reset