OpenAlex ·

The existence of the compatible lattice order on the complex field $\mathbb{C}$

Zhengmao He

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2610.37155
Original
Read it at the publisher
Topics
Computational ComplexityGeometric TopologyNumber Theory

Abstract

In this paper, we give an affirmative answer to the open question posed by G.Birkhoff and R.S.Pierce in 1956 concerning the existence of a compatible lattice order on the complex field $\mathbb{C}$. Using valuation rings theory, basis extension in infinite-dimensional vector spaces and extension of field embeddings to algebraic extensions, we obtain that for every real $t>1$ transcendental over $\mathbb{Q}$, the compatible lattice order can be chosen such that $0\prec1$, $0\vee i=t$, and $1\wedge t=0$. Consequently, $\mathbb{C}$ admits at least $2^{\aleph_0}$ distinct compatible lattice orders, each extending the usual order on $\mathbb{Q}$.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Computational Complexity

Get the few papers worth your time in Computational Complexity every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics