## Return to Answer

2 added 5 characters in body

You can prove it by using the fact that the following holds always:

$\max_{1 \le k \le n}|S_k| \le \max_{1 \le k \le n/2}|S_k| + \max_{1 \le k \le n/2}|M_k|$

If the left hand side is larger than $\epsilon$ then one of the right hand terms is larger than $\epsilon/2$.

This also shows that the inequality is valid under absolutely no assumptions on the joint distribution of the variables $X_1,\ldots,X_n$.

1

You can prove it by using the fact that the following holds always:

$\max_{1 \le k \le n}|S_k| \le \max_{1 \le k \le n/2}|S_k| + \max_{1 \le k \le n/2}|M_k|$

If the left hand is larger than $\epsilon$ then one of the right hand terms is larger than $\epsilon/2$.

This also shows that the inequality is valid under absolutely no assumptions on the joint distribution of the variables $X_1,\ldots,X_n$.
{"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": 8, "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}, "config": {"markdown_headings": true, "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}, "english_confidence": 0.9421543478965759, "perplexity_flag": "head"}