Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 2026-08-10 (gpt-5.6-terra-codex-subscription)
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 number e is irrational

Statement

The number e is irrational.

Facts & Assumptions

[L1]

Factorials are nonzero naturals and obey their recurrence. If k≤n, then (nk)k!(n−k)!=n!, so k! divides n! (The factorial n! and the falling factorial nk‾, defined by recursion in N, (nk) k! (n−k)!=n! for k≤n; hence (nk) k!=nk‾, the quotient n!/(k!(n−k)!) is a natural number, and (nk)=(nn−k)). Every positive natural has a positive, hence nonzero, canonical real image, and the canonical map preserves products (The canonical natural ι(n)=n⋅1F of a field, Canonical naturals are positive and strictly increasing).

[L2]

The exponential factorial tail is bounded by A geometric bound for tails of the exponential series.

[L3]

Every rational has an integer representative p/q with positive denominator; every positive integer is the image of a unique natural q≥1. The embeddings N↪Z↪Q↪R are injective, preserve arithmetic and order, and the integers are closed under finite sums and differences (Every rational has a positive-denominator representative, The naturals embed in the integers, The integers embed in the rationals, The unique embedding of ℚ into an ordered field, The integers form a commutative ring).

Proof

technique · contradiction
1.1

Assume e∈Q. By [L3], write e=p/q in R with p∈Z and q∈N, q≥1, using the canonical embeddings. Choose a natural n≥max⁡{q,2} (Every complete ordered field is Archimedean).

assume-contraL3choose
2.1

Put A:=ι(n!)(e−∑k=0n1/ι(k!)). Every tail term is positive, so A>0. Applying [L2] with x=1 and N=n, then using the factorial recurrence, gives A≤2ι(n!)ι((n+1)!)=2ι(n+1)≤23<1 because n≥2.

step 1.1L1L2algebra
3.1

The number A from step 2.1 is an embedded integer. Indeed, for each 0≤k≤n, [L1] gives a natural sk with n!=k!sk. Also q!=m!q for the natural m with q=m+1, and [L1] at k=q gives q!∣n!; hence n!=qr for some natural r. By [L3] and multiplicativity of the embeddings, ι(n!)e=pr^,ι(n!)ι(k!)=ι(sk), where pr^ is the real image of the integer pr. Therefore A is a difference of embedded integers and is itself an embedded integer.

step 1.1L1L3algebra
4.1

Since the embedding preserves order, no embedded integer lies strictly between 0 and 1, contradicting steps 3.1 and 2.1. Therefore e∉Q.

step 3.1step 2.1L3discharge-contradiction∎

Depends on

Used by

Dependency tree · two levels

66 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