When I'm teaching Linear Algebra, I'm often interested in finding orthogonal vectors with integer entries as I'm looking for examples that are easy to work in the classroom. In this context, I'm wondering whether the following statement holds true for all positive integers n > 1 :
For every vector v in Z n with an integer magnitude ∣ ∣ v ∣ ∣ there exists an orthogonal vector w in Z n such that ∣ ∣ v ∣ ∣ = ∣ ∣ w ∣ ∣ .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Great answer, Brian! This is exactly the counterexample I had in mind (thus the heading!). Let us know what you find out about the cases of n = 3 , 5 , 7 .
Log in to reply
This paper discusses when an integer M is twin-complete, namely when any vector in Z 3 of length M possesses an orthogonal integer vector of the same length.
It is stated there that m 2 is twin-complete for any integer m , which means that every vector in Z 3 of integer length has an integer orthogonal vector of the same length, which seems to wrap up the case n = 3 .
Higher order cases are not considered in the paper, but the fact that not all integers are twin-complete leaves enough room to allow for the fact that n = 9 does not work. The list of exactly which integers are twin-complete seems to be contingent on the truth of the Riemann Hypothesis, but we await more data before we know whether this has been settled by Michael Atiyah!
Log in to reply
Thanks for sharing! I first got interested in these kinds of questions from a practical point of view, as I was trying to construct orthogonal matrices with rational entries for my linear algebra classes, and I was asking myself how much freedom one has to do so, row by row.
I'm surprised to read that "Not all integer vectors in Z 3 of integer length belong to an orthogonal basis of integer vectors, all of the same length, though." I was under the impression that such a "completion" is always possible (up to Z 8 ). Do you have a counter example?
Log in to reply
@Otto Bretscher – An overstatement, it seems. A previous paper I was looking at had a calculational technique which did not always work. This paper , however, seems to show that we have a positive answer to the completion problem (can an integer vector in Z n of integer length) be embedded in an orthogonal set of integer vectors, all of the same length) is true for all n up to (but, of course, not including) 9 .
Log in to reply
@Mark Hennings – Yes, exactly! More importantly for the linear algebra teacher eager to construct rational orthogonal matrices, rational completion seems to work in all dimensions: A list of orthonormal vectors in Q n can always be completed to a rational orthogonal matrix.
v = {3,4,12} is orthogonal to {{4, -12, 3}, {-4, 12, -3}, {12, 3, -4}, {-12, -3, 4}}
I have found similar cases in n=5 and n=7. I didn't try further.
Problem Loading...
Note Loading...
Set Loading...
For n = 9 , set v = ( 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 , 1 ) . Then any orthogonal w = ( w 1 , w 2 , w 3 , w 4 , w 5 , w 6 , w 7 , w 8 , w 9 ) ∈ Z 9 satisfies k = 1 ∑ 9 w k = v ⋅ w = 0 which in particular means w k is odd for an even number of values of k , so ∣ ∣ w ∣ ∣ 2 = k = 1 ∑ 9 w k 2 is even. Therefore, ∣ ∣ w ∣ ∣ = 3 = ∣ ∣ v ∣ ∣ .
Since this shows any orthogonal w ∈ Z 9 has ∣ ∣ w ∣ ∣ = ∣ ∣ v ∣ ∣ , the answer is false .
Notes: