Receber por email
← Voltar para o catálogo

vibecosystem

AI software team for Claude Code - 138 agents, 295 skills, 73 hooks. Self-learning, multi-agent swarm, autonomous skill evolution.

507estrelas
Atualizado há 4 meses

Ver no GitHub ↗ Licença: MIT

Como adicionar

/plugin marketplace add vibeeval/vibecosystem

O comando exato pode variar conforme o repositório. Confira o README no GitHub.

Para o autor da skill

Cole no README do seu repo

Mostra que sua skill está catalogada na Skillteca, gera backlink e tráfego rastreável.

[![Skillteca](https://www.skillteca.com.br/api/badge/vibecosystem-mpsjfhux/svg)](https://www.skillteca.com.br/skills/vibecosystem-mpsjfhux)
#ai

Skills relacionadas

Ver todas de Desenvolvimento →

Alerta por categoria

Receba novas skills de Desenvolvimento toda segunda

1 email curto, só com as skills novas de Desenvolvimento. 4 minutos de leitura, sem spam, cancela com 1 clique.

Você confirma o email no primeiro envio. Sem spam. Cancela com 1 clique.

Ler descrição completa

Fields

When to Use

Use this skill when working on fields problems in abstract algebra.

Decision Tree

  1. Is F a field?
  2. (F, +) is an abelian group with identity 0
  3. (F \ {0}, *) is an abelian group with identity 1
  4. Distributive law holds
  5. z3_solve.py prove "field_axioms"
  1. Field Extensions
  2. E is extension of F if F is subfield of E
  3. Degree [E:F] = dimension of E as F-vector space
  4. sympy_compute.py minpoly "alpha" --var x for minimal polynomial
  1. Characteristic
  2. char(F) = smallest n > 0 where n*1 = 0, or 0 if none exists
  3. char(F) is 0 or prime
  4. For finite field: |F| = p^n where p = char(F)
  1. Algebraic Elements
  2. alpha is algebraic over F if it satisfies polynomial with coefficients in F
  3. 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/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.

Compartilhar X LinkedIn