# Prove the following saddle-node bifurcation theorem

Prove the following saddle-node bifurcation theorem:

Suppose that $f_λ$ depends smoothly on the parameter $λ$ and satisfies:

(a) $f_{λ_0}(x_0)=x_0$

(b) $f_{λ_0}'(x_0)=1$

(c) $f_{λ_0}''(x_0) \ne 0$

(d) $\frac{\partial f_λ}{\partial λ} \big|_{λ=λ_0}(x_0) \ne 0$

Then there is an interval Ι about $x_0$ and a smooth function $\mu:Ι\to R$ satisfying $\mu(x_0)=λ_0$ and such that $f_\mu(x) (x)=x$

-
The formatting of this problem makes it very difficult to read. –  Amzoti Dec 23 '12 at 6:08
There is probably a proof in Elaydi's textbook on discrete dynamical systems. I don't have access to my copy at the moment. It's also possible that typing "saddle node bifurcation" into Google will turn up a proof for you. –  Gerry Myerson Dec 23 '12 at 16:58
thanks Gerry-myerson i found it in this book –  Maisam Hedyelloo Feb 4 '13 at 18:22
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.8420861959457397, "perplexity": 525.5473159360747}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 20, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2015-22/segments/1432207928729.99/warc/CC-MAIN-20150521113208-00228-ip-10-180-206-219.ec2.internal.warc.gz"}