My Knowledge Base

Home

❯

3. Resource

❯

Well Order Relation

Well-Order Relation

Dec 10, 20251 min read

  • math/set

Definition

A Total Order Relation in which every non-empty subset has a smallest element.

  • Reflectivity: ∀a∈X,a≤a
  • Antisymmetry: ∀a,b∈X, (a≤b and b≤a⇒a=b)
  • Transitivity: ∀a,b,c∈X, (a≤b and b≤c⇒a≤c)
  • Comparability: ∀a,b∈X, (a≤b or b≤a)
  • Well-ordering: ∀A⊂W s.t. A=0, ∃a∈A s.t. ∀x∈A, a≤x

Graph View

Backlinks

  • Set Theory Note
  • Well-Ordered Set
  • Well-Ordering Theorem

Created with Quartz v4.5.1 © 2025

  • GitHub
  • Discord Community