Bad(w) is hyperplane absolute winning

Victor Beresnevich; Erez Nesharim; Lei Yang

doi:10.1007/s00039-021-00555-7

Bad(w) is hyperplane absolute winning

Victor Beresnevich, Erez Nesharim, Lei Yang

Mathematics

Research output: Contribution to journal › Article › peer-review

Abstract

In 1998 Kleinbock conjectured that any set of weighted badly approximable $d\times n$ real matrices is a winning subset in the sense of Schmidt's game. In this paper we prove this conjecture in full for vectors in $\mathbb{R}^d$ in arbitrary dimensions by showing that the corresponding set of weighted badly approximable vectors is hyperplane absolute winning. The proof uses the Cantor potential game played on the support of Ahlfors regular absolutely decaying measures and the quantitative nondivergence estimate for a class of fractal measures due to Kleinbock, Lindenstrauss and Weiss. To establish the existence of a relevant winning strategy in the Cantor potential game we introduce a new approach using two independent diagonal actions on the space of lattices.

Original language	English
Pages (from-to)	1-33
Journal	Geometric And Functional Analysis
Volume	31
DOIs	https://doi.org/10.1007/s00039-021-00555-7
Publication status	Published - 13 Mar 2021

Bibliographical note

© 2021 Springer Nature Switzerland AG. Part of Springer Nature. This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details

Access to Document

10.1007/s00039-021-00555-7

Badw_is_hyperplane_absolute_winning
© 2021 Springer Nature Switzerland AG. Part of Springer Nature. This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details
Accepted author manuscript, 591 KB

Cite this

@article{f5381a5386634baaa1ae4787db78cc73,

title = "Bad(w) is hyperplane absolute winning",

abstract = "In 1998 Kleinbock conjectured that any set of weighted badly approximable $d\times n$ real matrices is a winning subset in the sense of Schmidt's game. In this paper we prove this conjecture in full for vectors in $\mathbb{R}^d$ in arbitrary dimensions by showing that the corresponding set of weighted badly approximable vectors is hyperplane absolute winning. The proof uses the Cantor potential game played on the support of Ahlfors regular absolutely decaying measures and the quantitative nondivergence estimate for a class of fractal measures due to Kleinbock, Lindenstrauss and Weiss. To establish the existence of a relevant winning strategy in the Cantor potential game we introduce a new approach using two independent diagonal actions on the space of lattices.",

author = "Victor Beresnevich and Erez Nesharim and Lei Yang",

note = "{\textcopyright} 2021 Springer Nature Switzerland AG. Part of Springer Nature. This is an author-produced version of the published paper. Uploaded in accordance with the publisher{\textquoteright}s self-archiving policy. Further copying may not be permitted; contact the publisher for details",

year = "2021",

month = mar,

day = "13",

doi = "10.1007/s00039-021-00555-7",

language = "English",

volume = "31",

pages = "1--33",

journal = "Geometric And Functional Analysis",

issn = "1016-443X",

publisher = "Birkhauser Verlag Basel",

}

TY - JOUR

T1 - Bad(w) is hyperplane absolute winning

AU - Beresnevich, Victor

AU - Nesharim, Erez

AU - Yang, Lei

N1 - © 2021 Springer Nature Switzerland AG. Part of Springer Nature. This is an author-produced version of the published paper. Uploaded in accordance with the publisher’s self-archiving policy. Further copying may not be permitted; contact the publisher for details

PY - 2021/3/13

Y1 - 2021/3/13

N2 - In 1998 Kleinbock conjectured that any set of weighted badly approximable $d\times n$ real matrices is a winning subset in the sense of Schmidt's game. In this paper we prove this conjecture in full for vectors in $\mathbb{R}^d$ in arbitrary dimensions by showing that the corresponding set of weighted badly approximable vectors is hyperplane absolute winning. The proof uses the Cantor potential game played on the support of Ahlfors regular absolutely decaying measures and the quantitative nondivergence estimate for a class of fractal measures due to Kleinbock, Lindenstrauss and Weiss. To establish the existence of a relevant winning strategy in the Cantor potential game we introduce a new approach using two independent diagonal actions on the space of lattices.

AB - In 1998 Kleinbock conjectured that any set of weighted badly approximable $d\times n$ real matrices is a winning subset in the sense of Schmidt's game. In this paper we prove this conjecture in full for vectors in $\mathbb{R}^d$ in arbitrary dimensions by showing that the corresponding set of weighted badly approximable vectors is hyperplane absolute winning. The proof uses the Cantor potential game played on the support of Ahlfors regular absolutely decaying measures and the quantitative nondivergence estimate for a class of fractal measures due to Kleinbock, Lindenstrauss and Weiss. To establish the existence of a relevant winning strategy in the Cantor potential game we introduce a new approach using two independent diagonal actions on the space of lattices.

U2 - 10.1007/s00039-021-00555-7

DO - 10.1007/s00039-021-00555-7

M3 - Article

SN - 1016-443X

VL - 31

SP - 1

EP - 33

JO - Geometric And Functional Analysis

JF - Geometric And Functional Analysis

ER -