Positive solutions of a nonlinear algebraic system with sign-changing coefficient matrix

Existence of positive solutions for the nonlinear algebraic system x=λGF(x)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$x=\lambda GF ( x ) $\end{document} has been extensively studied when the n×n\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$n\times n$\end{document} coefficient matrix G is positive or nonnegative. However, to the best of our knowledge, few results have been obtained when the coefficient matrix changes sign. In this case, some commonly applied analysis methods such as the cone theory, the Krein–Rutman theorem, the monotone iterative techniques, and so on cannot be directly applied. In this note, we prove the existence of positive solutions for the above nonlinear algebraic system with sign-changing coefficient matrix taking the advantages of the classical Brouwer fixed point theorem combined with a decomposition condition on the coefficient matrix. We provide an example in solving a second-order difference equation with periodic boundary conditions to illustrate the applications of the results.


Introduction
The nonlinear algebraic system has interesting applications in boundary value problems, complex systems, networks, optimization, and many other areas [7-9, 12, 14, 25, 27], where λ ∈ R is a parameter, x = col(x 1 , x 2 , . . . , x n ), f : R → R is continuous, and G = (g ij ) n×n is an n × n square matrix. The existence of positive solutions for system (1) has been extensively studied in the literature; see [2,3,5,6,10,11,13,15,17,20,21,24,[27][28][29] and the references therein. However, to the best of our knowledge, almost all obtained results require that the coefficient matrix An n × n square matrix G is called a sign-changing coefficient matrix if its elements change the sign. When the coefficient matrix G changes the sign, it is difficult to construct a suitable positive order cone to apply the topological degree theory for fixed points or monotone approximation sequences. Therefore some commonly applied analysis methods such as the cone theory, the Krein-Rutman theorem, the monotone iterative techniques, and so on cannot be applied. Thus we need to seek new approaches. In this note, we take the advantages of the classical Brouwer fixed point theorem [4,26] combined with a decomposition condition for the coefficient matrix. We prove the existence of a positive solution for system (1) when the parameter λ is in an interval (0, λ 0 ) with λ 0 > 0. We give a particular example to show an easy calculation of λ 0 . We apply the results to prove the solvability of a second-order periodic boundary value problem. It is also possible to further extend the idea to operator equations in general Banach spaces.
The present work is motivated by Ma [19]. In fact, there are many publications considering the existence of solutions for differential equations with sign-changing coefficients; for example, see [16,18,19,22,23] and the references therein. It is well known that the Green functions are structured when these problems are considered. The corresponding discrete case for this type of problems can be formed as system (1) with coefficient matrix G containing columns with all negative values. However, this method cannot be applied to system (1) since the negative elements of G are not required to be in specified positions. In other words, system (1) does not represent a discrete analogue of the corresponding differential equation in most cases; see [1]. Moreover, the simplicity of the discrete setting enables us to successfully apply some computational tools that do not seem to have continuous counterparts.

Main results
For convenience, we first give the Brouwer fixed point theorem, which is the foundation of many fixed point theorems [4,26].
Lemma 1 (Brouwer Fixed Point Theorem (1912)) Let M be a nonempty convex compact subset of R n , and let F : M → M be a continuous mapping. Then F has a fixed point.
From Lemma 1 we can obtain the following result that will be valuable for the proof of Theorem 1.
implies that the function f has a fixed point in [a, b]. We now will give a more general extension. Proof For x ∈ [a, b] n , we have The proof is complete. x 0 = x 2 , or the nonlinear algebraic system a -2 2 2 a -2 . (11) In this case, Theorems 1 and 2 are valid for (10) or (11). To the best of our knowledge, such a system cannot be handled by the previous results.