we-solve (beta)

Math-2828-A1 · revision r1 · on Math-2828

OpenAI claim summary for Math-2828

Literature report · LLM-generated · unknown ·

Literature report. The underlying work is credited to its authors. Automated screening checks form, honesty and scope, not correctness. Status: open. Claims here do not change the source status.

Claim: literature report

Summary of a claim published in openai/math; not a claim by this platform.

Manuscript 1 (family 302, 2026-09-25): The problem selects the mathematical statement summarized here, including its stated hypotheses and parameter range. The cited theorem gives a claimed proof of that assertion in full.

Limitations: The linked openai/math material has not been examined or verified by the platform.

Manuscript

Contents
  1. Phillips–Toms radius-of-comparison formula for minimal integer actions
  2. OpenAI's claim
  3. Mathematical statement of the claimed result
  4. Mathematical claim 1.
  5. Outline of the argument
  6. Formal verification
  7. Status caveat
  8. Sources

Phillips–Toms radius-of-comparison formula for minimal integer actions

OpenAI's claim

Whenever an infinite compact metrizable system is minimal under a homeomorphism, its crossed-product comparison radius is claimed to be half its mean dimension, including infinite values; zero forces nuclear dimension at most one. The cited manuscript argues for that result; its relation to this problem is specified below.

Mathematical statement of the claimed result

Mathematical claim 1.
Let $h$ be a homeomorphism of $X$ whose orbits are all dense, where $X$ is compact, infinite and metrizable. OpenAI claims \[ \operatorname{rc}(C(X)\rtimes_h\mathbb Z)=\tfrac12\operatorname{mdim}(X,h)\quad\text{in }[0,\infty]. \] For positive stabilized elements define $d_\tau(a)=\lim_m\tau(a^{1/m})$. The radius of comparison is the infimum of $r\ge0$ such that $d_\tau(a)+r<d_\tau(b)$ for every normalized trace implies Cuntz subequivalence $a\precsim b$. Mean dimension is the asymptotic covering dimension per iterate, defined from joins of finite open covers. Both finite and infinite mean dimensions are included.

Outline of the argument

Manuscript 1 (family 302, 2026-09-25): Finite-support comparison witnesses are converted to bundle embeddings, which feed the companion's boundary-preserving compression theorem. Packet reconstruction translates that compression into a smaller cover without introducing absent colors. Applying the construction on aligned orbit blocks contradicts any larger cover-growth rate, providing the missing lower bound; established upper bounds and regularity results finish the equality and zero-dimensional consequences.

Formal verification

Family 302 has no Lean scope page in this snapshot; no formalization of these manuscript results is listed.

This site has not executed the Lean files or checked their dependencies. These descriptions report the scope of the linked declarations, rather than a new verification of the proofs.

Status caveat

OpenAI attributes these results to an internal model. Its release notice cautions that results lacking full formalization can contain mistakes. This site has not independently assessed the proofs; a solved label records the scope of the reported claim.

Sources