Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

If every nαn^\alphanα is an integer then α\alphaα is a positive integer

Proved
HardyFiveAxioms.exponent_isNat_of_rpow_isNat

by Lucas · Oct 2, 2026 · Mathlib 0df444a (Lean v4.33.1)

mathematical-physicsnumber-theoryquantum-foundations

Let α>0\alpha>0α>0 be a real number such that nαn^\alphanα is a natural number for every positive integer nnn. Then α\alphaα is a positive integer:

α∈{1,2,3,… }.\alpha\in\{1,2,3,\dots\}.α∈{1,2,3,…}.

In Section 8.1 Hardy passes from K(N)=NαK(N)=N^\alphaK(N)=Nα to K(N)=NrK(N)=N^rK(N)=Nr with r=1,2,3,…r=1,2,3,\dotsr=1,2,3,… with the words "Since KKK must be an integer it follows that the power, α\alphaα, must be a positive integer." This milestone isolates that step.

Formalization Note nαn^\alphanα is Real.rpow and "is a natural number" means equal to the cast of some m : ℕ.

Preamble
import Mathlib
Formal statement
namespace HardyFiveAxioms

/-- Hardy 2001, Section 8.1: if `α > 0` and `n^α` is a (natural) integer for every positive
integer `n`, then `α` is a positive integer. -/
theorem exponent_isNat_of_rpow_isNat (α : ℝ) (hα : 0 < α)
    (hint : ∀ n : ℕ, 1 ≤ n → ∃ m : ℕ, (n : ℝ) ^ α = m) :
    ∃ r : ℕ, 1 ≤ r ∧ α = r := by sorry

end HardyFiveAxioms
Source
L. Hardy, *Quantum Theory From Five Reasonable Axioms*, arXiv:quant-ph/0101012v4 (2001), https://arxiv.org/abs/quant-ph/0101012, p. 16, Section 8.1, sentence before Eq. (57)
Read-back

What the Lean code literally says, in plain math · Aristotle (Harmonic)

NON-BLIND READ-BACK — NOT INDEPENDENT TESTIMONY. This read-back was written by the same agent (Aristotle, by Harmonic) that drafted the Lean statement below, with full knowledge of the source paper and of the intended meaning. It was not produced by a blind, independent auditor, so it may share the drafter's blind spots. Reviewers must not treat it as independent confirmation of faithfulness; compare the Lean code against the source directly.

Let α\alphaα be a real number with α>0\alpha>0α>0. Assume that for every natural number n≥1n\ge1n≥1 there is a natural number mmm with nα=mn^\alpha=mnα=m, where nαn^\alphanα is the real power eαln⁡ne^{\alpha\ln n}eαlnn. Then there is a natural number r≥1r\ge1r≥1 with α=r\alpha=rα=r.

Human review
  • Endorsed by Shuze Chen · Oct 8, 2026

    Confirmed by the moderator at approval.

  • Endorsed by Lucas · Oct 8, 2026

    Confirmed by the mission captain (proposal self-audit).

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