rings skill
Problem-solving strategies for rings in abstract algebra
A100/100content scan
Is the rings 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 rings 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/rings ~/.claude/skills/rings
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
Rings
When to Use
Use this skill when working on rings problems in abstract algebra.
Decision Tree
- Is R a ring?
- (R, +) is an abelian group
- Multiplication is associative
- Distributive laws: a(b+c) = ab + ac and (a+b)c = ac + bc
- z3solve.py prove "ringaxioms"
- Ring Properties
- Commutative ring: ab = ba for all a, b?
- Ring with unity: exists 1 such that 1a = a1 = a?
- Integral domain: ab = 0 implies a = 0 or b = 0?
- z3solve.py prove "integraldomain"
- Ideals
- I is ideal if: I is additive subgroup AND for all r in R, a in I: ra in I, ar in I
- Principal ideal: (a) = {ra : r in R}
- sympycompute.py simplify "ra" for ideal multiplication
- Ring Homomorphisms
- phi(a + b) = phi(a) + phi(b)
- phi(ab) = phi(a)phi(b)
- phi(1) = 1 (for rings with unity)
Tool Commands
Z3RingAxioms
uv run python -m runtime.harness scripts/z3_solve.py prove "ForAll([a,b,c], a*(b+c) == a*b + a*c)"Z3IntegralDomain
uv run python -m runtime.harness scripts/z3_solve.py prove "a*b == 0 implies a == 0 or b == 0"Sympy_Ideal
uv run python -m runtime.harness scripts/sympy_compute.py simplify "r*a"Key Techniques
From indexed textbooks:
- [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.
- [Abstract Algebra] Transcendental Extensions, Inseparable Extensions, Infinite Galois Groups Part V INTRODUCTION TO COMMUTATIVE RINGS, ALGEBRAIC GEOMETRY, AND HOMOLOGICAL ALGEBRA In this part of the book we continue the study of rings and modules, concentrating first on commutative rings. The topic of Commutative Algebra, which is of interest in its own right, is also a basic foundation for other areas of algebra. To indicate some of the © importance of the algebraic topics introduced, we parallel the development of the ring theory in Chapter 15 with an introduction to affine algebraic geometry.
- [Abstract Algebra] In the next section we give three important ways of constructing “larger” rings from a given ring (analogous to Example 6 above) and thus greafly expand our list of examples. Before doing so we mention some basic properties of arbitrary rings. The ring Z is a good example to keep in mind, although this ring has a good deal more algebraic structure than a general ring (for example, it is commutative and has an identity).
- [Abstract Algebra] Let R and S be rings with identities. S is of the form 'e x J where J is an ideal of R and J is an ideal of S. Prove that if R and S are nonzero rings then R x S is never a field.
- [Abstract Algebra] This connection of geometry and algebra shows a rich interplay between these two areas of mathematics and demonstrates again how results and structures in one circle of mathematical ideas provide insights into another. In Chapter 16 we continue with some of the fundamental structures involving commutative rings, culminating with Dedekind Domains and a structure theorem for modules over such rings which is a generalization of the structure theorem for modules over P. In Chapter 17 we describe some of the basic techniques of “homological algebra,” which continues with some of the questions raised by the failure of exactness of some of the sequences considered in Chapter 10.
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