Is there an order-embedding from \mathbb Z^\infty to \mathbb Q for my paper?

  • Thread starter heptheorist
  • Start date
In summary, the conversation discusses the possibility of an explicit order-embedding from the direct sum of infinitely many copies of integers ordered lexicographically to the set of rational numbers. The suggestion is to define a function that maps each integer to a specific rational number, and then use this function to determine the position of all 1-letter words. This can then be extended to longer words by using the space between them. The proposed function is g(a_0,a_1,...) = \sum_i \left(f(a_i) \prod_{n=0}^{i-1} d(a_n)\right), which results in a rational number since it adds up a finite number of non-zero values.
  • #1
heptheorist
2
0
For a paper I'm writing: Does anyone know of an explicit order-embedding (i.e. an order-preserving function) from [itex]\mathbb Z^\infty[/itex], the direct sum of infinitely many copies of the integers ordered lexicographically, to [itex]\mathbb Q[/itex], the rationals? It need not be a surjective embedding, but that would be a plus (obviously the two sets are order isomorphic).
 
Physics news on Phys.org
  • #2
What about this?

First, define a function [itex]f: \mathbb Z \to (0,1) \cap \mathbb Q[/itex], something like
0 -> 1/2
n -> 1 - 1/(2n) for i>0
n -> -1/(2n) for i<0

This allows to order individual "letters" (I like the analogy, I will keep it).
Use this function to evaluate the position of all 1-letter-words. In addition, the space to the next word can be used for all words beginning with this letter, in a similar way (0,1) was used for 1-letter-words. Let d(n)=f(n+1)-f(n) be this space.

Now, let [itex]g: \mathbb Z^\infty \to \mathbb Q[/itex] with
[tex]g(a_0,a_1,...) = \sum_i \left(f(a_i) \prod_{n=0}^{i-1} d(a_n)\right)[/tex]

I hope this works...
As the sum adds up a finite number of non-zero values, the result is rational.
 
  • #3
This is a great idea, exactly what I wanted. Thank you!
 

FAQ: Is there an order-embedding from \mathbb Z^\infty to \mathbb Q for my paper?

1. What is "Order-Embedding to Rationals"?

"Order-Embedding to Rationals" is a mathematical concept that refers to the process of representing a partially ordered set (such as the real numbers) as a subset of the rational numbers. This allows for the comparison of elements within the set using the standard ordering of rational numbers.

2. Why is "Order-Embedding to Rationals" important?

"Order-Embedding to Rationals" is important because it provides a way to compare and order elements in a partially ordered set that may not have a clear numerical or geometric representation. This allows for the use of mathematical tools and techniques to analyze and understand the set.

3. How is "Order-Embedding to Rationals" used in scientific research?

"Order-Embedding to Rationals" is used in a variety of scientific fields, such as economics, computer science, and biology. It is often used to analyze and compare complex systems and networks, where the relationships between elements may not be easily quantifiable.

4. Are there any limitations to "Order-Embedding to Rationals"?

Yes, there are some limitations to "Order-Embedding to Rationals". In some cases, the embedding may not be unique, meaning different representations of the same partially ordered set may exist. Additionally, the embedding may not preserve all of the properties of the original set, which can affect the accuracy of comparisons.

5. What are some potential applications of "Order-Embedding to Rationals"?

"Order-Embedding to Rationals" has potential applications in various fields, including data analysis, network analysis, and optimization problems. It can also be used in decision-making processes, where comparisons and rankings of various options are needed.

Similar threads

Replies
28
Views
5K
Replies
18
Views
2K
Replies
9
Views
2K
2
Replies
61
Views
11K
3
Replies
86
Views
11K
3
Replies
93
Views
12K
Back
Top