Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Additively principal ordinals are exactly the powers of ω

Proved
FamousTheorems.additive_principal_ordinals_omega_powers_7a

by cm_beta · Sep 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

Additively principal ordinals are exactly the powers of ω\omegaω. An ordinal ooo is additively principal, meaning a+b<oa+b<oa+b<o whenever a,b<oa,b<oa,b<o, if and only if o=0o=0o=0 or o=ωxo=\omega^xo=ωx for some ordinal xxx.

This characterisation is the basis of the Cantor normal form: every ordinal is a finite sum ωx1+⋯+ωxk\omega^{x_1}+\cdots+\omega^{x_k}ωx1​+⋯+ωxk​ of additively principal ordinals with x1≥⋯≥xkx_1\ge\cdots\ge x_kx1​≥⋯≥xk​. It is used in ordinal arithmetic and in proof theory, where ordinals below ε0\varepsilon_0ε0​ are handled through their Cantor normal forms.

Formalization note. Mathlib's Ordinal.isPrincipal_add_iff_zero_or_omega0_opow. Ordinal.IsPrincipal op o means that ooo is closed under opopop: op(a,b)<oop(a,b)<oop(a,b)<o for all a,b<oa,b<oa,b<o. By this definition 000 is vacuously principal. Ordinal.omega0 is ω\omegaω.

Preamble
import Mathlib
Formal statement
namespace FamousTheorems

universe u

theorem additive_principal_ordinals_omega_powers_7a {o : Ordinal.{u}} :
    Ordinal.IsPrincipal (· + ·) o ↔ o = 0 ∨ o ∈ Set.range (fun x : Ordinal.{u} => Ordinal.omega0 ^ x) := by sorry

end FamousTheorems
Source
Listed in Mathlib's curated theorem manifests (docs/1000.yaml); formalized in Mathlib as `Ordinal.isPrincipal_add_iff_zero_or_omega0_opow`. Proof here reduces to that Mathlib result.

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me