home.social

#wellordering — Public Fediverse posts

Live and recent posts from across the Fediverse tagged #wellordering, aggregated by home.social.

  1. Every well-ordered set is isomorphic to an ordinal. Common notion, for example see Introduction to arxiv.org/abs/2409.07352

    ⊢((𝐴∈V∧𝑅We𝐴)↔∃𝑓(dom𝑓∈On∧𝑓IsomE,𝑅(dom𝑓,𝐴)))

    \[ \vdash ( ( A \in \mathrm{V} \wedge R \mathrm{We} A ) \leftrightarrow \exists f ( \mathrm{dom} f \in \mathrm{On} \wedge f \mathrm{Isom} \mathrm{E} , R ( \mathrm{dom} f , A ) ) ) \]

    Every well-ordered set is isomorphic to
    a unique ordinal.

    ⊢((𝐴∈V∧𝑅We𝐴)↔∃!𝑜∈On∃𝑓∈(𝐴↑ₘ𝑜)𝑓IsomE,𝑅(𝑜,𝐴))

    \[ \vdash ( ( A \in \mathrm{V} \wedge R \mathrm{We} A ) \leftrightarrow \exists{!} o \in \mathrm{On} \exists f \in ( A \uparrow_\mathrm{m} o ) f \mathrm{Isom} \mathrm{E} , R ( o , A ) ) \]

    We can phrase the Axiom of Choice as "Every set injects into an ordinal."

    ⊢(CHOICE↔∀𝑥∃𝑜∈On𝑥≼𝑜)

    \[ \vdash ( \mathrm{CHOICE} \leftrightarrow \forall x \exists o \in \mathrm{On} x \preccurlyeq o ) \]

    #math #metamath #SetTheory #WellOrdering #OrdinalNumbers