mirror of
https://github.com/hanzoai/skills.git
synced 2026-11-19 00:47:36 +00:00
hanzoskills.com/llms.txt now opens with the install line, the API reference index and the company index, so an agent that lands on any one of the three can find the rest. robots.txt claimed 537 documents while llms.txt counts 920. The number is gone from robots.txt; llms.txt derives it. public/ is regenerated from scripts/site.py, which it had fallen behind: the copy-prompt menu and agent bar were in the generator and not in the committed pages. tests/site.mjs passes against the result. Co-authored-by: Hanzo Dev <[email protected]>
689 lines
31 KiB
HTML
689 lines
31 KiB
HTML
<!doctype html>
|
||
<html lang="en"><head>
|
||
<meta charset="utf-8"><meta name="viewport" content="width=device-width,initial-scale=1">
|
||
<title>abstract-algebra</title>
|
||
<meta name="color-scheme" content="dark">
|
||
<style>
|
||
/* Committed to one visual world: a dark instrument panel. No light variant —
|
||
the dot field and the hairline rules only read on black, and a naive
|
||
inversion would wash both out. Every colour is painted explicitly so the page
|
||
never borrows a host background. */
|
||
@font-face{font-family:'Zen';src:url('/fonts/Zen-Variable.woff2') format('woff2');font-weight:100 900;font-style:normal;font-display:swap}
|
||
@font-face{font-family:'Zen';src:url('/fonts/Zen-Italic-Variable.woff2') format('woff2');font-weight:100 900;font-style:italic;font-display:swap}
|
||
@font-face{font-family:'Zen Mono';src:url('/fonts/ZenMono-Variable.woff2') format('woff2');font-weight:100 900;font-style:normal;font-display:swap}
|
||
@font-face{font-family:'Zen Mono';src:url('/fonts/ZenMono-Italic-Variable.woff2') format('woff2');font-weight:100 900;font-style:italic;font-display:swap}
|
||
@font-face{font-family:'Zen Pixel Square';src:url('/fonts/ZenPixel-Square.woff2') format('woff2');font-style:normal;font-display:swap}
|
||
|
||
:root{
|
||
--ink:#f4f4f2; --soft:#9c9c98; --faint:#6a6a66; --ground:#000; --panel:#0a0a0a;
|
||
--line:#232323; --line-hi:#3a3a3a; --accent:#f4f4f2;
|
||
--font-zen-sans:'Zen',-apple-system,BlinkMacSystemFont,"Segoe UI",Helvetica,Arial,sans-serif;
|
||
--font-zen-mono:'Zen Mono',ui-monospace,"SF Mono",SFMono-Regular,Menlo,Consolas,monospace;
|
||
--font-zen-pixel-square:'Zen Pixel Square',monospace;
|
||
--mono:var(--font-zen-mono);
|
||
--sans:var(--font-zen-sans);
|
||
/* Controls are pills and surfaces are soft, as on hanzo.ai. */
|
||
--r:999px; --r-soft:14px;
|
||
}
|
||
*{box-sizing:border-box}
|
||
html{-webkit-text-size-adjust:100%}
|
||
body{margin:0;background:var(--ground);color:var(--ink);font-family:var(--sans);
|
||
font-size:16px;line-height:1.65;-webkit-font-smoothing:antialiased}
|
||
.wrap{max-width:60rem;margin:0 auto;padding:0 1.75rem}
|
||
|
||
/* The dot field. A halftone made of one repeating radial-gradient, faded out
|
||
along the diagonal by a mask so it reads as a wave rather than wallpaper. */
|
||
/* No overflow clip here: the dot field is inset to the box already, and a clip
|
||
would cut off the copy-prompt menu. */
|
||
.hero{position:relative;border-bottom:1px solid var(--line)}
|
||
.hero::before{content:"";position:absolute;inset:0;
|
||
background-image:radial-gradient(var(--line-hi) 1px, transparent 1px);
|
||
background-size:7px 7px;
|
||
-webkit-mask-image:linear-gradient(115deg,#000 0%,rgba(0,0,0,.55) 38%,transparent 72%);
|
||
mask-image:linear-gradient(115deg,#000 0%,rgba(0,0,0,.55) 38%,transparent 72%);
|
||
pointer-events:none}
|
||
.hero .wrap{position:relative;padding-top:5.5rem;padding-bottom:4rem}
|
||
|
||
nav{border-bottom:1px solid var(--line)}
|
||
nav .in{max-width:60rem;margin:0 auto;padding:1.1rem 1.75rem;display:flex;
|
||
justify-content:space-between;align-items:center;gap:1rem}
|
||
.brand{font-family:var(--mono);font-size:.85rem;letter-spacing:.14em;
|
||
text-transform:uppercase;color:var(--ink);text-decoration:none;
|
||
display:inline-flex;align-items:center;gap:.6rem}
|
||
.brand i{font-style:normal;color:var(--faint)}
|
||
.mark{width:1.15em;height:1.15em;display:block;flex:0 0 auto}
|
||
nav a.up{font-family:var(--mono);font-size:.72rem;letter-spacing:.14em;
|
||
text-transform:uppercase;color:var(--soft);text-decoration:none}
|
||
nav a.up:hover{color:var(--ink)}
|
||
|
||
h1{font-family:var(--mono);font-size:clamp(2rem,5.4vw,3.4rem);line-height:1.12;
|
||
letter-spacing:-.02em;margin:0 0 1.1rem;font-weight:500;text-wrap:balance}
|
||
h1 em{font-style:normal;color:var(--faint)}
|
||
.lede{color:var(--soft);font-size:1.05rem;max-width:52ch;margin:0 0 2.25rem}
|
||
|
||
.btns{display:flex;flex-wrap:wrap;gap:.7rem;margin:0 0 .5rem;align-items:center}
|
||
.btn{display:inline-flex;align-items:center;gap:.5rem;font-family:var(--mono);
|
||
font-size:.72rem;letter-spacing:.14em;text-transform:uppercase;
|
||
padding:.8rem 1.4rem;border:1px solid var(--line-hi);border-radius:var(--r);
|
||
color:var(--ink);text-decoration:none;background:transparent;cursor:pointer;
|
||
line-height:1.2;font-weight:400}
|
||
.btn:hover{background:#141414;text-decoration:none;border-color:var(--soft)}
|
||
.btn.solid{background:var(--ink);color:#000;border-color:var(--ink)}
|
||
.btn.solid:hover{background:#d8d8d4}
|
||
.btn .chev{width:.7em;height:.7em;flex:0 0 auto;transition:transform .15s ease}
|
||
.btn[aria-expanded="true"] .chev{transform:rotate(180deg)}
|
||
|
||
/* Copy-prompt selector. Each row copies the prompt for its own target. */
|
||
.copy{position:relative;display:inline-flex}
|
||
.menu{position:absolute;top:calc(100% + .5rem);left:0;z-index:20;min-width:21rem;
|
||
background:var(--panel);border:1px solid var(--line-hi);border-radius:var(--r-soft);
|
||
padding:.4rem;display:flex;flex-direction:column;
|
||
box-shadow:0 12px 32px rgba(0,0,0,.75)}
|
||
.menu[hidden]{display:none}
|
||
.mi{display:flex;align-items:center;gap:.7rem;width:100%;text-align:left;
|
||
padding:.62rem .8rem;border:0;border-radius:calc(var(--r-soft) - .35rem);
|
||
background:transparent;color:var(--ink);font-family:var(--mono);font-size:.76rem;
|
||
letter-spacing:.04em;text-decoration:none;cursor:pointer;line-height:1.3;
|
||
white-space:nowrap}
|
||
.mi:hover,.mi:focus-visible{background:#181818;outline:none}
|
||
.mi .mark{width:1.05rem;height:1.05rem;color:var(--soft)}
|
||
.mi:hover .mark{color:var(--ink)}
|
||
.mi u{margin-left:auto;color:var(--faint);text-decoration:none;font-size:.68rem;
|
||
letter-spacing:.1em;text-transform:uppercase}
|
||
|
||
/* Works-with bar: one scrolling row, name and mark per agent. */
|
||
.strip{border-bottom:1px solid var(--line);background:var(--panel)}
|
||
.strip .in{max-width:60rem;margin:0 auto;padding:.9rem 1.75rem;display:flex;
|
||
align-items:center;gap:1.25rem;font-family:var(--mono);font-size:.72rem;
|
||
letter-spacing:.1em;text-transform:uppercase;color:var(--faint)}
|
||
.strip b{color:var(--soft);font-weight:400;flex:0 0 auto;
|
||
border-right:1px solid var(--line);padding-right:1.25rem;align-self:stretch;
|
||
display:flex;align-items:center}
|
||
.bar{display:flex;align-items:center;gap:.5rem;flex:1 1 auto;min-width:0;
|
||
overflow-x:auto;scrollbar-width:none;scroll-snap-type:x proximity;
|
||
-webkit-overflow-scrolling:touch;
|
||
-webkit-mask-image:linear-gradient(90deg,#000 calc(100% - 3rem),transparent);
|
||
mask-image:linear-gradient(90deg,#000 calc(100% - 3rem),transparent)}
|
||
.bar::-webkit-scrollbar{display:none}
|
||
.agent{display:inline-flex;align-items:center;gap:.45rem;flex:0 0 auto;
|
||
padding:.4rem .85rem;border:1px solid var(--line);border-radius:var(--r);
|
||
color:var(--soft);white-space:nowrap;scroll-snap-align:start;
|
||
text-decoration:none;background:var(--ground)}
|
||
.agent:hover{color:var(--ink);border-color:var(--line-hi);text-decoration:none}
|
||
.agent .mark{width:.95rem;height:.95rem}
|
||
|
||
h2{font-family:var(--mono);font-size:1.1rem;letter-spacing:-.01em;margin:2.75rem 0 .75rem;font-weight:500}
|
||
h3{font-size:1rem;margin:2rem 0 .5rem;font-weight:600}
|
||
h4,h5,h6{font-size:.94rem;margin:1.5rem 0 .5rem;font-weight:600}
|
||
p{margin:0 0 1rem;max-width:70ch}
|
||
ul,ol{margin:0 0 1rem;padding-left:1.35rem;max-width:70ch}
|
||
li{margin:.22rem 0}
|
||
a{color:var(--ink);text-decoration:underline;text-underline-offset:3px;
|
||
text-decoration-color:var(--line-hi)}
|
||
a:hover{text-decoration-color:var(--ink)}
|
||
a:focus-visible{outline:1px solid var(--ink);outline-offset:3px}
|
||
code{font-family:var(--mono);font-size:.85em;background:var(--panel);
|
||
border:1px solid var(--line);border-radius:5px;padding:.1em .36em}
|
||
pre{background:var(--panel);border:1px solid var(--line);padding:1rem 1.1rem;
|
||
border-radius:var(--r-soft);overflow-x:auto;margin:0 0 1.25rem}
|
||
pre code{background:none;border:0;padding:0;font-size:.82rem;line-height:1.7}
|
||
blockquote{margin:0 0 1rem;padding-left:1rem;border-left:1px solid var(--line-hi);color:var(--soft)}
|
||
hr{border:0;border-top:1px solid var(--line);margin:2.5rem 0}
|
||
table{border-collapse:collapse;width:100%;margin:0 0 1.25rem;font-size:.92rem;
|
||
display:block;overflow-x:auto}
|
||
th,td{border:1px solid var(--line);padding:.5rem .7rem;text-align:left}
|
||
|
||
.curl{display:block;background:var(--panel);border:1px solid var(--line);
|
||
border-radius:var(--r-soft);padding:.95rem 1.1rem;font-family:var(--mono);
|
||
font-size:.8rem;color:var(--soft);overflow-x:auto;margin:0 0 2.5rem;
|
||
white-space:pre;line-height:1.9}
|
||
.curl b{color:var(--ink);font-weight:400}
|
||
.curl i{font-style:normal;color:var(--faint)}
|
||
|
||
/* index */
|
||
#q{width:100%;padding:.85rem 1.2rem;font-family:var(--mono);font-size:.85rem;color:var(--ink);
|
||
background:var(--panel);border:1px solid var(--line);border-radius:var(--r);margin:0 0 .6rem}
|
||
#q::placeholder{color:var(--faint);text-transform:uppercase;letter-spacing:.1em;font-size:.72rem}
|
||
#q:focus{outline:none;border-color:var(--soft)}
|
||
#count{color:var(--faint);font-family:var(--mono);font-size:.72rem;letter-spacing:.1em;
|
||
text-transform:uppercase;margin:0 0 2rem}
|
||
.cat{margin:2.5rem 0 .5rem;font-family:var(--mono);font-size:.7rem;letter-spacing:.16em;
|
||
text-transform:uppercase;color:var(--faint);border-bottom:1px solid var(--line);
|
||
padding-bottom:.45rem}
|
||
.row{display:block;padding:.6rem .9rem;margin:0 -.9rem;border-bottom:1px solid var(--line);
|
||
border-radius:var(--r-soft);text-decoration:none}
|
||
.row:hover{background:#0a0a0a}
|
||
.nm{font-family:var(--mono);font-size:.84rem;color:var(--ink);display:block}
|
||
.ds{color:var(--soft);font-size:.9rem;display:block;margin-top:.12rem}
|
||
footer{margin-top:4rem;padding:2rem 0 4rem;border-top:1px solid var(--line);
|
||
color:var(--faint);font-size:.85rem}
|
||
footer a{color:var(--soft)}
|
||
.fmap{display:grid;gap:1.75rem;grid-template-columns:repeat(auto-fit,minmax(11rem,1fr));
|
||
margin:0 0 2rem;font-size:.85rem}
|
||
.fmap b{display:block;font-family:var(--mono);font-size:.68rem;letter-spacing:.16em;
|
||
text-transform:uppercase;color:var(--faint);font-weight:400;margin:0 0 .6rem;
|
||
border-bottom:1px solid var(--line);padding-bottom:.4rem}
|
||
.fmap a{display:inline-block;color:var(--ink);text-decoration:none;margin:.3rem .35rem 0 0}
|
||
.fmap a:hover{text-decoration:underline}
|
||
.fmap div{color:var(--faint);line-height:1.5}
|
||
.fend{border-top:1px solid var(--line);padding-top:1.25rem;font-size:.82rem}
|
||
|
||
@media (max-width:640px){
|
||
.hero .wrap{padding-top:3.25rem;padding-bottom:2.75rem}
|
||
.btns{gap:.5rem}
|
||
.btn{padding:.75rem 1.15rem;font-size:.68rem}
|
||
.copy,.copy .btn{width:100%;justify-content:center}
|
||
.menu{left:0;right:0;min-width:0}
|
||
.strip .in{flex-direction:column;align-items:flex-start;gap:.6rem;padding:.9rem 1.75rem}
|
||
.strip b{border-right:0;padding-right:0}
|
||
.bar{width:100%}
|
||
}
|
||
</style>
|
||
<link rel="alternate" type="text/markdown" href="/abstract-algebra.md">
|
||
|
||
<link rel="icon" href="/favicon.svg">
|
||
<link rel="canonical" href="https://hanzoskills.com/abstract-algebra">
|
||
</head>
|
||
<!-- Reading this with a machine? Every page here is also plain markdown.
|
||
This one: https://hanzoskills.com/abstract-algebra.md
|
||
Index: https://hanzoskills.com/llms.txt
|
||
Corpus: https://hanzoskills.com/all.md
|
||
Append .md to any path for the markdown twin. -->
|
||
<body>
|
||
<nav><div class="in">
|
||
<a class="brand" href="/"><svg class="mark" viewBox="0 0 67 67" fill="currentColor" aria-hidden="true"><path d="M22.21 67V44.6369H0V67H22.21Z"/><path d="M66.7038 22.3184H22.2534L0.0878906 44.6367H44.4634L66.7038 22.3184Z"/><path d="M22.21 0H0V22.3184H22.21V0Z"/><path d="M66.7198 0H44.5098V22.3184H66.7198V0Z"/><path d="M66.7198 67V44.6369H44.5098V67H66.7198Z"/></svg> HANZO<i>SKILLS</i></a>
|
||
<a class="up" href="/">All skills</a>
|
||
</div></nav>
|
||
|
||
<div class="wrap">
|
||
<h1>abstract-algebra</h1><p class="lede">Abstract algebra including groups, rings, fields, Galois theory, and algebraic structures</p><h1>Abstract Algebra</h1>
|
||
<p><strong>Scope</strong>: Groups, rings, fields, homomorphisms, quotient structures, Galois theory <strong>Lines</strong>: ~420 <strong>Last Updated</strong>: 2025-10-25</p>
|
||
<h2>When to Use This Skill</h2>
|
||
<p>Activate this skill when:</p>
|
||
<ul><li>Studying symmetry and group actions</li><li>Working with polynomial rings and field extensions</li><li>Understanding quotient structures and homomorphisms</li><li>Applying Galois theory to polynomial equations</li><li>Implementing algebraic algorithms (GCD, factorization)</li><li>Formalizing algebraic proofs in theorem provers</li></ul>
|
||
<h2>Core Concepts</h2>
|
||
<h3>Groups</h3>
|
||
<p><strong>Definition</strong>: A group (G, ·) is a set G with binary operation · satisfying:</p>
|
||
<ul><li>Closure: a, b ∈ G ⟹ a · b ∈ G</li><li>Associativity: (a · b) · c = a · (b · c)</li><li>Identity: ∃e ∈ G: e · a = a · e = a</li><li>Inverse: ∀a ∈ G, ∃a⁻¹: a · a⁻¹ = a⁻¹ · a = e</li></ul>
|
||
<pre><code class="lang-python">from abc import ABC, abstractmethod
|
||
from typing import Generic, TypeVar
|
||
|
||
T = TypeVar('T')
|
||
|
||
class Group(ABC, Generic[T]):
|
||
"""Abstract base class for groups"""
|
||
|
||
@abstractmethod
|
||
def op(self, a: T, b: T) -> T:
|
||
"""Group operation"""
|
||
pass
|
||
|
||
@abstractmethod
|
||
def identity(self) -> T:
|
||
"""Identity element"""
|
||
pass
|
||
|
||
@abstractmethod
|
||
def inverse(self, a: T) -> T:
|
||
"""Inverse of element"""
|
||
pass
|
||
|
||
def associative_check(self, a: T, b: T, c: T) -> bool:
|
||
"""Verify associativity"""
|
||
return self.op(self.op(a, b), c) == self.op(a, self.op(b, c))
|
||
|
||
# Example: Integers mod n under addition
|
||
class ZnAdditive(Group[int]):
|
||
def __init__(self, n: int):
|
||
self.n = n
|
||
|
||
def op(self, a: int, b: int) -> int:
|
||
return (a + b) % self.n
|
||
|
||
def identity(self) -> int:
|
||
return 0
|
||
|
||
def inverse(self, a: int) -> int:
|
||
return (self.n - a) % self.n
|
||
|
||
# Example: Symmetric group S_n
|
||
class SymmetricGroup(Group[tuple]):
|
||
def __init__(self, n: int):
|
||
self.n = n
|
||
|
||
def op(self, sigma: tuple, tau: tuple) -> tuple:
|
||
"""Compose permutations: (σ ∘ τ)(i) = σ(τ(i))"""
|
||
return tuple(sigma[tau[i]] for i in range(self.n))
|
||
|
||
def identity(self) -> tuple:
|
||
return tuple(range(self.n))
|
||
|
||
def inverse(self, sigma: tuple) -> tuple:
|
||
"""Find inverse permutation"""
|
||
inv = [0] * self.n
|
||
for i, s in enumerate(sigma):
|
||
inv[s] = i
|
||
return tuple(inv)
|
||
|
||
# Usage
|
||
Z5 = ZnAdditive(5)
|
||
print(f"3 + 4 mod 5 = {Z5.op(3, 4)}") # 2
|
||
print(f"Inverse of 3 mod 5 = {Z5.inverse(3)}") # 2
|
||
|
||
S3 = SymmetricGroup(3)
|
||
sigma = (1, 2, 0) # Permutation (0→1, 1→2, 2→0)
|
||
tau = (0, 2, 1) # Permutation (0→0, 1→2, 2→1)
|
||
print(f"σ ∘ τ = {S3.op(sigma, tau)}")</code></pre>
|
||
<p><strong>Subgroups</strong>: H ⊆ G is a subgroup if H is itself a group under the same operation</p>
|
||
<p><strong>Lagrange's Theorem</strong>: If H ⊆ G is a subgroup, then |H| divides |G|</p>
|
||
<pre><code class="lang-python">def is_subgroup(G: Group, H: set) -> bool:
|
||
"""Check if H is a subgroup of G"""
|
||
if not H:
|
||
return False
|
||
|
||
# Check closure
|
||
for a in H:
|
||
for b in H:
|
||
if G.op(a, b) not in H:
|
||
return False
|
||
|
||
# Check identity
|
||
if G.identity() not in H:
|
||
return False
|
||
|
||
# Check inverses
|
||
for a in H:
|
||
if G.inverse(a) not in H:
|
||
return False
|
||
|
||
return True</code></pre>
|
||
<h3>Rings</h3>
|
||
<p><strong>Definition</strong>: A ring (R, +, ·) is a set R with two operations satisfying:</p>
|
||
<ul><li>(R, +) is an abelian group</li><li>· is associative with identity (for rings with unity)</li><li>Distributive laws: a·(b+c) = a·b + a·c, (a+b)·c = a·c + b·c</li></ul>
|
||
<pre><code class="lang-python">class Ring(ABC, Generic[T]):
|
||
"""Abstract base class for rings"""
|
||
|
||
@abstractmethod
|
||
def add(self, a: T, b: T) -> T:
|
||
pass
|
||
|
||
@abstractmethod
|
||
def multiply(self, a: T, b: T) -> T:
|
||
pass
|
||
|
||
@abstractmethod
|
||
def zero(self) -> T:
|
||
"""Additive identity"""
|
||
pass
|
||
|
||
@abstractmethod
|
||
def one(self) -> T:
|
||
"""Multiplicative identity"""
|
||
pass
|
||
|
||
@abstractmethod
|
||
def negate(self, a: T) -> T:
|
||
"""Additive inverse"""
|
||
pass
|
||
|
||
# Example: Polynomial ring ℤ[x]
|
||
class PolynomialRing(Ring[list]):
|
||
"""Polynomials with integer coefficients"""
|
||
|
||
def add(self, p: list, q: list) -> list:
|
||
"""Add polynomials (coefficients lists)"""
|
||
n = max(len(p), len(q))
|
||
result = [0] * n
|
||
for i in range(len(p)):
|
||
result[i] += p[i]
|
||
for i in range(len(q)):
|
||
result[i] += q[i]
|
||
# Remove leading zeros
|
||
while len(result) > 1 and result[-1] == 0:
|
||
result.pop()
|
||
return result
|
||
|
||
def multiply(self, p: list, q: list) -> list:
|
||
"""Multiply polynomials"""
|
||
if not p or not q:
|
||
return [0]
|
||
result = [0] * (len(p) + len(q) - 1)
|
||
for i, a in enumerate(p):
|
||
for j, b in enumerate(q):
|
||
result[i + j] += a * b
|
||
return result
|
||
|
||
def zero(self) -> list:
|
||
return [0]
|
||
|
||
def one(self) -> list:
|
||
return [1]
|
||
|
||
def negate(self, p: list) -> list:
|
||
return [-c for c in p]
|
||
|
||
# Usage
|
||
Z_poly = PolynomialRing()
|
||
p = [1, 2, 1] # x² + 2x + 1 = (x+1)²
|
||
q = [1, -1] # x - 1
|
||
product = Z_poly.multiply(p, q)
|
||
print(f"(x²+2x+1)(x-1) = {product}") # [1, 1, -1, -1] = x³ + x² - x - 1</code></pre>
|
||
<p><strong>Ideals</strong>: Subset I ⊆ R where:</p>
|
||
<ul><li>I is a subgroup under addition</li><li>For all r ∈ R, a ∈ I: r·a ∈ I and a·r ∈ I</li></ul>
|
||
<p><strong>Quotient Rings</strong>: R/I = {a + I : a ∈ R}</p>
|
||
<pre><code class="lang-python">def gcd_polynomials(p: list, q: list) -> list:
|
||
"""Euclidean algorithm for polynomial GCD"""
|
||
poly_ring = PolynomialRing()
|
||
|
||
def degree(poly):
|
||
return len(poly) - 1 if poly != [0] else -float('inf')
|
||
|
||
def divide(dividend, divisor):
|
||
"""Polynomial division, returns (quotient, remainder)"""
|
||
if degree(divisor) > degree(dividend):
|
||
return [0], dividend
|
||
|
||
quotient = []
|
||
remainder = dividend[:]
|
||
|
||
while degree(remainder) >= degree(divisor):
|
||
# Leading coefficient
|
||
coeff = remainder[-1] // divisor[-1]
|
||
deg_diff = degree(remainder) - degree(divisor)
|
||
|
||
# Subtract divisor * (coeff * x^deg_diff)
|
||
term = [0] * deg_diff + [coeff]
|
||
subtrahend = poly_ring.multiply(divisor, term)
|
||
|
||
quotient = poly_ring.add(quotient, term)
|
||
remainder = poly_ring.add(remainder, poly_ring.negate(subtrahend))
|
||
|
||
return quotient, remainder
|
||
|
||
# Euclidean algorithm
|
||
a, b = p, q
|
||
while b != [0]:
|
||
_, r = divide(a, b)
|
||
a, b = b, r
|
||
|
||
return a
|
||
|
||
# Example: gcd(x² - 1, x³ - 1)
|
||
p1 = [-1, 0, 1] # x² - 1
|
||
p2 = [-1, 0, 0, 1] # x³ - 1
|
||
gcd = gcd_polynomials(p1, p2)
|
||
print(f"gcd(x²-1, x³-1) = {gcd}") # [1, -1] = x - 1</code></pre>
|
||
<h3>Fields</h3>
|
||
<p><strong>Definition</strong>: A field (F, +, ·) is a commutative ring where every non-zero element has a multiplicative inverse</p>
|
||
<p><strong>Examples</strong>: ℚ, ℝ, ℂ, ℤ/pℤ (p prime), finite fields 𝔽_q</p>
|
||
<pre><code class="lang-python">class FiniteField:
|
||
"""Finite field ℤ/pℤ for prime p"""
|
||
|
||
def __init__(self, p: int):
|
||
if not self._is_prime(p):
|
||
raise ValueError(f"{p} is not prime")
|
||
self.p = p
|
||
|
||
@staticmethod
|
||
def _is_prime(n: int) -> bool:
|
||
if n < 2:
|
||
return False
|
||
for i in range(2, int(n**0.5) + 1):
|
||
if n % i == 0:
|
||
return False
|
||
return True
|
||
|
||
def add(self, a: int, b: int) -> int:
|
||
return (a + b) % self.p
|
||
|
||
def multiply(self, a: int, b: int) -> int:
|
||
return (a * b) % self.p
|
||
|
||
def inverse(self, a: int) -> int:
|
||
"""Multiplicative inverse via extended Euclidean algorithm"""
|
||
if a % self.p == 0:
|
||
raise ValueError("Zero has no inverse")
|
||
|
||
# Extended Euclidean algorithm
|
||
def extended_gcd(a, b):
|
||
if a == 0:
|
||
return b, 0, 1
|
||
gcd, x1, y1 = extended_gcd(b % a, a)
|
||
x = y1 - (b // a) * x1
|
||
y = x1
|
||
return gcd, x, y
|
||
|
||
_, x, _ = extended_gcd(a % self.p, self.p)
|
||
return x % self.p
|
||
|
||
def divide(self, a: int, b: int) -> int:
|
||
"""a / b = a · b⁻¹"""
|
||
return self.multiply(a, self.inverse(b))
|
||
|
||
# Example: Field ℤ/7ℤ
|
||
F7 = FiniteField(7)
|
||
print(f"3 + 5 mod 7 = {F7.add(3, 5)}") # 1
|
||
print(f"3 * 5 mod 7 = {F7.multiply(3, 5)}") # 1
|
||
print(f"3⁻¹ mod 7 = {F7.inverse(3)}") # 5
|
||
print(f"2 / 3 mod 7 = {F7.divide(2, 3)}") # 3 (since 2/3 = 2·5 = 10 = 3 mod 7)</code></pre>
|
||
<h3>Homomorphisms</h3>
|
||
<p><strong>Definition</strong>: φ: G → H is a group homomorphism if φ(a · b) = φ(a) · φ(b)</p>
|
||
<p><strong>Kernel</strong>: ker(φ) = {g ∈ G : φ(g) = e_H} <strong>Image</strong>: im(φ) = {φ(g) : g ∈ G}</p>
|
||
<p><strong>First Isomorphism Theorem</strong>: G/ker(φ) ≅ im(φ)</p>
|
||
<pre><code class="lang-python">class GroupHomomorphism:
|
||
def __init__(self, domain: Group, codomain: Group, mapping: callable):
|
||
self.domain = domain
|
||
self.codomain = codomain
|
||
self.phi = mapping
|
||
|
||
def preserves_operation(self, a, b) -> bool:
|
||
"""Check φ(a·b) = φ(a)·φ(b)"""
|
||
lhs = self.phi(self.domain.op(a, b))
|
||
rhs = self.codomain.op(self.phi(a), self.phi(b))
|
||
return lhs == rhs
|
||
|
||
def kernel(self, elements: set) -> set:
|
||
"""ker(φ) = {g ∈ G : φ(g) = e_H}"""
|
||
e_H = self.codomain.identity()
|
||
return {g for g in elements if self.phi(g) == e_H}
|
||
|
||
def image(self, elements: set) -> set:
|
||
"""im(φ) = {φ(g) : g ∈ G}"""
|
||
return {self.phi(g) for g in elements}
|
||
|
||
# Example: Sign homomorphism S_n → {±1}
|
||
def sign_permutation(sigma: tuple) -> int:
|
||
"""Compute sign of permutation (1 for even, -1 for odd)"""
|
||
n = len(sigma)
|
||
inversions = 0
|
||
for i in range(n):
|
||
for j in range(i + 1, n):
|
||
if sigma[i] > sigma[j]:
|
||
inversions += 1
|
||
return 1 if inversions % 2 == 0 else -1</code></pre>
|
||
<h3>Galois Theory</h3>
|
||
<p><strong>Field Extension</strong>: K/F where F ⊆ K are fields</p>
|
||
<p><strong>Galois Group</strong>: Gal(K/F) = {automorphisms σ: K → K fixing F}</p>
|
||
<p><strong>Fundamental Theorem</strong>: Correspondence between intermediate fields and subgroups</p>
|
||
<pre><code class="lang-python">class FieldExtension:
|
||
"""Represent field extension K/F"""
|
||
|
||
def __init__(self, base_field, extension_field, minimal_polynomial):
|
||
self.F = base_field
|
||
self.K = extension_field
|
||
self.min_poly = minimal_polynomial
|
||
|
||
def degree(self) -> int:
|
||
"""[K:F] = degree of extension"""
|
||
return len(self.min_poly) - 1
|
||
|
||
def is_galois(self) -> bool:
|
||
"""Check if extension is Galois (normal + separable)"""
|
||
# Simplified check: polynomial splits completely
|
||
# In practice, need to verify all roots are in K
|
||
return self._splits_completely()
|
||
|
||
def _splits_completely(self) -> bool:
|
||
"""Check if minimal polynomial splits into linear factors"""
|
||
# Placeholder: would need to factor polynomial over K
|
||
pass
|
||
|
||
# Example: ℚ(√2) / ℚ
|
||
# Minimal polynomial: x² - 2
|
||
# Galois group: {id, σ} where σ(√2) = -√2
|
||
# Gal(ℚ(√2)/ℚ) ≅ ℤ/2ℤ
|
||
|
||
def galois_group_quadratic():
|
||
"""
|
||
For ℚ(√d)/ℚ where d is square-free:
|
||
Galois group is {id, σ} where σ(√d) = -√d
|
||
Isomorphic to ℤ/2ℤ
|
||
"""
|
||
return {
|
||
'elements': ['id', 'sigma'],
|
||
'operation': {
|
||
('id', 'id'): 'id',
|
||
('id', 'sigma'): 'sigma',
|
||
('sigma', 'id'): 'sigma',
|
||
('sigma', 'sigma'): 'id'
|
||
},
|
||
'isomorphic_to': 'Z/2Z'
|
||
}</code></pre>
|
||
<hr>
|
||
<h2>Patterns</h2>
|
||
<h3>Pattern 1: Quotient Structures</h3>
|
||
<p><strong>Quotient Group</strong>: G/N where N is normal subgroup</p>
|
||
<pre><code class="lang-python">def quotient_group(G: Group, N: set, elements: set):
|
||
"""
|
||
Construct quotient group G/N
|
||
Elements are cosets {gN : g ∈ G}
|
||
"""
|
||
cosets = {}
|
||
|
||
for g in elements:
|
||
# Compute left coset gN = {g·n : n ∈ N}
|
||
coset = frozenset(G.op(g, n) for n in N)
|
||
|
||
# Representative is minimal element (for canonical form)
|
||
rep = min(coset)
|
||
cosets[rep] = coset
|
||
|
||
# Quotient operation: (g₁N)(g₂N) = (g₁g₂)N
|
||
def quotient_op(coset1_rep, coset2_rep):
|
||
product = G.op(coset1_rep, coset2_rep)
|
||
# Find canonical representative
|
||
product_coset = frozenset(G.op(product, n) for n in N)
|
||
return min(product_coset)
|
||
|
||
return {
|
||
'cosets': cosets,
|
||
'operation': quotient_op,
|
||
'identity': min(N) # eN = N
|
||
}</code></pre>
|
||
<h3>Pattern 2: Chinese Remainder Theorem</h3>
|
||
<p><strong>For Rings</strong>: If I, J are coprime ideals, R/(I ∩ J) ≅ R/I × R/J</p>
|
||
<pre><code class="lang-python">def chinese_remainder_theorem(moduli: list[int], remainders: list[int]) -> int:
|
||
"""
|
||
Solve system: x ≡ a_i (mod n_i)
|
||
Requires moduli to be pairwise coprime
|
||
"""
|
||
from math import gcd
|
||
|
||
# Verify coprimality
|
||
for i in range(len(moduli)):
|
||
for j in range(i + 1, len(moduli)):
|
||
if gcd(moduli[i], moduli[j]) != 1:
|
||
raise ValueError("Moduli must be coprime")
|
||
|
||
# Compute solution
|
||
N = 1
|
||
for n in moduli:
|
||
N *= n
|
||
|
||
x = 0
|
||
for i, (n_i, a_i) in enumerate(zip(moduli, remainders)):
|
||
N_i = N // n_i
|
||
# Find M_i such that N_i * M_i ≡ 1 (mod n_i)
|
||
_, M_i, _ = extended_gcd(N_i, n_i)
|
||
x += a_i * N_i * M_i
|
||
|
||
return x % N
|
||
|
||
def extended_gcd(a, b):
|
||
if a == 0:
|
||
return b, 0, 1
|
||
gcd, x1, y1 = extended_gcd(b % a, a)
|
||
x = y1 - (b // a) * x1
|
||
y = x1
|
||
return gcd, x, y
|
||
|
||
# Example
|
||
moduli = [3, 5, 7]
|
||
remainders = [2, 3, 2] # x ≡ 2 (mod 3), x ≡ 3 (mod 5), x ≡ 2 (mod 7)
|
||
solution = chinese_remainder_theorem(moduli, remainders)
|
||
print(f"Solution: x ≡ {solution} (mod {3*5*7})") # x = 23</code></pre>
|
||
<h3>Pattern 3: Sylow Theorems</h3>
|
||
<p><strong>Sylow's First Theorem</strong>: If p^k divides |G|, ∃ subgroup of order p^k</p>
|
||
<pre><code class="lang-python">def sylow_p_subgroups(G: Group, elements: set, p: int) -> list:
|
||
"""
|
||
Find Sylow p-subgroups (maximal p-subgroups)
|
||
For group G with |G| = p^k · m where p ∤ m
|
||
"""
|
||
n = len(elements)
|
||
|
||
# Find k where p^k divides n
|
||
k = 0
|
||
temp = n
|
||
while temp % p == 0:
|
||
k += 1
|
||
temp //= p
|
||
|
||
p_k = p ** k
|
||
|
||
# Find all subgroups of order p^k
|
||
# (In practice, use more efficient algorithms)
|
||
sylow_subgroups = []
|
||
|
||
# Placeholder: would enumerate and check
|
||
# Real implementation uses permutation group algorithms
|
||
|
||
return sylow_subgroups</code></pre>
|
||
<hr>
|
||
<h2>Quick Reference</h2>
|
||
<h3>Group Properties</h3>
|
||
<p>| Property | Definition | Example | |----------|-----------|---------| | Abelian | a·b = b·a | (ℤ, +) | | Cyclic | G = ⟨g⟩ for some g | ℤ/nℤ | | Simple | No normal subgroups except {e}, G | A_n (n≥5) | | Solvable | Subnormal series with abelian quotients | S_n (n≤4) |</p>
|
||
<h3>Ring Types</h3>
|
||
<p>| Type | Definition | Example | |------|-----------|---------| | Integral Domain | No zero divisors | ℤ | | Principal Ideal Domain (PID) | Every ideal is principal | ℤ, k[x] | | Unique Factorization Domain (UFD) | Unique prime factorization | ℤ[x] | | Euclidean Domain | Has Euclidean algorithm | ℤ, k[x] |</p>
|
||
<h3>Field Extensions</h3>
|
||
<p>| Concept | Definition | Example | |---------|-----------|---------| | Degree | [K:F] = dimF(K) | [ℂ:ℝ] = 2 | | Algebraic | α root of polynomial over F | √2 over ℚ | | Transcendental | Not algebraic | π over ℚ | | Splitting field | Smallest field where polynomial splits | ℚ(√2, √3) |</p>
|
||
<hr>
|
||
<h2>Anti-Patterns</h2>
|
||
<p>❌ <strong>Confusing quotient with subset</strong>: G/N is set of cosets, not subset of G ✅ Elements of G/N are equivalence classes gN</p>
|
||
<p>❌ <strong>Assuming all rings are commutative</strong>: Matrix rings are non-commutative ✅ Always check if ab = ba when needed</p>
|
||
<p>❌ <strong>Ignoring characteristic</strong>: Field of char p has p·1 = 0 ✅ Verify characteristic when working with finite fields</p>
|
||
<p>❌ <strong>Assuming field extensions are Galois</strong>: Need normal + separable ✅ Check if minimal polynomial splits completely</p>
|
||
<hr>
|
||
<h2>Related Skills</h2>
|
||
<ul><li><code>set-theory.md</code> - Set-theoretic foundations for algebra</li><li><code>number-theory.md</code> - Applications to integers and primes</li><li><code>linear-algebra-computation.md</code> - Vector spaces over fields</li><li><code>category-theory-foundations.md</code> - Categorical perspective on algebra</li><li><code>formal/lean-mathlib4.md</code> - Formalizing algebra in Lean</li></ul>
|
||
<hr>
|
||
<p><strong>Last Updated</strong>: 2025-10-25 <strong>Format Version</strong>: 1.0 (Atomic)</p>
|
||
<footer>
|
||
<div class="fmap">
|
||
<div><b>Build</b>
|
||
<a href="https://hanzo.app">hanzo.app</a> app builder
|
||
<a href="https://hanzo.codes">hanzo.codes</a> code with an agent
|
||
<a href="https://hanzoskills.com">hanzoskills.com</a> what an agent reads</div>
|
||
<div><b>Run</b>
|
||
<a href="https://console.hanzo.ai">console.hanzo.ai</a> cloud console
|
||
<a href="https://api.hanzo.ai">api.hanzo.ai</a> the API</div>
|
||
<div><b>Account</b>
|
||
<a href="https://hanzo.id">hanzo.id</a> sign in
|
||
<a href="https://pay.hanzo.ai">pay.hanzo.ai</a> top up
|
||
<a href="https://billing.hanzo.ai">billing.hanzo.ai</a> invoices and usage</div>
|
||
<div><b>Company</b>
|
||
<a href="https://hanzo.ai">hanzo.ai</a> canonical
|
||
<a href="https://hanzo.ventures">hanzo.ventures</a> ventures</div>
|
||
</div>
|
||
<div class="fend"><a href="/abstract-algebra.md">This page as plain text</a> · <a href="/llms.txt">Index for agents</a></div>
|
||
</footer>
|
||
</div></body></html> |