fields skill
Problem-solving strategies for fields in abstract algebra
A100/100content scan
Is the fields skill safe?
Clean: nothing in its files matched our rules. We read 1 file in the folder on 2026-09-28.
No findings.
Install the fields skill
A skill is a folder. Copy it into your agent's skills folder and the agent loads it when the task matches its description.
git clone --depth 1 https://github.com/parcadei/Continuous-Claude-v3.git /tmp/Continuous-Claude-v3 mkdir -p ~/.claude/skills cp -r /tmp/Continuous-Claude-v3/.claude/skills/math/abstract-algebra/fields ~/.claude/skills/fields
available in every project
In the Claude apps, zip the folder and upload it from the Skills settings. The folder on GitHub
The instructions your agent would load
SKILL.md as published, without the frontmatter. Read it on GitHub
Fields
When to Use
Use this skill when working on fields problems in abstract algebra.
Decision Tree
- Is F a field?
- (F, +) is an abelian group with identity 0
- (F \ {0}, *) is an abelian group with identity 1
- Distributive law holds
- z3solve.py prove "fieldaxioms"
- 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
- 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)
- 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
Z3FieldAxioms
uv run python -m runtime.harness scripts/z3_solve.py prove "field_axioms"Sympy_Minpoly
uv run python -m runtime.harness scripts/sympy_compute.py minpoly "sqrt(2)" --var xSympy_Solve
uv run python -m runtime.harness scripts/sympy_compute.py solve "x**2 - 2" --var xKey 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/pZ) 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.
More skills from parcadei/Continuous-Claude-v3
- Aagent-context-isolationAgent Context Isolation
- Aagent-orchestrationAgent Orchestration Rules
- Aagentic-workflowAgentic Workflow Pattern
- Aagentica-claude-proxyGuide for integrating Agentica SDK with Claude Code CLI proxy
- Aagentica-infrastructureReference guide for Agentica multi-agent infrastructure APIs
- Aagentica-promptsWrite reliable prompts for Agentica/REPL agents that avoid LLM instruction ambiguity
- Aagentica-sdkBuild Python agents with Agentica SDK - @agentic decorator, spawn(), persistence, MCP integration
- Aagentica-serverAgentica server + Claude proxy setup - architecture, startup sequence, debugging
- Aagentica-spawnSpawn Agentica multi-agent patterns
- Aanalytic-functionsProblem-solving strategies for analytic functions in complex analysis
- Aast-grep-findAST-based code search and refactoring via ast-grep MCP
- Aasync-repl-protocolAsync REPL Protocol