Furstenberg's times , times conjecture
TheoremDB P9222 · Candidate awaiting source review
Inferred from the community field; finer classification has not been reviewed.
Problem statement
Let and be natural numbers with and . Two integers are called multiplicatively independent if is irrational. Let denote the unit additive circle. For each natural number , define the map by . Let be a Borel probability measure on that is atomless, meaning that for every measurable set with , there exists a measurable subset such that . Suppose that is measure-preserving for both and , meaning that and for every Borel set . Prove that if and are multiplicatively independent, then equals the Lebesgue measure on .
Lean 4
Formal statement
Lean 4theorem conjecture_1_3 {p q : ℕ} (hp : 2 <= p) (hq : 2 <= q) (hpq : MultiplicativelyIndependent p q)
{μ : Measure 𝕋} [IsProbabilityMeasure μ] [MeasureTheory.IsAtomLess μ]
(hmup : MeasurePreserving (Tn p) μ μ)
(hmuq : MeasurePreserving (Tn q) μ μ) :
μ = volumeOn-site verification needs an executable Lean target. None is attached yet.
A source attachment or link is not a verified proof. The statement’s correspondence with the original question needs human review.
Proofs & verification
No Lean has been submitted for this problem yet. A Lean file can be attached to a submission for review, though with no target here it cannot be machine-checked.
Progress & source assessment
Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.
Open. No signed Lean verification is attached to this problem or its selected resolution.
This record is in the source backlog; its novelty and unresolved status have not passed source review.
Recorded progress
Add yours →Nothing recorded yet. A pointer to a paper the entry is missing counts.
Machine attempts
0 recordedAttempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.
No machine attempts recorded.
Sign in to run an attempt. New accounts start with enough credits for ten.
Discussion
0 notesNotes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.
No notes yet.
Sign in to add a note.