# Maximum theoretical compression ratio for real-valued data

Given a sequence of $$N$$ real-valued vectors $$\mathbf{v_1}, \mathbf{v_2}, ..., \mathbf{v_N}$$, each of dimension $$d$$, do any of the below bounds exist?

1. The minimum number of real-valued vectors of dimension $$d$$ such that the original vectors can be reconstructed with bounded error (in other words, is there a function that maps the new set of vectors to the original set of vectors with bounded error)?

2. Given $$K$$ vectors, each of dimension $$d$$, what is the minimum error that can be incurred when compressing the original $$N$$ vectors into these $$K$$ vectors and then reconstructing them?

We can assume that the original vectors are I.I.D.

• Please ask only one question per post. I suggest asking the two questions separately. I suggest being more explicit about the problem statement and the requirements.
– D.W.
Commented Dec 25, 2023 at 5:40
• For question 1, I don't understand what you are asking. Must the additional vectors be chosen before knowing $v_1,\dots,v_N$, or can they depend on $v_1,\dots,v_N$? What metric are you using for error? I don't see how to guarantee bounded error without more restrictions on $v_1,\dots,v_N$, as we could choose a coefficient to $v_1$ some incredibly large number. Can you provide any results for special cases, e.g., small values of $d$ or $N$?
– D.W.
Commented Dec 25, 2023 at 5:40
• @D.W. The number of vectors need to be chosen, but the contents depend on the input vectors. The metric is Mean Squared Error after decoding. There are no spacial cases as such, we can assume a fix size of $d$ to be 64 for example. Commented Dec 25, 2023 at 14:13
• Please don't put clarifications in the comments. Instead, please edit your question to make it clear and read well for someone who encounters it for the first time. Do you allow sending extra information in addition to the vectors sent? Do you allow the number of additional vectors to depend on $v_1,\dots,v_N$, or is it only allowed to depend on $N$? Do you want a bound that depends only on $N$, or on all of $v_1,\dots,v_N$, or on some quantities for $N$? What encoding/decoding approaches have you tried so far?
– D.W.
Commented Dec 25, 2023 at 21:29
• What operations do you allow? Due to cardinality there's a bijection. Commented Dec 26, 2023 at 19:03

With the problem as stated, you can compress the $$N$$ real-valued vectors into $$K$$ real-valued vectors, and reconstruct the original $$N$$ vectors exactly.
How does this work? Suppose you want to compress two real-valued vectors into one real-valued vector. Expand all the real numbers in binary. Use the even bits to specify the first vector and the odd bits for the second vector. Similar schemes will work for any $$K$$ and $$N$$.