A nonlinear Fredholm alternative for second order ordinary differential equations. (English) Zbl 0605.34020

Existence, nonexistence, and the existence of multiple solutions are discussed for a class of nonlinear Sturm-Liouville equations with Dirichlet boundary conditions. The nonlinearities considered are so- called ”jumping-nonlinearities” (S. Fučik), which cross asymptotically some eigenvalues of the linear differential operator. It is shown that the (nonlinear) eigenvalues of an associated positive- homogeneous equation determine two types of regions of parameters: For the first type the given problem has for any given data function exactly one solution, and for the second type, there exist data functions for which there exist at least two solutions while for other data functions there exist no solutions. This behaviour can be interpreted as a nonlinear Fredholm alternative. The proofs are based on the topological degree of Leray Schauder, and the so-called Lyapunov-Schmidt reduction.


34B15 Nonlinear boundary value problems for ordinary differential equations
Full Text: DOI


[1] Ambrosetti, Ann. Mat. pura appl. Ser IV 93 pp 231– (1972)
[2] Berger, Indiana U. Math. J. 24 pp 837– (1975)
[3] and , Methods of Mathematical Physics, Vol. I, Interscience, New York 1953
[4] Dancer, Bull. Austral. Math. Soc. 12 pp 399– (1975)
[5] Dancer, Proc. R. Soc. Edinb. 76A pp 283– (1977) · Zbl 0351.35037 · doi:10.1017/S0308210500019648
[6] Fučik, Casopis Pest. Mat. 101 pp 69– (1976)
[7] Gallouét, Ann. Fac. Sci. Toulouse pp 201– (1981) · Zbl 0495.35001 · doi:10.5802/afst.568
[8] Hess, Boll. U.M.I. (5) 17-A pp 187– (1980)
[9] Ruf, Ann. Mat. pura appl. (VI) 128 pp 133– (1980)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.