Thread:

1. Segments, posets

Prove that for all $\alpha$ in $\omega_1$,

$\text{seg}_{\omega_1}(\alpha) +_o \omega_1 =_o \omega_1$

and

$<br /> \text{seg}_{\omega_1}(\alpha) \cdot_o \omega_1 =_o \omega_1$.

Notation: $\omega_1$ denotes the first uncountable ordinal. $\text{seg}$ above denotes the initial segment, $\cdot_o$ denotes the product of posets, $+_o$ denotes the sum of posets. $U <_o V \Leftrightarrow (\exists x \in V ) [U =_o \text{seg}_V(x)]$. $=_o$ denotes order isomorphic.
{"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": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 10, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "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": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.75801020860672, "perplexity_flag": "middle"}