Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)audited 2026-07-25
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.

Field homomorphism and embedding

Definition

Let FF and GG be fields (Field). A field homomorphism φ:FG\varphi : F \to G is a map satisfying, for all x,yFx, y \in F,

φ(x+y)=φ(x)+φ(y),φ(xy)=φ(x)φ(y),φ(1F)=1G.\varphi(x + y) = \varphi(x) + \varphi(y), \qquad \varphi(x\, y) = \varphi(x)\,\varphi(y), \qquad \varphi(1_F) = 1_G.

An embedding (or monomorphism) is an injective field homomorphism. An isomorphism is a bijective field homomorphism.

Remarks

  • From additivity, φ(0F)=0G\varphi(0_F) = 0_G and φ(x)=φ(x)\varphi(-x) = -\varphi(x); from multiplicativity, φ(x1)=φ(x)1\varphi(x^{-1}) = \varphi(x)^{-1} for x0x \ne 0. These read off because φ(x)\varphi(-x) is an additive inverse of φ(x)\varphi(x) and φ(x1)\varphi(x^{-1}) a multiplicative inverse of φ(x)\varphi(x), and inverses are unique (Identities and inverses in a field are unique).
  • Every field homomorphism is automatically injective: its kernel {x:φ(x)=0}\{x : \varphi(x) = 0\} is an ideal of FF, and a field has only the ideals {0}\{0\} and FF; since φ(1F)=1G0\varphi(1_F) = 1_G \ne 0, the kernel is {0}\{0\}. This injectivity is used explicitly in Homomorphisms out of a complete ordered field are order-preserving.
  • Order-compatible homomorphisms are the subject of Ordered-field isomorphism.

Depends on

Used by

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 2 results over 2 levels. An arrow runs from a result to what uses it, and this result sits at the bottom with a heavier outline. Click the chart to enlarge it.

Sources