Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + claude-opus-5[1m])audited 2026-08-24
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Artin's fixed-field lower bound [K:KG]G

Statement

If G is a finite group of automorphisms of K, then [K:KG]G.

Facts & Assumptions

Given: A field K, a finite group G={σ1,,σm} of automorphisms of K, and its fixed field KG (The fixed field KG of a group of field automorphisms).

[L1]

Every finite family of distinct group homomorphisms GK× is linearly independent over K as a family of functions (Dedekind's linear independence theorem for distinct characters).

Proof

technique · direct
1.1

Restricted to K×, the distinct automorphisms σ1,,σm are distinct characters K×K×, so [L1] makes them linearly independent as functions. Hence their evaluation vectors span Km: otherwise a nonzero linear functional on their span would give a nontrivial K-linear relation among the σi. Choose nonzero x1,,xmK such that the evaluation matrix A=(σi(xj))i,j is invertible. For m=1, one may take x1=1.

L1choose
2.1

Suppose c1,,cmKG satisfy jcjxj=0. Applying each σi and using σi(cj)=cj gives A(c1,,cm)T=0, so invertibility of A forces every cj=0. Thus x1,,xm are linearly independent over KG.

step 1.1L1algebra
3.1

A KG-linearly independent family of m=G elements of K gives [K:KG]m=G.

step 2.1

Depends on

Used by

Dependency tree · two levels

5 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources