groups — Claude Code skill: abstract algebra group theory
A skill for Claude Code that structures problem-solving in group theory. Activates when the agent needs to verify group axioms, test subgroups, or prove homomorphisms.
MIT ★ 3,951 updated 2026-01-26
npx skills add parcadei/Continuous-Claude-v3 --skill groups -a claude-codeWhat groups does
The groups skill adds a decision-tree workflow to Claude Code for abstract algebra tasks. It runs with Bash and Read tool access, granted at activation.
The tree has four branches: checking the four group axioms (closure, associativity, identity, inverses), the subgroup test via the ab⁻¹ criterion, homomorphism verification, and order analysis using Lagrange's theorem. Formal proofs go through z3_solve.py via uv run python -m runtime.harness; symbolic simplification uses sympy_compute.py. Both scripts come from the parcadei/Continuous-Claude-v3 repository, so uv and Python must be on PATH before the first call.
Full cognitive-tool documentation lives at .claude/skills/math-mode/SKILL.md — some internal references in the skill will not resolve without it.
What it helps with
- verify that a set with an operation satisfies all four group axioms
- prove a subset is a subgroup using the ab⁻¹ criterion
- check a homomorphism between two groups with
z3_solve.py - compute the order of an element and the order of a finite group
- apply Lagrange's theorem to a subgroup
Example prompts for the agent
- Check whether G forms a group under modular multiplication
- Prove that the kernel of this homomorphism is a subgroup
- Use the
groupsskill to find the order of every element in Z₆
How to install groups
1Skills CLI (Vercel)
npx skills add parcadei/Continuous-Claude-v3 --skill groups -a claude-code2Manually: put the files in place
~/.claude/skills/groups/SKILL.mdCopy the whole skill folder; for one project use .claude/skills/groups/
1Skills CLI (Vercel)
npx skills add parcadei/Continuous-Claude-v3 --skill groups -a codex2Manually: put the files in place
.agents/skills/groups/SKILL.mdFor all projects use ~/.agents/skills/
1Skills CLI (Vercel)
npx skills add parcadei/Continuous-Claude-v3 --skill groups -a cursor2Manually: put the files in place
.cursor/skills/groups/SKILL.mdCursor also reads .agents/skills/ and .claude/skills/
1GitHub CLI
gh skill install parcadei/Continuous-Claude-v3 .claude/skills/math/abstract-algebra/groups2Manually: put the files in place
.github/skills/groups/SKILL.md1Skills CLI (Vercel)
npx skills add parcadei/Continuous-Claude-v3 --skill groups -a gemini-cli2Platform CLI
gemini skills install https://github.com/parcadei/Continuous-Claude-v3 --path .claude/skills/math/abstract-algebra/groupsManually: put the files in place
.devin/skills/groups/SKILL.mdThe legacy .windsurf/skills/ path still works
Claude.ai
Zip the folder and upload it in Settings → Capabilities → Skills
Step by step, with commands for each platform: How to install skills in Claude Code: five ways
Questions about groups
How do I install the groups skill in Claude Code?
Run npx skills add parcadei/Continuous-Claude-v3 --skill groups -a claude-code. The skill file will be placed at ~/.claude/skills/groups/SKILL.md.
What does the groups skill do?
It gives the agent a structured decision tree for group-theory problems, covering axiom checks, subgroup tests, and homomorphism proofs, with z3_solve.py and sympy_compute.py calls for formal verification.
What does the groups skill need to run z3_solve.py?
Both uv and Python must be available in PATH. The scripts run via uv run python -m runtime.harness from the parcadei/Continuous-Claude-v3 repository.
Source text
SKILL.md · MIT
--- name: groups description: "Problem-solving strategies for groups in abstract algebra" allowed-tools: [Bash, Read] --- # Groups ## When to Use Use this skill when working on groups problems in abstract algebra. ## Decision Tree 1. **Is G a group under operation *?** - Check closure: a,b in G implies a*b in G? - Check associativity: (a*b)*c = a*(b*c)? - Check identity: exists e such that e*a = a*e = a? - Check inverses: for all a exists a^(-1) such that a*a^(-1) = e? - Verify with `z3_solve.py prove "group_axioms"` 2. **Subgroup Test** - Show H is non-empty (usually by showing e in H) - Show that for all a, b in H: ab^(-1) in H - `z3_solve.py prove "subgroup_criterion"` 3. **Homomorphism Proof** - Verify phi(ab) = phi(a)phi(b) for all a, b in G1 - Note: phi(e1) = e2 and phi(a^(-1)) = phi(a)^(-1) follow automatically - `sympy_compute.py simplify "phi(a*b) - phi(a)*phi(b)"` 4. **Order and Structure** - Element order: smallest n where a^n = e - Group order: |G| = number of elements - Lagrange: |H| divides |G| for subgroup H ## Tool Commands ### Z3_Group_Axioms ```bash uv run python -m runtime.harness scripts/z3_solve.py prove "ForAll([a,b,c], op(op(a,b),c) == op(a,op(b,c)))" ``` ### Z3_Subgroup ```bash uv run python -m runtime.harness scripts/z3_solve.py prove "subgroup_criterion" ``` ### Sympy_Simplify ```bash uv run python -m runtime.harness scripts/sympy_compute.py simplify "phi(a*b) - phi(a)*phi(b)" ``` ## Key Techniques *From indexed textbooks:* - [Abstract Algebra] Write a computer program to add and multiply mod n, for any n given as input. The output of these operations should be the least residues of the sums and products of two integers. Also include the feature that if (a,n) = 1, an integer c between 1 and n — 1 such that a-c = | may be printed on request. - [Abstract Algebra] With a certain amount of elementary argument (calculations in A7, for example see Exercise 27) it can be shown that there is, up to isomorphism, a unique simple group of order 168 (it is not always the case that there is at most one simple group of a given order: there are 2 nonisomorphic simple groups of order +8! We could further show that such a G would have no elements of order pg, p and q distinct primes, no elements of order 9, and that distinct Sylow subgroups would intersect in the identity. We could then count the elements in Sylow p-subgroups for all primes p and we would find that these would total to exactly |G|. - [Abstract Algebra] Some Techniques Before listing some techniques for producing normal subgroups in groups of a given (“medium”) order we note that in all the problems where one deals with groups of order n, for some specific n, it is first necessary to factor n into prime powers and then to compute the permissible values of np, for all primes p dividing n. We emphasize the need to be comfortable computing mod p when carrying out the last step. The techniques we describe may be listed as follows: (1) Counting elements. - [Abstract Algebra] Composition Series and the Hélder Program Sec. This proof takes 255 pages of hard mathematics. Part (2) of the Hélder Program, sometimes called the extension problem, was rather vaguely formulated. - [Abstract Algebra] APPLICATIONS IN GROUPS OF MEDIUM ORDER The purpose of this section is to work through a number of examples which illustrate many of the techniques we have developed. These examples use Sylow’s Theorems ex- tensively and demonstrate how they are applied in the study of finite groups. Motivated by the Holder Program we address primarily the problem of showing that for certain n every group of order n has a proper, nontrivial normal subgroup (i. ## Cognitive Tools Reference See `.claude/skills/math-mode/SKILL.md` for full tool documentation.
© parcadei · MIT · parcadei/Continuous-Claude-v3