Proving U(d1,...,dp) is open and a basis for the Hamming metric

Join the discussion
Registration is free. Start your own thread to ask a follow-up.
70 replies · 8K views
Metric_Space said:
at the jth position, say?

For example, yes.
 
Physics news on Phys.org
I'm thinking it can be written as a combination of other elements in U?
 
I don't see how that would help. You need to show that if [itex](x_1,x_2,x_3,...)[/itex] contains a zero, then

[tex]\sum_{k=1}^{+\infty}{\frac{x_k}{2^k}}<1[/tex]

This is really not difficult...

Let's say I have positve real numbers x,y,z>0 such that x+y+z=1, can I infer that x+y<1?
 
Isn't it because that means the sum above is the difference of two other sums?
 
Metric_Space said:
Isn't it because that means the sum above is the difference of two other sums?

I'm not sure what you mean. Which other sums?
 
one that sums to one, and one that has a zero at the kth entry?
 
Yes, indeed!

So, now we have shown that only (1,1,1,...) has the property that

[tex]\sum_{k=1}^{+\infty}{\frac{x_k}{2^k}}=1[/tex].

So, can you now describe the ball around (0,0,0,...) with radius 1?
 
Would it be all entries are 1? But it wouldn't be finite...would it?
 
Metric_Space said:
Would it be all entries are 1? But it wouldn't be finite...would it?

No, this isn't correct. I want you to find the set

[tex]\left\{(x_1,x_2,x_3,...)~\mid~\sum_{k=1}^{+\infty}{\frac{x_k}{2^k}}<1\right\}[/tex]

So...
 
Isn't that just all the (x_1,x_2, ...) minus the entry with (1,1,1,1...)?
 
Indeed, so the ball around (0,0,0,...) with radius 1 is everything except (1,1,1,1,...).
So, now the obvious generalization: what is the ball around [itex](a_1,a_2,a_3,...)[/itex] with radius 1?
 
Uuh, no, I get the impression that you're just guessing here.

Obviously a=(a1,a2,a3,...) will be in the ball, since d(a,a)=0<1.
Moreover, we have just calculated that the ball around (0,0,0,...) is everything but (1,1,1,...). Thus (0,0,0,...) is in the ball...
 
For what sequence [itex](x_n)_n[/itex], does

[tex]\sum_{k=1}^{+\infty}{\frac{|x_k-a_k|}{2^k}}=1[/tex]

It's basically the same as my last question (when the ak were simply 0). What must hold for |xk-ak| in order for the above series to be 1?
 
Metric_Space said:
|X_k-a_k| --> 0 as k--> infinity?

No. I don't know how you got that?
You do know that [itex]\frac{1}{2^k}|X_k-a_k|\rightarrow 0[/itex], but I fail to see how it is relevant here...
 
Yes! Very good!

So, if |xk-ak|=1, then what will xk be? (Remember that xk and ak can only take on 0 and 1 here).
 
Metric_Space said:
x_k=1, a_k=0 or a_k=1,x_k=0 ...is that right?

Very nice! So, basically, ak has the opposite value of xk...
Remark that this correspons nicely with the previous thingies where a was (0,0,0,...), then x was (1,1,1,...).

So, the ball around a with radius 1 is just everything except the "opposite of a")!

Now, we're going to make it a little harder. We're going to figure out what the ball around (0,0,0,...) is with radius 1/2. So, for which vectors does

[tex]\sum_{k=1}^{+\infty}{\frac{x_k}{2^k}}<\frac{1}{2}[/tex]

As above, you may remark that it suffices to calculate when equality holds, thus

[tex]\sum_{k=1}^{+\infty}{\frac{x_k}{2^k}}=\frac{1}{2}[/tex]

Since if x has a distance of 1/2 of 0, then all vectors with less 1's than x, have distance <1/2. And this is exactly what we wanted...
 
Metric_Space said:
Would (x_1,x_2,x_3...) = (0,1,1,...)?

Yes that's good, but there is one more possibility!
 
Yes, very good! So elements in the ball around 0 with radius 1/2 consist of those elements with more zeroes than either (1,0,0,...) or (0,1,1,...).

Now, can you describe the ball around an arbitrary a with radius 1/2?
 
balls of radius (1/2)^k have elements

with 1's starting in the kth position and 0's afterwards OR 1's in the (K+1)st position...right?
 
Metric_Space said:
balls of radius (1/2)^k have elements

with 1's starting in the kth position and 0's afterwards OR 1's in the (K+1)st position...right?

No, but you have the right idea. What you describe are the sequences such that

[tex]\sum_{k=1}^{+\infty}{\frac{x_k}{2^k}}=\frac{1}{2^n}[/tex]

To describe the balls, you'll need < instead of =. So the balls would be the elements which has less 1's than the elements that you describe.

Also, that only describes the balls around 0. It would be fun if you would find the balls around arbitrary elements...