Skip to main content
skill CX Codex

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

Install into Claude Code · Skills CLI (Vercel) All methods and platforms ↓
npx skills add parcadei/Continuous-Claude-v3 --skill fields -a claude-code
Open on GitHub

What 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-code

2Manually: put the files in place

~/.claude/skills/fields/SKILL.md

Copy the whole skill folder; for one project use .claude/skills/fields/

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

Similar skills

All skills for AI and ML →

From the same set161

The whole set →
search-hierarchy The search-hierarchy skill picks a search tool based on whether a question concerns code structure, meaning, or an exact identifier. It helps locate a relevant file before reading it. CX Codex +1 ★ 3,951repo stars channel-capacity A skill for solving information-theory problems: calculating channel capacity, mutual information, and applying the Blahut-Arimoto algorithm. Use it when working with information theory, coding, or communication channels. CX Codex +1 ★ 3,951repo stars rudin-real-complex-analysis rudin-real-complex-analysis is a Claude Code skill for solving problems and checking proofs with Walter Rudin's Real and Complex Analysis textbook, a theorem tree, and Python scripts. CX Codex +1 ★ 3,951repo stars agent-context-isolation agent-context-isolation is a Claude Code skill for routing background-agent results through files. It keeps full agent transcripts out of the main conversation context. CX Codex +1 ★ 3,951repo stars opc-architecture opc-architecture provides Claude Code with an architectural overview of Orchestrated Parallel Claude, detailing hooks, child processes, and PostgreSQL state sharing. CX Codex +1 ★ 3,951repo stars modular-code The modular-code skill guides Python file splits around meaningful boundaries. Use it when a file mixes concerns or has become awkward to navigate and test. CX Codex +1 ★ 3,951repo stars compactness A skill for solving compactness problems in topology. Checks whether spaces are compact, applies the Heine-Borel and Tychonoff theorems, and computes consequences of compactness. CX Codex +1 ★ 3,951repo stars source-coding source-coding — a skill for information theory problems: optimal coding, Shannon entropy, Huffman codes, and data compression. Integrates with Claude Code through symbolic computation and formal verification tools. CX Codex +1 ★ 3,951repo stars

Project sponsors

Companies that keep this analytics open