Fields — Claude Code skill: abstract algebra problem-solving strategies
A skill for working with fields in abstract algebra. It verifies field axioms, computes minimal polynomials, and solves algebraic equations using Bash and Read tools.
MIT ★ 3,951 updated 2026-01-26
npx skills add parcadei/Continuous-Claude-v3 --skill fields -a claude-codeWhat fields does
Fields provides strategies for tackling problems involving fields in abstract algebra. The skill includes a decision tree: verifying field axioms, analyzing field extensions and their degrees [E:F], determining field characteristic, and working with algebraic elements. It runs commands through z3_solve.py for axiom checking and sympy_compute.py for polynomial and equation operations.
The skill relies on Bash and Read tools. Core operations include verifying that (F, +) is an abelian group, (F \ {0}, *) is an abelian group, and the distributive law holds; computing minimal polynomials; and solving algebraic equations. It targets algebra tasks and requires a Python environment.
What it helps with
- Verify whether a set with given operations forms a field
- Compute field extension degree and the minimal polynomial of an element
- Find the characteristic of a field and determine the order of a finite field
- Solve algebraic equations and identify algebraic relations
Example prompts for the agent
- Check if ℤ/5ℤ is a field by validating axioms
- Compute the minimal polynomial of √2 over ℚ
- Solve the equation x² - 2 = 0 using the algebraic solver
How to install fields
1Skills CLI (Vercel)
npx skills add parcadei/Continuous-Claude-v3 --skill fields -a claude-code2Manually: put the files in place
~/.claude/skills/fields/SKILL.mdCopy the whole skill folder; for one project use .claude/skills/fields/
1Skills CLI (Vercel)
npx skills add parcadei/Continuous-Claude-v3 --skill fields -a codex2Manually: put the files in place
.agents/skills/fields/SKILL.mdFor all projects use ~/.agents/skills/
1Skills CLI (Vercel)
npx skills add parcadei/Continuous-Claude-v3 --skill fields -a cursor2Manually: put the files in place
.cursor/skills/fields/SKILL.mdCursor also reads .agents/skills/ and .claude/skills/
1GitHub CLI
gh skill install parcadei/Continuous-Claude-v3 .claude/skills/math/abstract-algebra/fields2Manually: put the files in place
.github/skills/fields/SKILL.md1Skills CLI (Vercel)
npx skills add parcadei/Continuous-Claude-v3 --skill fields -a gemini-cli2Platform CLI
gemini skills install https://github.com/parcadei/Continuous-Claude-v3 --path .claude/skills/math/abstract-algebra/fieldsManually: put the files in place
.devin/skills/fields/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 fields
How do I install fields in Claude Code?
Run npx skills add parcadei/Continuous-Claude-v3 --skill fields -a claude-code, then check the documentation in ~/.claude/skills/fields/SKILL.md.
What does the fields skill do?
It provides strategies and tools for solving abstract algebra problems involving fields: verifying axioms, computing extensions, analyzing characteristic, and solving algebraic equations.
Which tools does this skill use?
The skill uses Bash and Read. Main commands are z3_solve.py prove "field_axioms" to check axioms, sympy_compute.py minpoly to compute minimal polynomials, and sympy_compute.py solve to solve equations.
Source text
SKILL.md · MIT
---
name: fields
description: "Problem-solving strategies for fields in abstract algebra"
allowed-tools: [Bash, Read]
---
# Fields
## When to Use
Use this skill when working on fields problems in abstract algebra.
## Decision Tree
1. **Is F a field?**
- (F, +) is an abelian group with identity 0
- (F \ {0}, *) is an abelian group with identity 1
- Distributive law holds
- `z3_solve.py prove "field_axioms"`
2. **Field Extensions**
- E is extension of F if F is subfield of E
- Degree [E:F] = dimension of E as F-vector space
- `sympy_compute.py minpoly "alpha" --var x` for minimal polynomial
3. **Characteristic**
- char(F) = smallest n > 0 where n*1 = 0, or 0 if none exists
- char(F) is 0 or prime
- For finite field: |F| = p^n where p = char(F)
4. **Algebraic Elements**
- alpha is algebraic over F if it satisfies polynomial with coefficients in F
- `sympy_compute.py solve "p(alpha) = 0"` for algebraic relations
## Tool Commands
### Z3_Field_Axioms
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "field_axioms"
```
### Sympy_Minpoly
```bash
uv run python -m runtime.harness scripts/sympy_compute.py minpoly "sqrt(2)" --var x
```
### Sympy_Solve
```bash
uv run python -m runtime.harness scripts/sympy_compute.py solve "x**2 - 2" --var x
```
## 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] Reading the above equation mod4\(that is, considering this equation in the quotient ring Z/4Z), we must have {2} =2[9}=[9} ons ( io ‘| where the | he? Checking the few saad shows that we must take the 0 each time. Introduction to Rings Another ideal in RG is {}-"_, agi | a € R}, i.
- [Catergories for the working mathematician] Geometric Functional Analysis and Its Applications. Lectures in Abstract Algebra II. Lectures in Abstract Algebra III.
- [Abstract Algebra] For p an odd prime, (Z/p*Z)* is an abelian group of order p* ‘(p — 1). Sylow p-subgroup of this group is cyclic. The map Z/p°Z > Z/pZ defined by at+(p*) a+t+(p) is a ring homomorphism (reduction mod p) which gives a surjective group homo- morphism from (Z/p%Z)* onto (Z/pZ)*.
- [A Classical Introduction to Modern Number Theory (Graduate] Graduate Texts in Mathematics 84 Editorial Board s. Ribet Springer Science+Business Media, LLC 2 3 TAKEUTtlZARING. Introduction to Axiomatic Set Theory.
## Cognitive Tools Reference
See `.claude/skills/math-mode/SKILL.md` for full tool documentation.
© parcadei · MIT · parcadei/Continuous-Claude-v3