Homotopy Type Theory
ordered integral domain > history (Rev #3, changes)
Showing changes from revision #2 to #3:
Added | Removed | Changed
Definition
erm…
With strict order
An ordered integral domain is a strictly ordered integral Heyting integral domain ℤ \mathbb{Z} -algebra such that for every element ( a : A , + , − , 0 , ⋅ , 1 , # ) (A, a:A +, -, 0, \cdot, 1, #) with such that max ( a , − a ) > 0 \max(a, -a) \gt 0 , there is an element b : A b:A such that a ⋅ b = 1 a \cdot b = 1 .
a : A , b : A ⊢ α ( a , b ) : ( 0 < a ) × ( 0 < b ) → ( 0 < a + b ) a:A, b:A \vdash \alpha(a, b): (0 \lt a) \times (0 \lt b) \to (0 \lt a + b) a : A , b : A ⊢ μ ( a , b ) : ( 0 < a ) × ( 0 < b ) → ( 0 < a ⋅ b ) a:A, b:A \vdash \mu(a, b): (0 \lt a) \times (0 \lt b) \to (0 \lt a \cdot b)
With positivity
An ordered integral domain is a Heyting integral domain with a predicate isPositive \mathrm{isPositive} such that
isPositive ( 0 ) → ∅ \mathrm{isPositive}(0) \to \emptyset
isPositive ( 1 ) \mathrm{isPositive}(1)
for every term a : A a:A , if a a is not positive and − a -a is not positive, then a = 0 a = 0
∏ a : A ( ( isPositive ( a ) → ∅ ) × ( isPositive ( − a ) → ∅ ) ) → ( a = 0 ) \prod_{a:A} ((\mathrm{isPositive}(a) \to \emptyset) \times (\mathrm{isPositive}(-a) \to \emptyset)) \to (a = 0)
for every term a : A a:A , if a a is positive, then − a -a is not positive.
∏ a : A ∏ b : A isPositive ( a ) → ( isPositive ( − a ) → ∅ ) \prod_{a:A} \prod_{b:A} \mathrm{isPositive}(a) \to (\mathrm{isPositive}(-a) \to \emptyset)
for every term a : A a:A , b : A b:A , if a a is positive, then either b b is positive or a − b a - b is positive.
∏ a : A ∏ b : A isPositive ( a ) → [ isPositive ( b ) + isPositive ( a − b ) ] \prod_{a:A} \prod_{b:A} \mathrm{isPositive}(a) \to \left[\mathrm{isPositive}(b) + \mathrm{isPositive}(a - b)\right]
for every term a : A a:A , b : A b:A , if a a is positive and b b is positive, then a + b a + b is positive
∏ a : A ∏ b : A isPositive ( a ) × isPositive ( b ) → isPositive ( a + b ) \prod_{a:A} \prod_{b:A} \mathrm{isPositive}(a) \times \mathrm{isPositive}(b) \to \mathrm{isPositive}(a + b)
for every term a : A a:A , b : A b:A , if a a is positive and b b is positive, then a ⋅ b a \cdot b is positive
∏ a : A ∏ b : A isPositive ( a ) × isPositive ( b ) → isPositive ( a ⋅ b ) \prod_{a:A} \prod_{b:A} \mathrm{isPositive}(a) \times \mathrm{isPositive}(b) \to \mathrm{isPositive}(a \cdot b)
Examples
See also
Revision on June 12, 2022 at 21:19:58 by
Anonymous? .
See the history of this page for a list of all contributions to it.