AFTD Auto-Formalizing Theoretical Domains

is_minimal_integral_period

def

For a natural number n, a rational vector π : Fin n → ℚ, and a natural number T, is_minimal_integral_period π T asserts that 0 < T, for all i : Fin n there exists z : ℤ with (T : ℚ) * π i = (z : ℚ), and for every natural number T' with 0 < T' and T' < T, it is not the case that for all i : Fin n there exists z : ℤ with (T' : ℚ) * π i = (z : ℚ).

Statement

def is_minimal_integral_period {n : ℕ} (π : Fin n → ℚ) (T : ℕ) : Prop
Defined in
arXiv:2610.08949 line 211
Verified
26 Oct 2026
Axioms
none listed

Read back from the Lean

Given a natural number n, a tuple/family of rational numbers π : Fin n → ℚ, and a natural number T, is_minimal_integral_period π T asserts that: 1. T > 0; 2. For every index i : Fin n, T * π(i) is an integer (i.e., there exists an integer z such that (T : ℚ) * π i = (z : ℚ)); and 3. For every natural number T' such that 0 < T' < T, it is not the case that T' * π(i) is an integer for all i : Fin n. In other words, T is the smallest strictly positive natural number that clears all denominators of π (the least common denominator of the components of π).

Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.

Lean source view module on GitHub

/-- The minimal period T such that T * π is an integer vector. -/
def is_minimal_integral_period {n : ℕ} (π : Fin n → ℚ) (T : ℕ) : Prop := 0 < T ∧ (∀ i, ∃ z : ℤ, (T : ℚ) * π i = (z : ℚ)) ∧ ∀ T', 0 < T' → T' < T → ¬ (∀ i, ∃ z : ℤ, (T' : ℚ) * π i = (z : ℚ))
See it in the graphDiscuss this resultChallenge it