Directed partial orders on the complex number field

summary

The gist

We construct a class of positive cones that make C into a directed partially ordered ring <ref:2609.20494#pg2> The nonzero positive elements are closed under inversion <ref:2609.20494#pg4> None of…

In short

The paper constructs a family of positive cones that define directed partial orders on the complex numbers C. These orders are built using integral closures of local rings related to a transcendence basis and a real generator. The construction yields an order where nonzero positive elements are closed under inversion, but none of these specific orders form lattice orders, suggesting C does not admit such an order.

Key concepts

Positive Cone (P)
A set P is defined using integers and a real generator related to the field structure. This set P defines a directed ring order on C. It contains 1 and ensures that for any complex number z, there are elements in P greater than πN + z and πN - z for some integer N.
Directed Partial Order
This is a specific way to compare elements in the complex numbers. The paper uses these orders to show structural properties of C. A key finding is that none of the constructed orders are lattice orders, meaning there isn't always a least upper bound or greatest lower bound for every pair of elements.
Integral Closure
This concept relates to algebraic structures within rings. The paper uses integral closures of local rings associated with a transcendence basis to define the positive cones. This ensures the order is tied to specific algebraic properties derived from the field's structure.
Generator Equivalence Criterion
Two real generators define the same cone if and only if they differ by an affine map with a positive real-algebraic slope and a translation that is algebraic over the base field. This provides a concrete mathematical test to determine when two different constructions result in identical orders.

Terminology used across episodes

This episode discusses

The paper

Directed partial orders on the complex number field · Read on arXiv

School of Mathematical Sciences, Shanghai Jiao Tong University · Shanghai Innovation Institute

Transcript

Introduction to the show: ident: Mathematics. The day in mathematics: new theorems, new proofs, and what they open.

Ada: We're looking at the paper: "Directed partial orders on the complex number field".

Emmy: Here's the gist of the paper. We construct a class of positive cones that make C into a directed partially ordered ring <ref:2609.20494#pg2> The nonzero positive elements are closed under inversion <ref:2609.20494#pg4> None of these orders is a lattice order <ref:2609.20494#pg6>.

Ada: Pruning redundant reasoning tokens The paper constructs a class of positive cones that define directed partial orders on the complex field C using integral closures of local rings associated with a transcendence basis and a chosen real generator <ref:2609.20494#pg2> A localization criterion is also yielded such orders on every transcendental extension of Q <ref:2609.20494#pg2> For a fixed coefficient field, the paper proves that two real generators define the same cone if and only if they differ by an affine map with positive real-algebraic slope and translation algebraic over that field <ref:2609.20494#pg4>.

Emmy: The nonzero positive elements are closed under inversion <ref:2609.20494#pg4>.

Ada: None of these orders is a lattice order <ref:2609.20494#pg6>.

Title and authors: Ada: So we're looking at this paper today called "Directed partial orders on the complex number field." It's about building a structure on the complex numbers C that makes it a directed partially ordered ring.

Emmy: Right. Essentially, they construct these positive cones using integral closures of local rings tied to some transcendence basis and a real generator. This allows them to define an order where you have this specific structure, not just any random ordering on complex numbers C.

Kolya: What I find interesting is that they show this construction works for every transcendental extension of the rational numbers Q as well. That means we're not stuck only looking at the complex field C itself, but this method applies to a whole class of fields with positive transcendence degree over Q.

Ada: Exactly. And they have a localization criterion too, which is really useful because it lets you get these orders on every transcendental extension of Q. They also establish a condition for when two different real generators define the exact same cone structure, which is pretty neat for understanding the families of these orders they create.

Emmy: That equivalence condition is key; they show that two generators are equivalent if one can be transformed into the other by an affine map with a positive real-algebraic slope and a translation algebraic over some fixed field. That gives us a concrete way to check if we're looking at the same ordering structure.

Ada: And they also proved that these nonzero positive elements are closed under inversion, which is another important property for any ring order we're dealing with here. But there’s a catch, because none of these orders turn out to be lattice orders.

Kolya: That's the part I wanted to focus on. So they show these directed partial orders exist and are well-behaved, but they aren't lattice orders. That means for any pair of elements in this ordering, there might not be a least upper bound or a greatest lower bound.

Emmy: Precisely. So, while the structure is directed—meaning every pair has a common upper and lower bound—it doesn't have the stronger property of being a lattice order. That’s important because it tells us something about the complexity of ordering on complex numbers C.

Title and authors: Ada: And they also looked at some specific examples, like i and sqrt pi, to show how this ordering differs from the standard order we're used to on real numbers. It shows that even with these constructed orders, certain elements can still be incomparable with zero.

Kolya: I was looking at the example where they showed i is incomparable with zero because neither i nor its negative belongs to their intersection of the positive cone and the rational numbers. That's a concrete way to see how the construction affects basic arithmetic elements like i.

Emmy: And when you look at sqrt pi, they found that it’s also incomparable with zero because if it were positive, its square would force a contradiction related to the size of integers. It really highlights how much these constructed orders diverge from intuition.

Ada: So, what does this mean for us? It tells us that while we can construct many directed partial orders on complex numbers using these algebraic tools, the standard lattice order compatible with complex operations doesn't exist in this family.

Kolya: For someone just listening to the show, it means that the structure of ordering on C is richer than just a single total order. There are different ways to partially order things that respect the ring structure but don't satisfy all the properties of a lattice.

Emmy: And this whole construction relies on these lemmas about units in subrings and theorems establishing cone axioms, which are the machinery that lets them prove this structure exists in the first place. It’s a deep connection between field theory and order theory.

Ada: So, looking ahead at what they suggest for improvements, they focus on criteria that allow you to compare these different constructions more systematically across various coefficient fields. They want to know when two different pairs of fields and generators define the same cone structure.

Kolya: That comparison tool is pretty powerful because it boils down the equivalence to checking if one generator can be written as an affine map of another, with a positive real-algebraic slope and some translation algebraic over that field. It’s a very specific algebraic check.

Title and authors: Emmy: And they also established a condition for when two different pairs of cones, say P(R, t) and P(R', s), are identical. They found it's equivalent to the rings R and R' being the same and the ratio of their generators, t over s, being in a specific set defined by positive real-algebraic slope and translation algebraic over that field.

Ada: That simplifies things a lot for comparing different constructions. It means you don't need to check every single element in the cones; you just check the structure of the underlying rings and generators. That’s a nice simplification.

Kolya: And they found that if two generators T and U are related by an affine map, say U = aT + b, where a is positive real-algebraic and b is algebraic over the base field, then the cones generated by them are identical. That's a very concrete relationship between the generators.

Emmy: So, the core idea they push here is that for a fixed ring R, the set of all possible generators that produce this cone structure is highly constrained by linear transformations and translations over algebraic extensions of R. It really structures how these orders are generated.

Ada: And in conclusion, the paper "Directed partial orders on the complex number field" shows us a rich family of directed partial orders on C built from integral closures of local rings. They establish a criterion for when generators produce the same cone and prove that none of these orders are lattice orders.

Kolya: For anyone interested in where this leads, it suggests that the structure of ordering on complex fields is much more flexible than previously thought, with these directed partial orders existing outside the usual lattice order framework. It opens up avenues for studying how algebraic structures interact with orderings in a way that isn't always captured by simple total orders.

Emmy: So, to wrap up, this paper gives us a concrete construction using integral closures and generators for defining directed partial orders on C, and it provides the necessary machinery to compare these constructions across different fields. It’s about understanding the algebraic constraints that dictate which orderings are possible.

Ada: That's it for today on "Directed partial orders on the complex number field." We've seen how these positive cones give us a new way to look at ordering on complex numbers, and how they relate to different algebraic structures.

The paper's summary: Ada: So, to recap, the paper is about building these directed partial orders on complex numbers using specific algebraic tools like integral closures of local rings tied to some real generator and a transcendence basis.

Emmy: Right. They prove that these cones define a directed ring order on complex numbers C and they establish how to check if two different generators create the same ordering structure through an affine map criterion.

Ada: And the big takeaway from their summary is that they show this construction works not just for complex numbers, but for any field with positive transcendence degree over rational numbers Q.

Emmy: They also have a way to compare different pairs of constructions by looking at the integral closures and generators of the rings involved, which simplifies comparing orders across different base fields.

Ada: It’s really about showing that there are many ways to partially order complex numbers while keeping them consistent with how we do multiplication and addition in algebra.

Emmy: And they prove that none of these orders are lattice orders, meaning for some pairs of elements, you just won't find a least upper bound or a greatest lower bound.

Ada: That’s important because it tells us that the complexity of ordering on complex numbers is deeper than just one single way to order everything.

Emmy: It opens up this whole family of structures where you have these directed partial orders instead of just one standard lattice order.

Ada: Which leads us right into some specific examples they look at, like how i and sqrt pi behave under these new orders.

Emmy: They show that even with these constructed orders, certain basic elements like i can still be incomparable to zero in a way that defies our usual intuition.

Ada: And they also look at the conditions under which two cones are identical, which boils down to the rings being the same and a specific relationship between their generators.

Emmy: So, we have this machinery for constructing these orders, criteria for comparing them, and examples of how strange these orderings can be.

Ada: It really shows that there’s a lot more structure hiding in the ordering of complex numbers than we usually see in one single type of order.

Emmy: This points toward a richer landscape where different algebraic choices lead to different ways to partially order things.

The paper's improvements: Ada: So, looking at how they suggest improving things, they focus on making those comparisons between different constructions much more systematic.

Emmy: Right. They want a way to check when two pairs of fields and generators define the exact same cone structure across different coefficient fields, not just for one specific set of numbers.

Ada: They found this by using the integral closures and looking at when the ratio of those generators is in a specific set defined by positive real-algebraic slope and translation algebraic over that field.

Emmy: That means they’ve found a concrete way to compare P(R, t) and P(R', s) without having to check every single element in those cones.

Ada: It simplifies the whole process because it boils down the equivalence to checking if the underlying rings are identical and that specific generator relationship holds true.

Emmy: And they also suggested a condition for when two generators, say T and U, produce the same cone structure, which is if one can be written as an affine map of the other with a positive real-algebraic slope and some translation algebraic over the base field.

Ada: That’s a very specific algebraic check that gives us a way to tell if two different generators are actually generating the same partial order structure.

Emmy: So, they’re giving us tools to move from just proving existence to having a more practical system for classifying these orders.

Ada: It sounds like the next step is using this comparison tool to see how these structures behave when we start mixing them with other algebraic objects.

Emmy: Exactly. They are setting up a framework where you can compare different ways of building these partial orders based on the underlying field theory, rather than just looking at the resulting set of numbers.

Conclusion: Ada: So, to wrap up, this paper on "Directed partial orders on the complex number field" shows that we can build these directed structures using integral closures of local rings and real generators.

Emmy: And they nail down how to compare those different constructions using algebraic criteria involving affine maps and those specific generator relationships.

Ada: It really expands our view on ordering complex numbers by showing a whole family of possible structures that aren't just the standard lattice order we usually deal with.

Emmy: They prove these orders exist for any field with positive transcendence degree over rational numbers Q, which is a pretty broad result for their methodology.

Kolya: From my end, the key finding is that they can determine if two different generators create the same cone structure by checking that transformation criterion; that’s a concrete way to check equivalence.

Ada: Right. And they also show that while these orders are directed, they aren't lattice orders because elements like i can still be incomparable to zero in some cases.

Emmy: It means the structure is richer than just one type of order; there’s a whole family of partially ordered rings we can define on complex numbers C.

Kolya: I wonder if these constraints on the generators survive when you try to apply them to more complex probabilistic models; whether these constants stay finite is something that needs checking in practice.

Ada: We need to keep looking at those applications, because understanding how different algebraic choices constrain orderings could help us understand more complex mathematical systems.

Emmy: This opens the door for future work on how these partial orders interact with other structures, like those we see in birational geometry papers or perhaps even those queueing network models.

More episodes

← Home