Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Group Theory

107 missions · 76 completed

Missions

Open31Completed76All107
🏆Completed
Algebraic Topology·Captain: LG

Tarcha: Braid Theory and the Artin Presentation with Explicit Half-Twist GeneratorsTextbook

A braid on nnn strands is the everyday object it sounds like: nnn strings hanging between two horizontal plates, each string descending monotonically, no two strings meeting. Emil Artin turned this picture into algebra in 1925 by showing that braids form a group under concatenation and that this group has a finite presentation with n−1n-1n−1 generators. The braid…

64 thms11 active usersReviewed
🏆Completed
Algebraic Topology·Captain: LG

Braids, Links and Mapping Class Groups I: Artin's Presentation of the Braid GroupTextbook

The braid group is one of the places where group theory, low-dimensional topology and knot theory meet. Artin introduced it in 1925 (E. Artin, Theorie der Zöpfe, Abh. Math. Sem. Univ. Hamburg 4 (1925), 47–72) and returned to it in 1947; since then it has become standard equipment in the study of links (closed braids and Markov's theorem), of mapping class…

57 thms8 active usersReviewed
🏆Completed
CombinatoricsNumber Theory·Captain: mikedeng1

New Proofs of Plünnecke-type Estimates for Product Sets in Groups 1: In an Abelian Group, |A + B| ≤ α|A| Gives One Nonempty X ⊆ A with |X + hB| ≤ αʰ|X| for Every hResearch Paper

A basic question of additive combinatorics asks how a set grows under repeated addition. If a finite set AAA in an abelian group satisfies ∣A+B∣≤α∣A∣|A + B| \le \alpha |A|∣A+B∣≤α∣A∣ for some finite set BBB, how large can the iterated sumsets hB=B+⋯+BhB = B + \cdots + BhB=B+⋯+B be? Plünnecke's inequality gives the answer used throughout the subject: some nonempty part of AAA grows by at most a…

4 thms5 active usersReviewed
🏆Completed
AlgebraCategory Theory·Captain: mikedeng1

Strict 2-Groups are Crossed Modules: The 2-Categories of Strict 2-Groups and of Crossed Modules Are 2-EquivalentResearch Paper

A 2-group is a categorified group: a monoidal category in which every object and every morphism is invertible. When the associativity and unit laws hold as equalities rather than up to isomorphism, the 2-group is called strict. Strict 2-groups appear as the fundamental 2-groups of homotopy 2-types, as symmetry objects of gauge theories with higher form…

20 thms4 active usersReviewed
🏆Completed
Quantum InformationTheoretical Computer Science·Captain: mikedeng1

The Solovay-Kitaev algorithm: every gate in SU(d) is ε-approximated by a sequence of O(log^{ln 5/ln(3/2)}(1/ε)) gates from any instruction setResearch Paper

A quantum computer executes a fixed, finite instruction set of gates, while quantum algorithms are written with arbitrary gates. Every algorithm must therefore be compiled: each gate UUU is replaced by a sequence of available instructions whose product approximates UUU. If an accuracy δ\deltaδ required sequences of length O(1/δ)O(1/\delta)O(1/δ), compiling an mmm-gate…

14 thms4 active usersReviewed
🏆Completed
Machine LearningRepresentation Theory·Captain: mikedeng1

Geometric Deep Learning I: A Linear G-Invariant Function of a Signal Depends on It Only Through the Group Average Ax = (1/μ(G)) ∫ g.x dμ(g)Textbook

Geometric deep learning is the programme, set out by Bronstein, Bruna, Cohen and Veličković in Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges (arXiv:2104.13478v2, 2021), of deriving neural network architectures from the symmetries of the domain on which the data live. Convolutional networks on images, permutation-invariant networks on…

13 thms4 active users
🏆Completed
AlgebraCategory Theory·Captain: mikedeng1

Crossed Product of Groups. Applications: The Skeleton of the Category E2(H, G) of Crossed Products Is Crossed(H, G) Modulo 2-EquivalenceResearch Paper

The extension problem for groups asks for a description of all groups EEE that contain a given group HHH as a normal subgroup with quotient isomorphic to a given group GGG. Schreier (1926) answered it by showing that every such extension can be rebuilt from HHH, GGG and two maps: a map α:G→Aut(H)\alpha : G \to \mathrm{Aut}(H)α:G→Aut(H) and a map f:G×G→Hf : G \times G \to Hf:G×G→H, subject to two…

11 thms4 active usersReviewed
🏆Completed
CombinatoricsRepresentation Theory·Captain: wurtle

A Cyclic Polytabloid Proof of Saxl's ConjectureResearch Paper

The irreducible complex representations of the symmetric group SnS_nSn​ are the Specht modules SλS^\lambdaSλ, indexed by partitions λ⊢n\lambda\vdash nλ⊢n. How a tensor product Sα⊗SβS^\alpha\otimes S^\betaSα⊗Sβ (with diagonal action) decomposes is recorded by the Kronecker coefficients

45 thms4 active usersReviewed
🏆Completed
CombinatoricsDiscrete Geometry·Captain: mikedeng1

Some Polyhedra Related to Combinatorial Problems IV: In a Group All of Whose Elements Have Order 2, or All Order 3, the Irreducible Solutions of the Group Equation Are Exactly the VerticesResearch Paper

Every pure integer program min⁡{c⋅x:Ax=b, x≥0 integer}\min\{c\cdot x : Ax = b,\ x \ge 0 \text{ integer}\}min{c⋅x:Ax=b, x≥0 integer} can be relaxed, by dropping the nonnegativity of the basic variables of an optimal linear-programming basis, to a problem over a finite Abelian group: find nonnegative integers t(g)t(g)t(g), one for each nonzero group element, with ∑t(g)⋅g=g0\sum t(g)\cdot g = g_0∑t(g)⋅g=g0​. R. E. Gomory's 1969 paper Some…

8 thms4 active usersReviewed
🏆Completed
Dynamical Systems·Captain: LG

Gottschalk's Surjunctivity ConjectureOpen Problem

A cellular automaton over a group GGG with a finite alphabet AAA is a map on configurations x:G→Ax : G \to Ax:G→A that updates every cell by the same finite local rule, read off from a finite neighbourhood of that cell. Cellular automata over Zd\mathbb{Z}^dZd go back to von Neumann and Ulam and are a standard model in symbolic dynamics; replacing Zd\mathbb{Z}^dZd by an arbitrary…

10 thms4 active usersReviewed
🏆Completed
Mathematical Physics·Captain: LG

Siegel's Fields I: SU(2) double cover of SO(3)Textbook

Rotations of three-dimensional space are the most frequently used nontrivial Lie group in physics. Quantum mechanics requires more than the rotation group SO(3)SO(3)SO(3) itself: particles of half-integer spin, such as the electron, transform under a group in which a rotation by 2π2\pi2π acts as −1-1−1. That group is SU(2)SU(2)SU(2), the double covering group of SO(3)SO(3)SO(3). W. Siegel's…

15 thms4 active usersReviewed
🏆Completed
CombinatoricsRepresentation Theory·Captain: mikedeng1

Comparison of Gelfand-Tsetlin Bases for Alternating and Symmetric Groups: The Recursively Defined Vectors u_α Form a Gelfand–Tsetlin Basis of Each Irreducible Representation of A_nResearch Paper

A Gelfand–Tsetlin basis of a representation of the last group in a tower G1⊂G2⊂⋯⊂GnG_1 \subset G_2 \subset \cdots \subset G_nG1​⊂G2​⊂⋯⊂Gn​ is a basis adapted to every restriction at once: each basis vector spans a line that is cut out by the isotypic decompositions at all levels k=1,…,nk = 1, \dots, nk=1,…,n. When every restriction Gk↓Gk−1G_k \downarrow G_{k-1}Gk​↓Gk−1​ is multiplicity-free, these lines are…

10 thms3 active usersReviewed
🏆Completed
AlgebraCategory Theory·Captain: mikedeng1

Categorical Non Abelian Cohomology, and the Schreier Theory of Groupoids: The Weak-Action Cohomology H²(G, AUT(K)) Is in Bijection with the Connected Components of Ext(G, K)Research Paper

The extension problem asks for all ways of building a larger object from a given quotient and a given kernel. For groups, Schreier's theory (1926) describes every extension 1→K→E→G→11\to K\to E\to G\to 11→K→E→G→1 by a factor system: a map G→Aut(K)G\to\mathrm{Aut}(K)G→Aut(K) that is a homomorphism only up to inner automorphisms, together with a correction term σ:G×G→K\sigma : G\times G\to Kσ:G×G→K. When KKK…

7 thms3 active usersReviewed
🏆Completed
CombinatoricsNumber Theory·Captain: LG

Landau's Function: Growth of the Maximal Order of a PermutationResearch Paper

How large can the order of a single permutation of nnn objects be? The answer, Landau's function g(n)g(n)g(n), is a basic invariant of the symmetric group SnS_nSn​: it is the maximum number of times a permutation can be iterated before it returns to the identity. Because the order of a permutation is the least common multiple of its cycle lengths, g(n)g(n)g(n) is also the largest…

13 thms3 active usersReviewed
🏆Completed
Combinatorics·Captain: mikedeng1

New Proofs of Plünnecke-type Estimates for Product Sets in Groups 2: If |BB| ≤ α|B| and |BbB| ≤ β|B| for All b ∈ B, Then |Bʰ| ≤ α^(8h−17) β^(h−2) |B| for Every h > 2Research Paper

Plünnecke-type inequalities turn information about a set and one product (or sum) of it into bounds on all of its iterated products. In an abelian group, Plünnecke's theorem (Plünnecke 1970) and its extension by Ruzsa say that ∣A+A∣≤α∣A∣|A + A| \le \alpha|A|∣A+A∣≤α∣A∣ implies ∣hA∣≤αh∣A∣|hA| \le \alpha^h |A|∣hA∣≤αh∣A∣ for every hhh. Such bounds are a basic tool in additive combinatorics, and their…

9 thms3 active usersReviewed
🏆Completed
Combinatorics·Captain: mikedeng1

New Proofs of Plünnecke-type Estimates for Product Sets in Groups 3: If |AB| ≤ α|A|, |AbB| ≤ β|A| for b ∈ B and |A| ≤ γ|B|, Some S ⊆ A Has |SBʰ| ≤ α^(8h−9) β^(h−1) γ^(4h−5) |S| for h > 1Research Paper

Plünnecke–Ruzsa inequalities bound the size of iterated sumsets: if AAA and BBB are finite subsets of an abelian group with ∣A+B∣≤α∣A∣|A+B| \le \alpha|A|∣A+B∣≤α∣A∣, then ∣hB∣≤αh∣A∣|hB| \le \alpha^h|A|∣hB∣≤αh∣A∣ for every hhh, where hB=B+⋯+BhB = B + \dots + BhB=B+⋯+B. They are a basic tool of additive combinatorics, used in Freiman-type structure theorems, sum–product estimates and the study of approximate groups.…

6 thms3 active usersReviewed
🏆Completed
AlgebraTheoretical Computer Science·Captain: mikedeng1

New Techniques for Noninteractive Zero-Knowledge 4: The Decisional-Linear Commitment Is Perfectly Binding and Extractable, with a Perfectly Sound, Witness-Indistinguishable 0/1 ProofResearch Paper

A non-interactive zero-knowledge (NIZK) proof lets a prover convince a verifier that a statement is true by sending a single message, without revealing why it is true. Groth, Ostrovsky and Sahai (J. ACM 59(3), 2012) gave NIZK proofs for Circuit SAT of size O(∣C∣k)O(|C|k)O(∣C∣k) for a circuit CCC and security parameter kkk, the first perfect NIZK arguments for all of NP, and…

13 thms3 active usersReviewed
🏆Completed
Number TheoryTheoretical Computer Science·Captain: mikedeng1

New Techniques for Noninteractive Zero-Knowledge 3: The Subgroup-Decision (BGN) Commitment Is Perfectly Binding and Extractable, with a Perfectly Sound, Witness-Indistinguishable 0/1 ProofResearch Paper

A non-interactive zero-knowledge (NIZK) proof lets a prover convince a verifier that a statement is true by sending a single message, without revealing why it is true. NIZK proofs are a basic building block of public-key cryptography: chosen-ciphertext secure encryption, signature schemes and secure multi-party computation all use them. Groth, Ostrovsky and…

13 thms3 active usersReviewed
🏆Completed
Geometry & Topology·Captain: marwahaha

A torsion-free hyperbolic group that is not residually finiteOpen Problem

Residual finiteness means that finite quotients can distinguish every nonidentity group element. The source asks whether coarse negative curvature forces this separation property even without torsion. The source is OpenAI's September 2026 manuscript.

39 thms3 active usersReviewed
🏆Completed
Algebra·Captain: wurtle

The Kervaire theorem for groupsResearch Paper

Given a group AAA, adjoin one new generator ttt and impose one relation w=1w=1w=1, where www is a word in ttt and elements of AAA. Can the result collapse to the trivial group when AAA is nontrivial? The Kervaire conjecture says no. It arose from Kervaire's 1965 characterization of high-dimensional knot groups, which involves groups normally generated by a single element,…

48 thms3 active usersReviewed
🏆Completed
Combinatorics·Captain: mikedeng1

Applied Combinatorics IX: Pólya's Enumeration TheoremTextbook

Many counting questions ask for the number of objects up to symmetry: necklaces of coloured beads that may be rotated and flipped, musical scales up to transposition, chemical isomers up to the symmetries of a molecule, graphs on nnn vertices up to relabelling. Counting all configurations and dividing by the number of symmetries fails, because some…

5 thms3 active usersReviewed
🏆Completed
CombinatoricsGraph TheoryOperations Research+1·Captain: mikedeng1

λ1, Isoperimetric Inequalities for Graphs, and Superconcentrators 2: Cayley Graphs of Finite Quotients of a Property (T) Group Are Linear EnlargersResearch Paper

An expander is a sparse graph in which every set of vertices has many neighbours outside itself. Expanders are the building blocks of superconcentrators (sparse directed graphs that route any rrr inputs to any rrr outputs along vertex-disjoint paths), of sorting and switching networks, and of many constructions in complexity theory and coding; the survey of…

12 thms3 active usersReviewed
🏆Completed
Captain: dbenbenn

Chou: elementary amenable groupsResearch Paper

Von Neumann introduced amenable groups in 1929 to explain the Hausdorff–Banach–Tarski paradox, and showed that the class AGAGAG of amenable groups contains all finite and all abelian groups and is closed under four processes: (I) subgroups, (II) quotients, (III) extensions and (IV) directed unions. Day named the smallest class with these properties EGEGEG, the eleme…

64 thms3 active usersReviewed
🏆Completed
Dynamical Systems·Captain: dbenbenn

Cannon–Floyd–Parry: Thompson's group F and the simplicity of its commutator subgroupTextbook

This mission formalizes §4 of Cannon, Floyd and Parry's Introductory notes on Richard Thompson's groups, together with the definition of Thompson's group FFF from their §1. The goal is their Theorem 4.5: the commutator subgroup [F,F][F,F][F,F] is simple.

34 thms3 active usersReviewed
🏆Completed
Graph TheoryMachine Learning·Captain: mikedeng1

Geometric Deep Learning VII: The E(3)-Equivariant Message-Passing Layer Leaves Node Features Invariant and Moves Coordinates with Every Rigid MotionTextbook

Many graphs that graph neural networks (GNNs) are applied to are embedded in space. In a molecular graph the nodes are atoms, and each atom carries both chemical information (its type) and its three-dimensional position. A prediction about the molecule (an energy, a binding affinity) must not depend on where the molecule sits or how it is oriented, and a…

7 thms2 active usersReviewed
PreviousPage 1 of 4Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me