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

The canonical natural ι(n)=n1F\iota(n) = n \cdot 1_F of a field

Definition

Let FF be a field (Field) with additive identity 0F0_F and multiplicative identity 1F1_F. Define ι:NF\iota : \mathbb{N} \to F by recursion on N\mathbb{N} (The natural numbers N\mathbb{N} (von Neumann), The recursion theorem):

ι(0)  :=  0F,ι(n+1)  :=  ι(n)+1F.\iota(0) \;:=\; 0_F, \qquad \iota(n+1) \;:=\; \iota(n) + 1_F .

ι(n)\iota(n) is the canonical natural of nn in FF. It is also written n1Fn \cdot 1_F, and for n1n \ge 1 it is 1F1_F added to itself nn times.

Why the notation is needed at all. A natural number in this library is a von Neumann natural, that is a set (The natural numbers N\mathbb{N} (von Neumann)), and a set is not an element of FF. So 1/n1/n, nαn^{\alpha} and x/nx/n are not expressions of FF when nn is a natural: what they mean is 1/ι(n)1/\iota(n), ι(n)α\iota(n)^{\alpha} and x/ι(n)x/\iota(n). The map ι\iota is what carries a counting number into the field, and writing it is the whole reason a reader meets 1/ι(k+1)1/\iota(k+1) where an informal text would write 1/(k+1)1/(k+1).

Remarks

  • Where the index shift comes from. N\mathbb{N} contains 00 (The natural numbers N\mathbb{N} (von Neumann)) and ι(0)=0F\iota(0) = 0_F, so 1/ι(k)1/\iota(k) is undefined at k=0k = 0. A family of reciprocals indexed by N\mathbb{N} is therefore written over ι(k+1)\iota(k+1), which is why the harmonic and telescoping families of this library run over k+1k+1 rather than over kk. This is bookkeeping, not a restriction: the values are the usual ones.

  • This definition records notation; the arithmetic is proved elsewhere. That ι\iota is strictly increasing and positive on n1n \ge 1, and that it carries sums to sums and products to products, is Canonical naturals are positive and strictly increasing, stated for an ordered field. That lemma introduces the same element by the equivalent recursion 11F=1F1 \cdot 1_F = 1_F, (n+1)1F=n1F+1F(n+1) \cdot 1_F = n \cdot 1_F + 1_F, which agrees with the definition above because ι(1)=ι(0)+1F=1F\iota(1) = \iota(0) + 1_F = 1_F. Nothing here is new mathematics; the definition exists so that the notation has a home a reader can look up.

  • The symbol ι\iota is used in this library for other canonical maps, and this definition does not govern them. It also denotes the canonical field embedding ι:QF\iota : \mathbb{Q} \to F (The unique embedding of ℚ into an ordered field), the isometric embedding of a metric space into a completion (A completion of a metric space: a complete metric space together with an isometric embedding onto a dense subspace ), and an inclusion map ι:SX\iota : S \to X of a subspace. Each of those is introduced where it is used and means something different from the map defined here. What the four share is only that each is the canonical map of its situation.

  • Fields, not just ordered fields. The recursion needs no order, so the definition is stated for a field; every use in this library is in an ordered field, and the order is what makes ι\iota injective (Canonical naturals are positive and strictly increasing). In a field of positive characteristic ι\iota is not injective, which is one reason the injectivity is a lemma rather than part of the definition.

Depends on

Used by

…and 151 more results.

Dependency tree · next 3 levels

Direct dependencies and their dependencies through the next three levels: 16 results over 8 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