arXiv:1311.1560v1
Abstract
We prove that for any countable set of real numbers, the set of binary indefinite quadratic forms such that the closure of is disjoint from has full Hausdorff dimension.
AI-generated audit
Audit summary
Not a correctness certificate. A “Correct” result may include yellow typos or minor formal corrections that do not affect substantive soundness. It means this audit found no unresolved substantive error under the stated criteria; it does not replace expert scrutiny or formal verification.
Current report
Detailed mathematical audit
01Statements3 reported findingsCorrect
The thickness theorem for bounded diagonal orbits avoiding countably many transversal submanifolds and its binary-quadratic-form consequence are correct. The abstract and one informal consequence must exclude the zero lattice vector when the forbidden set contains zero.
Bounded orbits can avoid the prescribed transversal set
Page 3 and Sections 4--5 · dynamical main theorem and percentage-game proof · arXiv:1311.1560v1
Transversality lets the percentage-game player delete uniformly controlled parameter intervals whose orbit pieces approach a given submanifold. Scheduling the countably many submanifolds and both time directions preserves a fixed positive proportion of legal moves. The winning-to-thickness and slicing arguments then give full Hausdorff dimension in every open subset of the lattice space.
The quadratic-form value-avoidance statement is valid for nonzero lattice points
Page 2 and Section 2 · quadratic-form theorem and dynamical reduction · arXiv:1311.1560v1
For , lattices containing a vector on form a countable union of closed horocycles transversal to both horospherical directions. For , boundedness of the diagonal orbit already keeps uniformly away from zero on nonzero lattice vectors. Applying the dynamical theorem to all in the countable set yields exactly as in the formal statement.
The phrase `integer points' must exclude the origin
Pages 1--2 · abstract and sentence following Theorem 1.3 · arXiv:1311.1560v1
The formal theorem evaluates on , but the abstract and the prose following Theorem 1.3 say that values `at integer points' miss any countable . If , those literal formulations are false because for every form. Replacing `integer points' by `nonzero integer points' is a local domain correction consistent with the formal theorem and proof; it changes no substantive result.
02Proofs2 reported findingsCorrect
The value-to-orbit reduction, transversality checks, percentage-game strategy, and slicing argument are correct and complete. The sole domain mismatch is reported as a minor formal correction and does not lower the overall proof status.
Accumulation of values is equivalent to meeting the vector-containing horocycles
Pages 4--6 · Proposition 2.1 and reduction to the dynamical theorem · arXiv:1311.1560v1
If orbit lattices converge to a lattice containing with , corresponding lattice vectors have values tending to . Conversely, a sequence of nonzero lattice vectors with values tending to nonzero can be diagonally rescaled to converge to the fixed vector ; boundedness supplies a convergent lattice subsequence. The primitive-vector decomposition makes the target a countable union of the required horocycles.
The percentage-game deletions handle countably many targets
Pages 8--12 · reduction to discrete time and completion of the proof · arXiv:1311.1560v1
Local product coordinates reduce each dangerous encounter to an interval whose tangent direction is separated from the playing direction by transversality. At every scheduled scale only a uniformly bounded fraction of children is deleted. The percentage-game lemma converts this survival proportion to a winning set, and countable scheduling ensures avoidance of every target without reducing the dimension conclusion.
03Novelty0 reported findingsNo non-novelty findings
No non-novelty findings.