arXiv:1108.4435v1
Abstract
We show that there exist real numbers linearly independent over together with 1 such that for every non-zero integer vector with and one has with .
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
01Statements2 reported findingsContains unsupported statements
The reduction from the Fundamental Lemma to the counterexample is correct, but the paper does not establish the Fundamental Lemma's decisive lattice-selection and linear-independence assertions.
The counterexample depends on an unverified construction lemma
Pages 1-3 and 5-8 · Theorem 1, Fundamental Lemma, and Sections 5-6 · arXiv:1108.4435v1
Lemmas 1-2 would give the stated lower bound if the sequence in the Fundamental Lemma existed. Section 6, however, only calls the candidate lattice points dense at scale and then asserts that one lies in the prescribed disk while simultaneously satisfying completeness, sign, angle, nesting, and eventual rational-independence conditions. No quantitative covering or avoidance argument proves those simultaneous requirements, so the central existence claim remains unsupported.
Full paper, version 1 ↗The five asserted properties are not obtained by the written induction
Pages 2-3 and 6-8 · Fundamental Lemma and its proof sketch · arXiv:1108.4435v1
The construction must produce a primitive in , make complete, retain both angle exclusions, and leave a choice avoiding every rational relation for the limiting pair. The final two paragraphs assert these properties from having 'many points' but give neither a lower count in nor an upper count for the excluded subsets. These are nontrivial obligations, not immediate consequences of the preceding estimates.
02Proofs4 reported findingsContains incorrect or incomplete proofs
The determinant and dependent-lattice estimates are correct, but the proof of the construction lemma is incomplete at the step on which the theorem depends.
The independent-vector determinant estimate is correct
Page 4 · Lemma 1 · arXiv:1108.4435v1
The nonzero integer determinant is split into one term containing and two terms containing . The upper endpoint of makes the latter contribution at most one half, and the lower endpoint converts the remaining determinant bound into .
The dependent-vector lattice estimate is correct
Pages 4-5 · Lemma 2 · arXiv:1108.4435v1
Completeness gives integral coefficients in . The sign and angle hypotheses bound both and below in terms of , while the two-sided estimates for prevent cancellation. Eliminating gives the printed exponent and constant.
The lattice-point selection and irrationality steps are incomplete
Pages 7-8 · final four paragraphs of the Fundamental Lemma sketch · arXiv:1108.4435v1
The estimate controls a mesh scale but does not by itself prove that the constrained affine lattice meets the fixed-radius disk , much less that enough admissible points remain to impose (iv), (v), and avoid countably many rational hyperplanes in the limit. A repair requires explicit lattice-covering and branching estimates throughout the induction; none are supplied.
Four symbols in the construction and dependent-vector estimate are typographical
Pages 2, 5, and 7 · condition (iv), equation (o3), and Section 6 lattice definition · arXiv:1108.4435v1
Condition (iv) labels both standard basis vectors , so the second is ; the coefficient bound in Lemma 2 has where the surrounding lines require ; the first power of in (o3) is missing its minus sign; and the affine-lattice definition repeats where the coefficient of must be . All four repairs are forced locally and do not address the separate construction gap.
03Novelty0 reported findingsNo non-novelty findings
No non-novelty findings.