How is the lexicographic order \(\leq_{\text{lex}}\) on \(A \times B\) defined?
Note 1: ETH::DiskMat
Deck: ETH::DiskMat
Note Type: Horvath Classic
GUID:
modified
Note Type: Horvath Classic
GUID:
tBd|.5x#E:
Before
Front
Back
How is the lexicographic order \(\leq_{\text{lex}}\) on \(A \times B\) defined?
\[(a_1, b_1) \leq_{\text{lex}} (a_2, b_2) \overset{\text{def}}{\Longleftrightarrow} a_1 \preceq a_2 \lor (a_1 = a_2 \land b_1 \sqsubseteq b_2)\]
After
Front
How is the lexicographic order \(\leq_{\text{lex}}\) on \(A \times B\) defined?
Back
How is the lexicographic order \(\leq_{\text{lex}}\) on \(A \times B\) defined?
\[(a_1, b_1) \leq_{\text{lex}} (a_2, b_2) \overset{\text{def}}{\Longleftrightarrow} a_1 \prec a_2 \lor (a_1 = a_2 \land b_1 \sqsubseteq b_2)\]
Field-by-field Comparison
| Field | Before | After |
|---|---|---|
| Back | \[(a_1, b_1) \leq_{\text{lex}} (a_2, b_2) \overset{\text{def}}{\Longleftrightarrow} a_1 \prec |
\[(a_1, b_1) \leq_{\text{lex}} (a_2, b_2) \overset{\text{def}}{\Longleftrightarrow} a_1 \prec a_2 \lor (a_1 = a_2 \land b_1 \sqsubseteq b_2)\] |