arXiv:2111.07115v3
Abstract
Following the development of weighted asymptotic approximation properties of matrices, we introduce the analogous uniform approximation properties (that is, study the improvability of Dirichlet's Theorem). An added feature is the use of general norms, rather than the supremum norm, to quantify the approximation. In terms of homogeneous dynamics, the approximation properties of an matrix are governed by a trajectory in avoiding a compact subset of the space of lattices called the critical locus defined with respect to the corresponding norm. The trajectory is formed by the action of a one-parameter diagonal subgroup corresponding to the weights. We first state a very precise form of Dirichlet's theorem and prove it for some norms. Secondly we show, for these same norms, that the set of Dirichlet-improvable matrices has full Hausdorff dimension. Though the techniques used vary greatly depending on the chosen norm, we expect these results to hold in general.
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 findingsCorrect
The weighted Dirichlet-improvability criteria, inclusions for weighted badly approximable and singular matrices, norm-dependent results, and thickness theorem are correct.
Weighted norm-dependent Dirichlet results
Pages 3–6 · Theorems 1.1–1.7 · arXiv:2111.07115v3
The critical-locus criterion converts weighted improvement into eventual avoidance under the weighted diagonal flow. Divergence or unboundedness of the auxiliary one-parameter orbit gives the inclusions, and the critical-locus descriptions for the specified norms verify the criterion. The hyperplane-absolute-winning input gives the stated thickness conclusion.
Full paper, version 3 ↗Dynamical correspondence and critical-locus criterion
Sections 2 and 4 · Propositions 2.1 and 4.1 · arXiv:2111.07115v3
Rescaling the two coordinate blocks by the weighted diagonal flow transforms the two approximation inequalities into membership in a norm ball of critical radius. The compactness and unboundedness alternatives are applied in the correct time direction for every weight.
02Proofs4 reported findingsCorrect
The weighted Dani correspondence, critical-locus argument, and winning-set application are correct. Three notation defects have local, verified corrections and do not change any result.
The weighted flow proves all substantive inclusions
Sections 2–5 · arXiv:2111.07115v3
The proof tracks each row and column weight through the diagonal action, so the approximation thresholds and compactness criteria agree. Critical lattices for the listed norms contain a vector contracted in one time direction, establishing the required unbounded auxiliary orbit; the winning theorem then applies to the same locus.
The approximation function has an undefined subscript
Page 6 · proof of Proposition 2.1 · arXiv:2111.07115v3
The displayed block contains , although only is defined and the preceding calculation produces that function. Replace by . The correction is unique and restores the displayed weighted ball exactly.
A supposedly uniform constant is written with a free index
Page 6 · definition of in the proof of Proposition 2.1 · arXiv:2111.07115v3
The displayed retains a free row index . Replace it by a single constant no larger than all these finitely many values, for example . This strengthens every required coordinate inequality uniformly and changes no argument or conclusion.
The column-index range overlaps the row block
Page 10 · Remark 5.1 · arXiv:2111.07115v3
The expanding eigenvectors are indexed as with and . Replace the second condition by . The matrices have columns split after column , and the root calculation in the same remark uses precisely the cross-block entries.
03Novelty0 reported findingsNo non-novelty findings
No non-novelty findings.