fields

Problem-solving strategies for fields in abstract algebra

422 stars

Best use case

fields is best used when you need a repeatable AI agent workflow instead of a one-off prompt.

Problem-solving strategies for fields in abstract algebra

Teams using fields should expect a more consistent output, faster repeated execution, less prompt rewriting.

When to use this skill

  • You want a reusable workflow that can be run more than once with consistent structure.

When not to use this skill

  • You only need a quick one-off answer and do not need a reusable workflow.
  • You cannot install or maintain the underlying files, dependencies, or repository context.

Installation

Claude Code / Cursor / Codex

$curl -o ~/.claude/skills/fields/SKILL.md --create-dirs "https://raw.githubusercontent.com/vibeeval/vibecosystem/main/skills/math/abstract-algebra/fields/SKILL.md"

Manual Installation

  1. Download SKILL.md from GitHub
  2. Place it in .claude/skills/fields/SKILL.md inside your project
  3. Restart your AI agent — it will auto-discover the skill

How fields Compares

Feature / AgentfieldsStandard Approach
Platform SupportNot specifiedLimited / Varies
Context Awareness High Baseline
Installation ComplexityUnknownN/A

Frequently Asked Questions

What does this skill do?

Problem-solving strategies for fields in abstract algebra

Where can I find the source code?

You can find the source code on GitHub using the link provided at the top of the page.

SKILL.md Source

# 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.

Related Skills

workflow-router

422
from vibeeval/vibecosystem

Goal-based workflow orchestration - routes tasks to specialist agents based on user goals

wiring

422
from vibeeval/vibecosystem

Wiring Verification

websocket-patterns

422
from vibeeval/vibecosystem

Connection management, room patterns, reconnection strategies, message buffering, and binary protocol design.

visual-verdict

422
from vibeeval/vibecosystem

Screenshot comparison QA for frontend development. Takes a screenshot of the current implementation, scores it across multiple visual dimensions, and returns a structured PASS/REVISE/FAIL verdict with concrete fixes. Use when implementing UI from a design reference or verifying visual correctness.

verification-loop

422
from vibeeval/vibecosystem

Comprehensive verification system covering build, types, lint, tests, security, and diff review before a PR.

vector-db-patterns

422
from vibeeval/vibecosystem

Embedding strategies, ANN algorithms, hybrid search, RAG chunking strategies, and reranking for semantic search and retrieval.

variant-analysis

422
from vibeeval/vibecosystem

Find similar vulnerabilities across a codebase after discovering one instance. Uses pattern matching, AST search, Semgrep/CodeQL queries, and manual tracing to propagate findings. Adapted from Trail of Bits. Use after finding a bug to check if the same pattern exists elsewhere.

validate-agent

422
from vibeeval/vibecosystem

Validation agent that validates plan tech choices against current best practices

tracing-patterns

422
from vibeeval/vibecosystem

OpenTelemetry setup, span context propagation, sampling strategies, Jaeger queries

tour

422
from vibeeval/vibecosystem

Friendly onboarding tour of Claude Code capabilities for users asking what it can do.

tldr-stats

422
from vibeeval/vibecosystem

Show full session token usage, costs, TLDR savings, and hook activity

tldr-router

422
from vibeeval/vibecosystem

Map code questions to the optimal tldr command by detecting intent and routing to the right analysis layer.