Division algorithm and Kronecker's approximation theorem (Q2026942)

From MaRDI portal
Revision as of 20:24, 25 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Division algorithm and Kronecker's approximation theorem
scientific article

    Statements

    Division algorithm and Kronecker's approximation theorem (English)
    0 references
    0 references
    0 references
    21 May 2021
    0 references
    The authors prove the following characterization of irrational numbers: a real number \(\theta\) is irrational, if and only if there exists a sequence \(\{p_n\}\) of integers such that the sequence \(\{||p_n\theta||\}\) is nonconstant for all large \(n\) and \(||p_n\theta||\to 0\). Using it they provide weaker versions of Dirichlet's and Kronecker's approximation theorems. For example they show: If the real numbers \(1,\theta_1,\ldots,\theta_n\) are linearly independent over \(\mathbb Q\) then for real numbers \(\alpha_1,\ldots,\alpha_n\) and \(\varepsilon >0\) there exists an integer \(t\ne 0\) such that \(||t\theta_i-\alpha_i||<\varepsilon\) for all \(i=1,\ldots,n\).
    0 references
    division algorithm
    0 references
    Dirichlet theorem
    0 references
    Kronecker's theorem
    0 references
    Diophantine approximation
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references