how to show a known matrix radius inequality

Let $A, B, C$ be symmetric positive definite matrices, define $R(A,B)=\max\{\rho(A^{-1}B), \rho(B^{-1}A) \}$, where $\rho(\cdot)$ means the spectral radius. Is it obvious $R(A,C)\le R(A,B)R(B,C)$? How to prove this?

-

Yes. First, recall that $$\rho(AB) \;\leq\; \rho(A)\rho(B)$$ for any symmetric matrices $A$ and $B$. Then \begin{align*} R(A,B) R(B,C) \;&=\; \max\{\rho(A^{-1}B),\rho(B^{-1}A)\} \max\{\rho(B^{-1}C),\rho(C^{-1}B)\} \\ &\geq\; \max\{\rho(A^{-1}B)\rho(B^{-1}C),\rho(B^{-1}A)\rho(C^{-1}B)\} \\ &\geq\; \max\{\rho(A^{-1}C),\rho(C^{-1}A)\} \\ &=\; R(A,C). \end{align*}
{"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": 1, "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": 1.0000100135803223, "perplexity": 298.71612217201107}, "config": {"markdown_headings": false, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "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-2013-20/segments/1368698017611/warc/CC-MAIN-20130516095337-00081-ip-10-60-113-184.ec2.internal.warc.gz"}