Two-square theorems for infinite matrices on certain fields
The compactness theorem of model theory has various applications in algebra, and it is mainly used to correlate finitary conditions and infinitary conditions in certain problems. \textit{A. Abian} [Am. Math. Mon. 92, 94-98 (1985; Zbl 0571.12012)] proved a theorem about the solvability of an infinite set of algebraic equations in an uncountable algebraically closed field, which is also a result of compactness character. (Besides, his theorem can also be regarded as a generalization of Hilbert's Nullstellensatz.) In the present note we shall use the compactness theorem and Abian's theorem, together with a four-square theorem about finite integer matrices, to prove the following result about infinite matrices, i.e. on certain finite rings (including all finite fields) and on any uncountable algebraically closed field, every infinite matrix can be expressed as a sum of squares of two infinite matrices with special shapes. For a more general class of rings, we also append a weaker result.
- A Gauss-Newton method for convex composite optimization
- Approximate Zeros of Quadratically Convergent Algorithms
- COMPLEXITY AND REAL COMPUTATION: A MANIFESTO
- Convergence and Complexity of Newton Iteration for Operator Equations
- Convergence of iterations of Euler family under weak condition
- Convergence of Newton's method and uniqueness of the solution of equations in Banach space
- Convergence of Newton’s method and inverse function theorem in Banach space
- Convergence of the iteration of Halley's family and Smale operator class in Banach space
- Convergence on the iteration of Halley family in weak conditions
- Definite version on precise point estimate
- Estimations for the separation number of a polynomial system
- Extraneous fixed points of Euler iteration and corresponding Sullivan's basin
- Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König rational iteration functions
- Families of rational maps and iterative root-finding algorithms
- scientific article; zbMATH DE number 4088853 (Why is no real title available?)
- scientific article; zbMATH DE number 3760758 (Why is no real title available?)
- scientific article; zbMATH DE number 503396 (Why is no real title available?)
- scientific article; zbMATH DE number 645869 (Why is no real title available?)
- scientific article; zbMATH DE number 1069617 (Why is no real title available?)
- scientific article; zbMATH DE number 1525475 (Why is no real title available?)
- scientific article; zbMATH DE number 3428410 (Why is no real title available?)
- Local properties of algorithms for minimizing nonsmooth composite functions
- On dominating sequence method in the point estimate and Smale's theorem
- On the efficiency of algorithms of analysis
- On the iteration of a rational function: Computer experiments with Newton's method
- Quasiconformal homeomorphisms and dynamics. I: Solution of the Fatou- Julia problem on wandering domains
- Some remarks on Smale's “Algorithms for solving equations”
- Strong uniqueness and second order convergence in nonlinear discrete approximation
- The fundamental theorem of algebra and complexity theory
- scientific article; zbMATH DE number 78015 (Why is no real title available?)
- scientific article; zbMATH DE number 6843241 (Why is no real title available?)
- scientific article; zbMATH DE number 5024714 (Why is no real title available?)
- scientific article; zbMATH DE number 2193718 (Why is no real title available?)
This page was built for publication: Two-square theorems for infinite matrices on certain fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367867)
