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
z3_solve.py prove "field_axioms"
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
Z3_Field_Axioms
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 x
Sympy_Solve
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/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.
1---2name: fields3description: Fields4---56# Fields78## When to Use910Use this skill when working on fields problems in abstract algebra.1112## Decision Tree1314151. **Is F a field?**16 - (F, +) is an abelian group with identity 017 - (F \ {0}, *) is an abelian group with identity 118 - Distributive law holds19 - `z3_solve.py prove "field_axioms"`20212. **Field Extensions**22 - E is extension of F if F is subfield of E23 - Degree [E:F] = dimension of E as F-vector space24 - `sympy_compute.py minpoly "alpha" --var x` for minimal polynomial25263. **Characteristic**27 - char(F) = smallest n > 0 where n*1 = 0, or 0 if none exists28 - char(F) is 0 or prime29 - For finite field: |F| = p^n where p = char(F)30314. **Algebraic Elements**32 - alpha is algebraic over F if it satisfies polynomial with coefficients in F33 - `sympy_compute.py solve "p(alpha) = 0"` for algebraic relations343536## Tool Commands3738### Z3_Field_Axioms39```bash40uv run python -m runtime.harness scripts/z3_solve.py prove "field_axioms"41```4243### Sympy_Minpoly44```bash45uv run python -m runtime.harness scripts/sympy_compute.py minpoly "sqrt(2)" --var x46```4748### Sympy_Solve49```bash50uv run python -m runtime.harness scripts/sympy_compute.py solve "x**2 - 2" --var x51```5253## Key Techniques5455*From indexed textbooks:*5657- [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.58- [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.59- [Catergories for the working mathematician] Geometric Functional Analysis and Its Applications. Lectures in Abstract Algebra II. Lectures in Abstract Algebra III.60- [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)*.61- [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.6263## Cognitive Tools Reference6465See `.claude/skills/math-mode/SKILL.md` for full tool documentation.
Run npx skillmds@latest add dojogenesis/fields in your terminal (requires Node.js), paste this page's agent-chat prompt into Claude, Cursor, or any MCP-connected agent, or download the SKILL.md file and copy it into your agent's skills directory.
Fields It is listed under Coding & Dev Tools on SkillMD.
This skill has not completed SkillMD's automated safety review yet. SkillMD never runs a skill's scripts for you; review the SKILL.md before installing.
This skill is tagged as working with Claude Code, Claude.ai, OpenAI Codex. SKILL.md is an open format, so most agents that read a skills directory can load it too.
Yes. Installing skills from SkillMD is free, and the skill stays under its author's original license.
DojoGenesis (@dojogenesis) published this skill. Their other Agent Skills are listed on their SkillMD profile.