Remarks on Artin approximation with constraints (Q2272794)

From MaRDI portal
Revision as of 13:07, 20 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
Remarks on Artin approximation with constraints
scientific article

    Statements

    Remarks on Artin approximation with constraints (English)
    0 references
    0 references
    0 references
    20 September 2019
    0 references
    The paper studies some Artin approximations of solutions of polynomial equations. To this end, a field $K$ is said to be $\aleph_0$-complete, if every countable system $\mathcal S$ of polynomial equations in a countable number of indeterminates has a solution in $K$, iff every finite subsystem of $\mathcal S$ has a solution in $K$. Every finite field is $\aleph_0$-complete and so are uncountable algebraically closed fields and countably indexed ultraproducts of fields. One result is as follows: Let $K$ be an $\aleph_0$-complete field and let $K'$ be its algebraically pure field extension. Denote $x=(x_1,\dots,x_n)$ and $Y=(Y_1,\dots,Y_m)$ with $f\in K[[x]][Y]^r$. If there exists a solution $\hat y\in K'[[x]]^m$ of $f=0$ with $\hat y_i\in K'[[x_{J_i}]]$, for some $J_i\subset [n], i\in [m]$, then there exists a solution $y\in K[[x]]^m$ of $f=0$ such that $y_i\in K[[x_{J_i}]]$ and $ord(y_i)=ord(\hat y_i), i\in [m]$. Like approximations for solutions of differential equations are also given.
    0 references
    $\aleph_0$-complete field
    0 references
    approximations of solutions of polynomial equations
    0 references
    Artin approximations
    0 references

    Identifiers

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