nLab ordered field setoid

Redirected from "group representations".

Context

Algebra

Relations

Constructivism, Realizability, Computability

Contents

Idea

A setoid or Bishop set whose quotient set is an ordered field.

“Ordered field setoid” and “Bishop ordered field” are placeholder names for a concept which may or may not have another name in the mathematics literature.

Definition

Classically:

An ordered field setoid is a field setoid (R,∼)(R, \sim) equipped with a strict weak order <\lt such that

  • for all a∈Ra \in R and b∈Rb \in R, if a<ba \lt b is not true and b<ab \lt a is not true, then a∼ba \sim b

  • 0<10 \lt 1

  • for all a∈Ra \in R and b∈Rb \in R, 0<a0 \lt a and 0<b0 \lt b implies that 0<a+b0 \lt a + b; alternatively, 0<a+b0 \lt a + b implies that 0<a0 \lt a or 0<b0 \lt b.

  • for all a∈Ra \in R and b∈Rb \in R, if 0<a0 \lt a and 0<b0 \lt b, then 0<a⋅b0 \lt a \cdot b

One often sees the definition using a weak total order ≤\leq instead of the strict total order <\lt. This makes no difference in classical mathematics, but the definition of the strict total order is the one that generalizes to constructive mathematics.

Properties

Examples

Last revised on July 10, 2024 at 19:31:48. See the history of this page for a list of all contributions to it.