Skip to main content
added missing assumption, added tag
Source Link
YCor
  • 63.9k
  • 5
  • 187
  • 286

Is there a left orderable-orderable profinite group?

Is there a nontrivial profinite group $G$ with a binary transitive relation $<$ such that for any different $x,y \in G$ either $x < y$ or $y < x$ and such that for any $x,y,z \in G$ we have that $x < y$ implies that $zx < zy$ ?

  1. $x<y$ implies $x\neq y$, and for any different $x,y \in G$ either $x < y$ or $y < x$ and such that for any $x,y,z \in G$ we have that $x < y$ implies that $zx < zy$ (i.e., $<$ defines a left-invariant strict total order)
  2. $\{(x,y):x<y\}$ is open?

Is there a left orderable profinite group?

Is there a profinite group $G$ with a binary transitive relation $<$ such that for any different $x,y \in G$ either $x < y$ or $y < x$ and such that for any $x,y,z \in G$ we have that $x < y$ implies that $zx < zy$ ?

Is there a left-orderable profinite group?

Is there a nontrivial profinite group $G$ with a binary transitive relation $<$ such that

  1. $x<y$ implies $x\neq y$, and for any different $x,y \in G$ either $x < y$ or $y < x$ and such that for any $x,y,z \in G$ we have that $x < y$ implies that $zx < zy$ (i.e., $<$ defines a left-invariant strict total order)
  2. $\{(x,y):x<y\}$ is open?
Source Link
Pablo
  • 11.3k
  • 2
  • 22
  • 68

Is there a left orderable profinite group?

Is there a profinite group $G$ with a binary transitive relation $<$ such that for any different $x,y \in G$ either $x < y$ or $y < x$ and such that for any $x,y,z \in G$ we have that $x < y$ implies that $zx < zy$ ?