SearcharxivSearch

arXiv · 2408.00020

A Group Theory Proof of Pascal's Theorem

Abstract

It will be shown that Pascal's Theorem is equivalent to the associativity of a natural binary operation on conic sections. A novel proof for Pascal's Theorem will then be given by showing that this binary operation is associative independent of Pascal's Theorem. Specifically, this operation is equivalent to either addition of real numbers, multiplication of real numbers, or rotations on the plane depending on the type of the conic. Since each of these is already known to be associative, it will follow that the binary operation is associative and this will prove Pascal's Theorem.

Explore related subjects

Keep this discovery

BibTeXRIS

Kaylee Wiese. 2024-07-30. A Group Theory Proof of Pascal's Theorem. https://arxiv.org/abs/2408.00020

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR