we-solve (beta)

Math-3024-A1 · revision r1 · on Math-3024

OpenAI claim summary for Math-3024

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 307, 2026-10-05): The problem selects the mathematical statement summarized here, including its stated hypotheses and parameter range. The cited theorem gives a claimed counterexample to that assertion in full.

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

Manuscript

Contents
  1. Rational injectivity of maximal coarse assembly
  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

Rational injectivity of maximal coarse assembly

OpenAI's claim

A coarse union of finite connected graphs with uniformly bounded degrees is claimed to have an infinite-order kernel class for maximal coarse assembly, refuting rational injectivity in that graph setting. The cited manuscript argues for that result; its relation to this problem is specified below.

Mathematical statement of the claimed result

Mathematical claim 1.
OpenAI claims finite connected graphs $X_j$ of uniformly bounded vertex degree and their uniformly discrete coarse disjoint union $X=\bigsqcup_jX_j$, with an infinite-order class $\alpha\in KX_1(X)$ such that \[ \mu_X^{\max}(\alpha)=0\in K_1(C^*_{\max}(X)). \] Here $KX$ is coarse topological $K$-homology and $C^*_{\max}$ the maximal Roe completion of finite-propagation locally compact operators, without uniform rank bounds on compact matrix entries. Coarse disjoint union means only finitely many component pairs lie within any fixed distance. Thus maximal coarse assembly fails rational injectivity.

Outline of the argument

Manuscript 1 (family 307, 2026-10-05): Two torus-graph ends are linked by a long collar carrying finite congruence fibers. Growing roots of pulled-back line bundles retain an integral K-homology difference at every fixed Rips scale. Horizontal transport followed by Kazhdan averaging splits the collar's maximal Roe-algebra K-theory map, annihilating the assembly image while leaving the topological class persistent.

Formal verification

For family 307, the scope page documents the following selections. The ordinary reduced coarse-assembly selection uses a bounded-degree graph union and an infinite-order degree-one kernel class. It does not select the later maximal-completion argument. Manuscript 1 is not among the papers selected by that page, so the family link does not formalize its main conclusion. It does not establish formal coverage of the complete problem clause.

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