luc/mathematics-physics-wiki
1
0
Fork 0
Code Issues Activity

Removed errors.

Browse source
This commit is contained in:
Luc Bijl 2023-12-30 20:54:26 +01:00
parent e631fe7a0f
commit 6575aa80f9
2 changed files with 3 additions and 1 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

2
config/en/mkdocs.yaml
View file

@ -72,7 +72,7 @@ nav:
- 'Maps': mathematics/set-theory/maps.md - 'Maps': mathematics/set-theory/maps.md
- 'Permutations': mathematics/set-theory/permutations.md - 'Permutations': mathematics/set-theory/permutations.md
- 'Orders': mathematics/set-theory/orders.md - 'Orders': mathematics/set-theory/orders.md
- 'Recursion and induction': mathematics/set-theory/recusrion-induction.md - 'Recursion and induction': mathematics/set-theory/recursion-induction.md
- 'Cardinalities': mathematics/set-theory/cardinalities.md - 'Cardinalities': mathematics/set-theory/cardinalities.md
- 'Additional axioms': mathematics/set-theory/additional-axioms.md - 'Additional axioms': mathematics/set-theory/additional-axioms.md
- 'Calculus': - 'Calculus':

2
docs/en/mathematics/set-theory/orders.md
View file

@ -22,6 +22,8 @@ If we consider the poset of all subsets of a set $S$ then the empty set $\varnot
> *Definition*: if a poset $(P, \sqsubseteq)$ has a minimum $\bot$, then the minimal elements of $P\backslash \{\bot\}$ are called the atoms of $P$. > *Definition*: if a poset $(P, \sqsubseteq)$ has a minimum $\bot$, then the minimal elements of $P\backslash \{\bot\}$ are called the atoms of $P$.
<br>
> *Lemma*: let $(P, \sqsubseteq)$ be a partially ordered set. Then $P$ contains at most one maximum and one minimum. > *Lemma*: let $(P, \sqsubseteq)$ be a partially ordered set. Then $P$ contains at most one maximum and one minimum.
??? note "*Proof*:" ??? note "*Proof*:"