Prove the ratio of the length and width of the rectangle is rational.
$begingroup$
Assume there is a rectangle be combined by finite squares, and the small squares are not of equal size. Also, the lengths of the squares may be irrational.
The question is "Can we know the ratio of the length and width of this rectangle is rational ?"
I guess the answer is "yes!"(by considering many cases). However, I have no idea to prove it.
geometry
$endgroup$
|
show 1 more comment
$begingroup$
Assume there is a rectangle be combined by finite squares, and the small squares are not of equal size. Also, the lengths of the squares may be irrational.
The question is "Can we know the ratio of the length and width of this rectangle is rational ?"
I guess the answer is "yes!"(by considering many cases). However, I have no idea to prove it.
geometry
$endgroup$
$begingroup$
Are you requiring that no two of the small squares be congruent or just that they aren't all congruent?
$endgroup$
– lulu
Dec 19 '18 at 14:44
$begingroup$
The question does not condition that. In fact, they may be all congruent, but this case would be very simple, And my teacher ask me to consider the cases they are not all congruent, and give a proof.
$endgroup$
– user627221
Dec 19 '18 at 14:50
1
$begingroup$
I think you can prove by induction that the smallest square can be used as the standard tile and all other squares can be tiled by it, so that you end up with a rectangular grid of same-size squares.
$endgroup$
– Max Freiburghaus
Dec 19 '18 at 15:05
$begingroup$
Gut feeling: There is a proof technique similar to Dehn invariants lurking here.
$endgroup$
– Chris Culter
Dec 19 '18 at 17:49
1
$begingroup$
@ChrisCulter you are right, insofar as this result was originally proved by Max Dehn. :-)
$endgroup$
– Josse van Dobben de Bruyn
Dec 19 '18 at 19:49
|
show 1 more comment
$begingroup$
Assume there is a rectangle be combined by finite squares, and the small squares are not of equal size. Also, the lengths of the squares may be irrational.
The question is "Can we know the ratio of the length and width of this rectangle is rational ?"
I guess the answer is "yes!"(by considering many cases). However, I have no idea to prove it.
geometry
$endgroup$
Assume there is a rectangle be combined by finite squares, and the small squares are not of equal size. Also, the lengths of the squares may be irrational.
The question is "Can we know the ratio of the length and width of this rectangle is rational ?"
I guess the answer is "yes!"(by considering many cases). However, I have no idea to prove it.
geometry
geometry
edited Dec 19 '18 at 15:28
asked Dec 19 '18 at 14:33
user627221
$begingroup$
Are you requiring that no two of the small squares be congruent or just that they aren't all congruent?
$endgroup$
– lulu
Dec 19 '18 at 14:44
$begingroup$
The question does not condition that. In fact, they may be all congruent, but this case would be very simple, And my teacher ask me to consider the cases they are not all congruent, and give a proof.
$endgroup$
– user627221
Dec 19 '18 at 14:50
1
$begingroup$
I think you can prove by induction that the smallest square can be used as the standard tile and all other squares can be tiled by it, so that you end up with a rectangular grid of same-size squares.
$endgroup$
– Max Freiburghaus
Dec 19 '18 at 15:05
$begingroup$
Gut feeling: There is a proof technique similar to Dehn invariants lurking here.
$endgroup$
– Chris Culter
Dec 19 '18 at 17:49
1
$begingroup$
@ChrisCulter you are right, insofar as this result was originally proved by Max Dehn. :-)
$endgroup$
– Josse van Dobben de Bruyn
Dec 19 '18 at 19:49
|
show 1 more comment
$begingroup$
Are you requiring that no two of the small squares be congruent or just that they aren't all congruent?
$endgroup$
– lulu
Dec 19 '18 at 14:44
$begingroup$
The question does not condition that. In fact, they may be all congruent, but this case would be very simple, And my teacher ask me to consider the cases they are not all congruent, and give a proof.
$endgroup$
– user627221
Dec 19 '18 at 14:50
1
$begingroup$
I think you can prove by induction that the smallest square can be used as the standard tile and all other squares can be tiled by it, so that you end up with a rectangular grid of same-size squares.
$endgroup$
– Max Freiburghaus
Dec 19 '18 at 15:05
$begingroup$
Gut feeling: There is a proof technique similar to Dehn invariants lurking here.
$endgroup$
– Chris Culter
Dec 19 '18 at 17:49
1
$begingroup$
@ChrisCulter you are right, insofar as this result was originally proved by Max Dehn. :-)
$endgroup$
– Josse van Dobben de Bruyn
Dec 19 '18 at 19:49
$begingroup$
Are you requiring that no two of the small squares be congruent or just that they aren't all congruent?
$endgroup$
– lulu
Dec 19 '18 at 14:44
$begingroup$
Are you requiring that no two of the small squares be congruent or just that they aren't all congruent?
$endgroup$
– lulu
Dec 19 '18 at 14:44
$begingroup$
The question does not condition that. In fact, they may be all congruent, but this case would be very simple, And my teacher ask me to consider the cases they are not all congruent, and give a proof.
$endgroup$
– user627221
Dec 19 '18 at 14:50
$begingroup$
The question does not condition that. In fact, they may be all congruent, but this case would be very simple, And my teacher ask me to consider the cases they are not all congruent, and give a proof.
$endgroup$
– user627221
Dec 19 '18 at 14:50
1
1
$begingroup$
I think you can prove by induction that the smallest square can be used as the standard tile and all other squares can be tiled by it, so that you end up with a rectangular grid of same-size squares.
$endgroup$
– Max Freiburghaus
Dec 19 '18 at 15:05
$begingroup$
I think you can prove by induction that the smallest square can be used as the standard tile and all other squares can be tiled by it, so that you end up with a rectangular grid of same-size squares.
$endgroup$
– Max Freiburghaus
Dec 19 '18 at 15:05
$begingroup$
Gut feeling: There is a proof technique similar to Dehn invariants lurking here.
$endgroup$
– Chris Culter
Dec 19 '18 at 17:49
$begingroup$
Gut feeling: There is a proof technique similar to Dehn invariants lurking here.
$endgroup$
– Chris Culter
Dec 19 '18 at 17:49
1
1
$begingroup$
@ChrisCulter you are right, insofar as this result was originally proved by Max Dehn. :-)
$endgroup$
– Josse van Dobben de Bruyn
Dec 19 '18 at 19:49
$begingroup$
@ChrisCulter you are right, insofar as this result was originally proved by Max Dehn. :-)
$endgroup$
– Josse van Dobben de Bruyn
Dec 19 '18 at 19:49
|
show 1 more comment
3 Answers
3
active
oldest
votes
$begingroup$
The problem is equivlaent to the following statement:
A rectangle with sides 1 and $x$, where $x$ is irrational, cannot be "tiled" by finitely many squares.
It turns out this is a well known problem and the the proof is copied below from the following source:
http://circuit.ucsd.edu/~yhk/ece269-win18/pdfs/matousek.pdf
However I could not find the name of the author.
$endgroup$
$begingroup$
Since it resides in a folderhttp://circuit.ucsd.edu/~yhk/
belonging to Young-Han Kim, I do not know if he is the author?
$endgroup$
– Jeppe Stig Nielsen
Dec 19 '18 at 20:08
5
$begingroup$
Actually, this is from Jiřì Matoušek, Thirty-three Miniatures: Mathematical and Algorithmic Applications of Linear Algebra (2010), AMS Student Mathematical Library, number 53. A preliminary version of this book can be found on the website of the late professor Matoušek: kam.mff.cuni.cz/~matousek/stml-53-matousek-1.pdf .
$endgroup$
– Josse van Dobben de Bruyn
Dec 19 '18 at 20:13
$begingroup$
@JossevanDobbendeBruyn Thanks, the proof is now complete.
$endgroup$
– Oldboy
Dec 19 '18 at 22:15
add a comment |
$begingroup$
Indeed, the ratio between length and width must be rational, even if we don't require the squares to be of different size. The first proof of this was given by Max Dehn [Deh03]. A short and elegant proof appears in Proofs from THE BOOK (see [AZ14, Chapter 28]). Furthermore, I worked out a very similar proof in [Dob16], which I intended to be accessible to undergraduate mathematics students at my university. (It is unclear to me who first conceived of this proof; the original proof of Dehn seems to be much more involved.)
A short sketch of the ideas behind this proof: let $s_1,ldots,s_n$ denote the lengths of the sides of the squares in the tiling, and let $w,h$ denote the width and height of the large rectangle. Furthermore, let $mathscr{L} subseteq mathbb{R}$ be the $mathbb{Q}$-vector subspace of $mathbb{R}$ spanned by $s_1,ldots,s_n$. (In other words: $mathscr{L}$ is the set of all rational linear combinations of $s_1,ldots,s_n$.)
The first important observation is this: for an arbitrary $mathbb{Q}$-vector space $V$ and an arbitrary $mathbb{Q}$-bilinear map $f : mathscr{L} times mathscr{L} to V$, one has
$$ f(w,h) = sum_{i=1}^n f(s_i,s_i).tag{1} $$
Intuitively, this is generalising the idea that the area of the original rectangle is the sum of the areas of the squares in the tiling. Indeed, the usual area function occurs as a special case, if we choose $V = mathbb{R}$ and $f(x,y) = xcdot y$. (For a more detailed proof of (1), see [Dob16, Lemma 3.2].)
Now, if $varphi : mathscr{L} to mathbb{Q}$ is any linear form, we may consider the $mathbb{Q}$-bilinear map $f_varphi : mathscr{L} times mathscr{L} to mathbb{Q}$ given by $f_varphi(x,y) = varphi(x) cdot varphi(y)$. By (1), we have
$$ varphi(w)cdot varphi(h) = f_varphi(w,h) = sum_{i=1}^n f_varphi(s_i,s_i) = sum_{i=1}^n varphi(s_i)^2 geq 0. $$
In particular, if $varphi(w) = 0$, then we must have $varphi(s_1) = cdots = varphi(s_n) = 0$, and therefore $varphi = 0$ (since $mathscr{L}$ is spanned by $s_1,ldots,s_n$). From this it is easy to see that $mathscr{L}^*$, and therefore $mathscr{L}$, is at most one-dimensional. Clearly we also have $dim(mathscr{L}) geq 1$, since it contains non-zero numbers, so we conclude that $mathscr{L}$ is one-dimensional.
Since $mathscr{L}$ contains $s_1,ldots,s_n$, it also contains $w$ and $h$. It follows that everything in $mathscr{L}$ is a rational multiple of, say, $w$. In fact, we have proved something stronger: not only the $h$, but also $s_1,ldots,s_n$ are rational multiples of $w$.
References:
[AZ14]: Martin Aigner, Günter M. Ziegler, Proofs from THE BOOK, Fifth Edition, Springer-Verlag Berlin-Heidelberg, 2014.
[Deh03]: M. Dehn, Über Zerlegung von Rechtecken in Rechtecke, Mathematische Annalen, Vol. 57 (1903), Issue 3, pp. 314-332.
[Dob16]: Josse van Dobben de Bruyn, Tiling a rectangle with squares, notes for the course SPC taught at Leiden University, available here.
$endgroup$
add a comment |
$begingroup$
For integer $n ge 1$, let $[n]$ be a short hand for the interval of integers ${ 1, 2,ldots, n }$.
Let ${ s_1, s_2, ldots, s_p }$ be the set of sides of a bunch of squares that cover a rectangle of dimension $w times h$.
Since $mathbb{R}$ is a vector space over $mathbb{Q}$, there is a hamel basis $E$ of $mathbb{R}$ over $mathbb{Q}$. Every real number can be uniquely expressed as a finite linear combination of elements from $E$ with rational coefficients.
There will be finitely many of $e in E$ that appear in the expansion of $s_1, ldots, s_p$.
Let $e_1, ldots, e_q in E$ be those appear in expansion of some $s_i$.
There will be $p times q$ coefficients $alpha_{ij} in mathbb{Q}, (i,j) in [p] times [q]$ such that
$$s_i = sum_{j=1}^q alpha_{ij} e_jquadtext{ for } i in [p]$$
Furthermore, for each $j in [q]$, there is some $i in [p]$ with $alpha_{ij}ne 0$.
Rescale $e_i$ if necessary, we can assume all $alpha_{ij} in mathbb{Z}$.
Under this setting, it is easy to see we can find integers $w_j, h_j in mathbb{Z}, j in [q]$ such that
$$w = sum_{j=1}^q w_j e_jquadtext{ and }quad h = sum_{j=1}^q h_j e_j$$
For any $j in [q]$, define function $f_j : [0,w] times [ 0, h ] to mathbb{R}$ by $f_j(x,y) = frac{alpha_{ij}}{s_i}$ whenever $(x,y)$ is covered by a square of side $s_i$.
Aside from a set of measure zero, $f_j$ is well defined. It is a piecewise constant function and integrable over $[0,w]times[0,h]$. We can evaluate their integral over $[0,w]times [0,h]$ in two different orders.
Aside from a finite choice of $y_0$, the line $y = y_0$ cut through
finitely many squares "normally". Let $s_{i_1}, s_{i_2}, ldots, s_{i_r}$ be the sides of the squares it cut through. We have
$$int_0^w f_j(x,y_0) dx
= sum_{k=1}^r int_{sum_{ell=1}^{k-1} s_{i_ell}}^{sum_{ell=1}^{k} s_{i_ell}}frac{alpha_{i_ell j}}{s_{i_ell}} dx
= sum_{k=1}^r alpha_{i_ell j}
in mathbb{Z}
$$
Notice
$$sum_{j=1}^q e_j int_0^w f_j(x,y_0) dx =
int_0^w sum_{j=1}^q e_j f_j(x,y_0) dx = int_0^w dx = w$$
We obtain
$$sum_{j=1}^q left(sum_{k=1}^r alpha_{i_ell j}right)e_j
= w = sum_{j=1}^q w_j e_j$$
Since $e_j$ are linear independent over $mathbb{Q}$, we obtain
$$int_0^w f_j(x,y_0) dx = sum_{k=1}^r alpha_{i_ell j} = w_j$$
From this, we can deduce
$$int_0^hint_0^w f_j(x,y) dx dy = w_j h$$
By a similar argument, we have
$$int_0^wint_0^h f_j(x,y) dy dx = h_j w$$
Since these functions are integrable, we have
$$w_j h = int_0^hint_0^w f_j(x,y) dx dy = int_0^wint_0^h f_j(x,y) dy dx = h_j w$$
Since $w ne 0$, some $w_j ne 0$. Let's say $w_1 ne 0$, we have
$w_1 h = h_1 w implies h_1 ne 0$. As a result,
$$frac{w}{h} = frac{w_1}{h_1} in mathbb{Q}$$
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");
StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});
function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});
}
});
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3046451%2fprove-the-ratio-of-the-length-and-width-of-the-rectangle-is-rational%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
3 Answers
3
active
oldest
votes
3 Answers
3
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
The problem is equivlaent to the following statement:
A rectangle with sides 1 and $x$, where $x$ is irrational, cannot be "tiled" by finitely many squares.
It turns out this is a well known problem and the the proof is copied below from the following source:
http://circuit.ucsd.edu/~yhk/ece269-win18/pdfs/matousek.pdf
However I could not find the name of the author.
$endgroup$
$begingroup$
Since it resides in a folderhttp://circuit.ucsd.edu/~yhk/
belonging to Young-Han Kim, I do not know if he is the author?
$endgroup$
– Jeppe Stig Nielsen
Dec 19 '18 at 20:08
5
$begingroup$
Actually, this is from Jiřì Matoušek, Thirty-three Miniatures: Mathematical and Algorithmic Applications of Linear Algebra (2010), AMS Student Mathematical Library, number 53. A preliminary version of this book can be found on the website of the late professor Matoušek: kam.mff.cuni.cz/~matousek/stml-53-matousek-1.pdf .
$endgroup$
– Josse van Dobben de Bruyn
Dec 19 '18 at 20:13
$begingroup$
@JossevanDobbendeBruyn Thanks, the proof is now complete.
$endgroup$
– Oldboy
Dec 19 '18 at 22:15
add a comment |
$begingroup$
The problem is equivlaent to the following statement:
A rectangle with sides 1 and $x$, where $x$ is irrational, cannot be "tiled" by finitely many squares.
It turns out this is a well known problem and the the proof is copied below from the following source:
http://circuit.ucsd.edu/~yhk/ece269-win18/pdfs/matousek.pdf
However I could not find the name of the author.
$endgroup$
$begingroup$
Since it resides in a folderhttp://circuit.ucsd.edu/~yhk/
belonging to Young-Han Kim, I do not know if he is the author?
$endgroup$
– Jeppe Stig Nielsen
Dec 19 '18 at 20:08
5
$begingroup$
Actually, this is from Jiřì Matoušek, Thirty-three Miniatures: Mathematical and Algorithmic Applications of Linear Algebra (2010), AMS Student Mathematical Library, number 53. A preliminary version of this book can be found on the website of the late professor Matoušek: kam.mff.cuni.cz/~matousek/stml-53-matousek-1.pdf .
$endgroup$
– Josse van Dobben de Bruyn
Dec 19 '18 at 20:13
$begingroup$
@JossevanDobbendeBruyn Thanks, the proof is now complete.
$endgroup$
– Oldboy
Dec 19 '18 at 22:15
add a comment |
$begingroup$
The problem is equivlaent to the following statement:
A rectangle with sides 1 and $x$, where $x$ is irrational, cannot be "tiled" by finitely many squares.
It turns out this is a well known problem and the the proof is copied below from the following source:
http://circuit.ucsd.edu/~yhk/ece269-win18/pdfs/matousek.pdf
However I could not find the name of the author.
$endgroup$
The problem is equivlaent to the following statement:
A rectangle with sides 1 and $x$, where $x$ is irrational, cannot be "tiled" by finitely many squares.
It turns out this is a well known problem and the the proof is copied below from the following source:
http://circuit.ucsd.edu/~yhk/ece269-win18/pdfs/matousek.pdf
However I could not find the name of the author.
answered Dec 19 '18 at 19:26
OldboyOldboy
8,4621936
8,4621936
$begingroup$
Since it resides in a folderhttp://circuit.ucsd.edu/~yhk/
belonging to Young-Han Kim, I do not know if he is the author?
$endgroup$
– Jeppe Stig Nielsen
Dec 19 '18 at 20:08
5
$begingroup$
Actually, this is from Jiřì Matoušek, Thirty-three Miniatures: Mathematical and Algorithmic Applications of Linear Algebra (2010), AMS Student Mathematical Library, number 53. A preliminary version of this book can be found on the website of the late professor Matoušek: kam.mff.cuni.cz/~matousek/stml-53-matousek-1.pdf .
$endgroup$
– Josse van Dobben de Bruyn
Dec 19 '18 at 20:13
$begingroup$
@JossevanDobbendeBruyn Thanks, the proof is now complete.
$endgroup$
– Oldboy
Dec 19 '18 at 22:15
add a comment |
$begingroup$
Since it resides in a folderhttp://circuit.ucsd.edu/~yhk/
belonging to Young-Han Kim, I do not know if he is the author?
$endgroup$
– Jeppe Stig Nielsen
Dec 19 '18 at 20:08
5
$begingroup$
Actually, this is from Jiřì Matoušek, Thirty-three Miniatures: Mathematical and Algorithmic Applications of Linear Algebra (2010), AMS Student Mathematical Library, number 53. A preliminary version of this book can be found on the website of the late professor Matoušek: kam.mff.cuni.cz/~matousek/stml-53-matousek-1.pdf .
$endgroup$
– Josse van Dobben de Bruyn
Dec 19 '18 at 20:13
$begingroup$
@JossevanDobbendeBruyn Thanks, the proof is now complete.
$endgroup$
– Oldboy
Dec 19 '18 at 22:15
$begingroup$
Since it resides in a folder
http://circuit.ucsd.edu/~yhk/
belonging to Young-Han Kim, I do not know if he is the author?$endgroup$
– Jeppe Stig Nielsen
Dec 19 '18 at 20:08
$begingroup$
Since it resides in a folder
http://circuit.ucsd.edu/~yhk/
belonging to Young-Han Kim, I do not know if he is the author?$endgroup$
– Jeppe Stig Nielsen
Dec 19 '18 at 20:08
5
5
$begingroup$
Actually, this is from Jiřì Matoušek, Thirty-three Miniatures: Mathematical and Algorithmic Applications of Linear Algebra (2010), AMS Student Mathematical Library, number 53. A preliminary version of this book can be found on the website of the late professor Matoušek: kam.mff.cuni.cz/~matousek/stml-53-matousek-1.pdf .
$endgroup$
– Josse van Dobben de Bruyn
Dec 19 '18 at 20:13
$begingroup$
Actually, this is from Jiřì Matoušek, Thirty-three Miniatures: Mathematical and Algorithmic Applications of Linear Algebra (2010), AMS Student Mathematical Library, number 53. A preliminary version of this book can be found on the website of the late professor Matoušek: kam.mff.cuni.cz/~matousek/stml-53-matousek-1.pdf .
$endgroup$
– Josse van Dobben de Bruyn
Dec 19 '18 at 20:13
$begingroup$
@JossevanDobbendeBruyn Thanks, the proof is now complete.
$endgroup$
– Oldboy
Dec 19 '18 at 22:15
$begingroup$
@JossevanDobbendeBruyn Thanks, the proof is now complete.
$endgroup$
– Oldboy
Dec 19 '18 at 22:15
add a comment |
$begingroup$
Indeed, the ratio between length and width must be rational, even if we don't require the squares to be of different size. The first proof of this was given by Max Dehn [Deh03]. A short and elegant proof appears in Proofs from THE BOOK (see [AZ14, Chapter 28]). Furthermore, I worked out a very similar proof in [Dob16], which I intended to be accessible to undergraduate mathematics students at my university. (It is unclear to me who first conceived of this proof; the original proof of Dehn seems to be much more involved.)
A short sketch of the ideas behind this proof: let $s_1,ldots,s_n$ denote the lengths of the sides of the squares in the tiling, and let $w,h$ denote the width and height of the large rectangle. Furthermore, let $mathscr{L} subseteq mathbb{R}$ be the $mathbb{Q}$-vector subspace of $mathbb{R}$ spanned by $s_1,ldots,s_n$. (In other words: $mathscr{L}$ is the set of all rational linear combinations of $s_1,ldots,s_n$.)
The first important observation is this: for an arbitrary $mathbb{Q}$-vector space $V$ and an arbitrary $mathbb{Q}$-bilinear map $f : mathscr{L} times mathscr{L} to V$, one has
$$ f(w,h) = sum_{i=1}^n f(s_i,s_i).tag{1} $$
Intuitively, this is generalising the idea that the area of the original rectangle is the sum of the areas of the squares in the tiling. Indeed, the usual area function occurs as a special case, if we choose $V = mathbb{R}$ and $f(x,y) = xcdot y$. (For a more detailed proof of (1), see [Dob16, Lemma 3.2].)
Now, if $varphi : mathscr{L} to mathbb{Q}$ is any linear form, we may consider the $mathbb{Q}$-bilinear map $f_varphi : mathscr{L} times mathscr{L} to mathbb{Q}$ given by $f_varphi(x,y) = varphi(x) cdot varphi(y)$. By (1), we have
$$ varphi(w)cdot varphi(h) = f_varphi(w,h) = sum_{i=1}^n f_varphi(s_i,s_i) = sum_{i=1}^n varphi(s_i)^2 geq 0. $$
In particular, if $varphi(w) = 0$, then we must have $varphi(s_1) = cdots = varphi(s_n) = 0$, and therefore $varphi = 0$ (since $mathscr{L}$ is spanned by $s_1,ldots,s_n$). From this it is easy to see that $mathscr{L}^*$, and therefore $mathscr{L}$, is at most one-dimensional. Clearly we also have $dim(mathscr{L}) geq 1$, since it contains non-zero numbers, so we conclude that $mathscr{L}$ is one-dimensional.
Since $mathscr{L}$ contains $s_1,ldots,s_n$, it also contains $w$ and $h$. It follows that everything in $mathscr{L}$ is a rational multiple of, say, $w$. In fact, we have proved something stronger: not only the $h$, but also $s_1,ldots,s_n$ are rational multiples of $w$.
References:
[AZ14]: Martin Aigner, Günter M. Ziegler, Proofs from THE BOOK, Fifth Edition, Springer-Verlag Berlin-Heidelberg, 2014.
[Deh03]: M. Dehn, Über Zerlegung von Rechtecken in Rechtecke, Mathematische Annalen, Vol. 57 (1903), Issue 3, pp. 314-332.
[Dob16]: Josse van Dobben de Bruyn, Tiling a rectangle with squares, notes for the course SPC taught at Leiden University, available here.
$endgroup$
add a comment |
$begingroup$
Indeed, the ratio between length and width must be rational, even if we don't require the squares to be of different size. The first proof of this was given by Max Dehn [Deh03]. A short and elegant proof appears in Proofs from THE BOOK (see [AZ14, Chapter 28]). Furthermore, I worked out a very similar proof in [Dob16], which I intended to be accessible to undergraduate mathematics students at my university. (It is unclear to me who first conceived of this proof; the original proof of Dehn seems to be much more involved.)
A short sketch of the ideas behind this proof: let $s_1,ldots,s_n$ denote the lengths of the sides of the squares in the tiling, and let $w,h$ denote the width and height of the large rectangle. Furthermore, let $mathscr{L} subseteq mathbb{R}$ be the $mathbb{Q}$-vector subspace of $mathbb{R}$ spanned by $s_1,ldots,s_n$. (In other words: $mathscr{L}$ is the set of all rational linear combinations of $s_1,ldots,s_n$.)
The first important observation is this: for an arbitrary $mathbb{Q}$-vector space $V$ and an arbitrary $mathbb{Q}$-bilinear map $f : mathscr{L} times mathscr{L} to V$, one has
$$ f(w,h) = sum_{i=1}^n f(s_i,s_i).tag{1} $$
Intuitively, this is generalising the idea that the area of the original rectangle is the sum of the areas of the squares in the tiling. Indeed, the usual area function occurs as a special case, if we choose $V = mathbb{R}$ and $f(x,y) = xcdot y$. (For a more detailed proof of (1), see [Dob16, Lemma 3.2].)
Now, if $varphi : mathscr{L} to mathbb{Q}$ is any linear form, we may consider the $mathbb{Q}$-bilinear map $f_varphi : mathscr{L} times mathscr{L} to mathbb{Q}$ given by $f_varphi(x,y) = varphi(x) cdot varphi(y)$. By (1), we have
$$ varphi(w)cdot varphi(h) = f_varphi(w,h) = sum_{i=1}^n f_varphi(s_i,s_i) = sum_{i=1}^n varphi(s_i)^2 geq 0. $$
In particular, if $varphi(w) = 0$, then we must have $varphi(s_1) = cdots = varphi(s_n) = 0$, and therefore $varphi = 0$ (since $mathscr{L}$ is spanned by $s_1,ldots,s_n$). From this it is easy to see that $mathscr{L}^*$, and therefore $mathscr{L}$, is at most one-dimensional. Clearly we also have $dim(mathscr{L}) geq 1$, since it contains non-zero numbers, so we conclude that $mathscr{L}$ is one-dimensional.
Since $mathscr{L}$ contains $s_1,ldots,s_n$, it also contains $w$ and $h$. It follows that everything in $mathscr{L}$ is a rational multiple of, say, $w$. In fact, we have proved something stronger: not only the $h$, but also $s_1,ldots,s_n$ are rational multiples of $w$.
References:
[AZ14]: Martin Aigner, Günter M. Ziegler, Proofs from THE BOOK, Fifth Edition, Springer-Verlag Berlin-Heidelberg, 2014.
[Deh03]: M. Dehn, Über Zerlegung von Rechtecken in Rechtecke, Mathematische Annalen, Vol. 57 (1903), Issue 3, pp. 314-332.
[Dob16]: Josse van Dobben de Bruyn, Tiling a rectangle with squares, notes for the course SPC taught at Leiden University, available here.
$endgroup$
add a comment |
$begingroup$
Indeed, the ratio between length and width must be rational, even if we don't require the squares to be of different size. The first proof of this was given by Max Dehn [Deh03]. A short and elegant proof appears in Proofs from THE BOOK (see [AZ14, Chapter 28]). Furthermore, I worked out a very similar proof in [Dob16], which I intended to be accessible to undergraduate mathematics students at my university. (It is unclear to me who first conceived of this proof; the original proof of Dehn seems to be much more involved.)
A short sketch of the ideas behind this proof: let $s_1,ldots,s_n$ denote the lengths of the sides of the squares in the tiling, and let $w,h$ denote the width and height of the large rectangle. Furthermore, let $mathscr{L} subseteq mathbb{R}$ be the $mathbb{Q}$-vector subspace of $mathbb{R}$ spanned by $s_1,ldots,s_n$. (In other words: $mathscr{L}$ is the set of all rational linear combinations of $s_1,ldots,s_n$.)
The first important observation is this: for an arbitrary $mathbb{Q}$-vector space $V$ and an arbitrary $mathbb{Q}$-bilinear map $f : mathscr{L} times mathscr{L} to V$, one has
$$ f(w,h) = sum_{i=1}^n f(s_i,s_i).tag{1} $$
Intuitively, this is generalising the idea that the area of the original rectangle is the sum of the areas of the squares in the tiling. Indeed, the usual area function occurs as a special case, if we choose $V = mathbb{R}$ and $f(x,y) = xcdot y$. (For a more detailed proof of (1), see [Dob16, Lemma 3.2].)
Now, if $varphi : mathscr{L} to mathbb{Q}$ is any linear form, we may consider the $mathbb{Q}$-bilinear map $f_varphi : mathscr{L} times mathscr{L} to mathbb{Q}$ given by $f_varphi(x,y) = varphi(x) cdot varphi(y)$. By (1), we have
$$ varphi(w)cdot varphi(h) = f_varphi(w,h) = sum_{i=1}^n f_varphi(s_i,s_i) = sum_{i=1}^n varphi(s_i)^2 geq 0. $$
In particular, if $varphi(w) = 0$, then we must have $varphi(s_1) = cdots = varphi(s_n) = 0$, and therefore $varphi = 0$ (since $mathscr{L}$ is spanned by $s_1,ldots,s_n$). From this it is easy to see that $mathscr{L}^*$, and therefore $mathscr{L}$, is at most one-dimensional. Clearly we also have $dim(mathscr{L}) geq 1$, since it contains non-zero numbers, so we conclude that $mathscr{L}$ is one-dimensional.
Since $mathscr{L}$ contains $s_1,ldots,s_n$, it also contains $w$ and $h$. It follows that everything in $mathscr{L}$ is a rational multiple of, say, $w$. In fact, we have proved something stronger: not only the $h$, but also $s_1,ldots,s_n$ are rational multiples of $w$.
References:
[AZ14]: Martin Aigner, Günter M. Ziegler, Proofs from THE BOOK, Fifth Edition, Springer-Verlag Berlin-Heidelberg, 2014.
[Deh03]: M. Dehn, Über Zerlegung von Rechtecken in Rechtecke, Mathematische Annalen, Vol. 57 (1903), Issue 3, pp. 314-332.
[Dob16]: Josse van Dobben de Bruyn, Tiling a rectangle with squares, notes for the course SPC taught at Leiden University, available here.
$endgroup$
Indeed, the ratio between length and width must be rational, even if we don't require the squares to be of different size. The first proof of this was given by Max Dehn [Deh03]. A short and elegant proof appears in Proofs from THE BOOK (see [AZ14, Chapter 28]). Furthermore, I worked out a very similar proof in [Dob16], which I intended to be accessible to undergraduate mathematics students at my university. (It is unclear to me who first conceived of this proof; the original proof of Dehn seems to be much more involved.)
A short sketch of the ideas behind this proof: let $s_1,ldots,s_n$ denote the lengths of the sides of the squares in the tiling, and let $w,h$ denote the width and height of the large rectangle. Furthermore, let $mathscr{L} subseteq mathbb{R}$ be the $mathbb{Q}$-vector subspace of $mathbb{R}$ spanned by $s_1,ldots,s_n$. (In other words: $mathscr{L}$ is the set of all rational linear combinations of $s_1,ldots,s_n$.)
The first important observation is this: for an arbitrary $mathbb{Q}$-vector space $V$ and an arbitrary $mathbb{Q}$-bilinear map $f : mathscr{L} times mathscr{L} to V$, one has
$$ f(w,h) = sum_{i=1}^n f(s_i,s_i).tag{1} $$
Intuitively, this is generalising the idea that the area of the original rectangle is the sum of the areas of the squares in the tiling. Indeed, the usual area function occurs as a special case, if we choose $V = mathbb{R}$ and $f(x,y) = xcdot y$. (For a more detailed proof of (1), see [Dob16, Lemma 3.2].)
Now, if $varphi : mathscr{L} to mathbb{Q}$ is any linear form, we may consider the $mathbb{Q}$-bilinear map $f_varphi : mathscr{L} times mathscr{L} to mathbb{Q}$ given by $f_varphi(x,y) = varphi(x) cdot varphi(y)$. By (1), we have
$$ varphi(w)cdot varphi(h) = f_varphi(w,h) = sum_{i=1}^n f_varphi(s_i,s_i) = sum_{i=1}^n varphi(s_i)^2 geq 0. $$
In particular, if $varphi(w) = 0$, then we must have $varphi(s_1) = cdots = varphi(s_n) = 0$, and therefore $varphi = 0$ (since $mathscr{L}$ is spanned by $s_1,ldots,s_n$). From this it is easy to see that $mathscr{L}^*$, and therefore $mathscr{L}$, is at most one-dimensional. Clearly we also have $dim(mathscr{L}) geq 1$, since it contains non-zero numbers, so we conclude that $mathscr{L}$ is one-dimensional.
Since $mathscr{L}$ contains $s_1,ldots,s_n$, it also contains $w$ and $h$. It follows that everything in $mathscr{L}$ is a rational multiple of, say, $w$. In fact, we have proved something stronger: not only the $h$, but also $s_1,ldots,s_n$ are rational multiples of $w$.
References:
[AZ14]: Martin Aigner, Günter M. Ziegler, Proofs from THE BOOK, Fifth Edition, Springer-Verlag Berlin-Heidelberg, 2014.
[Deh03]: M. Dehn, Über Zerlegung von Rechtecken in Rechtecke, Mathematische Annalen, Vol. 57 (1903), Issue 3, pp. 314-332.
[Dob16]: Josse van Dobben de Bruyn, Tiling a rectangle with squares, notes for the course SPC taught at Leiden University, available here.
answered Dec 19 '18 at 19:28
Josse van Dobben de BruynJosse van Dobben de Bruyn
3,838824
3,838824
add a comment |
add a comment |
$begingroup$
For integer $n ge 1$, let $[n]$ be a short hand for the interval of integers ${ 1, 2,ldots, n }$.
Let ${ s_1, s_2, ldots, s_p }$ be the set of sides of a bunch of squares that cover a rectangle of dimension $w times h$.
Since $mathbb{R}$ is a vector space over $mathbb{Q}$, there is a hamel basis $E$ of $mathbb{R}$ over $mathbb{Q}$. Every real number can be uniquely expressed as a finite linear combination of elements from $E$ with rational coefficients.
There will be finitely many of $e in E$ that appear in the expansion of $s_1, ldots, s_p$.
Let $e_1, ldots, e_q in E$ be those appear in expansion of some $s_i$.
There will be $p times q$ coefficients $alpha_{ij} in mathbb{Q}, (i,j) in [p] times [q]$ such that
$$s_i = sum_{j=1}^q alpha_{ij} e_jquadtext{ for } i in [p]$$
Furthermore, for each $j in [q]$, there is some $i in [p]$ with $alpha_{ij}ne 0$.
Rescale $e_i$ if necessary, we can assume all $alpha_{ij} in mathbb{Z}$.
Under this setting, it is easy to see we can find integers $w_j, h_j in mathbb{Z}, j in [q]$ such that
$$w = sum_{j=1}^q w_j e_jquadtext{ and }quad h = sum_{j=1}^q h_j e_j$$
For any $j in [q]$, define function $f_j : [0,w] times [ 0, h ] to mathbb{R}$ by $f_j(x,y) = frac{alpha_{ij}}{s_i}$ whenever $(x,y)$ is covered by a square of side $s_i$.
Aside from a set of measure zero, $f_j$ is well defined. It is a piecewise constant function and integrable over $[0,w]times[0,h]$. We can evaluate their integral over $[0,w]times [0,h]$ in two different orders.
Aside from a finite choice of $y_0$, the line $y = y_0$ cut through
finitely many squares "normally". Let $s_{i_1}, s_{i_2}, ldots, s_{i_r}$ be the sides of the squares it cut through. We have
$$int_0^w f_j(x,y_0) dx
= sum_{k=1}^r int_{sum_{ell=1}^{k-1} s_{i_ell}}^{sum_{ell=1}^{k} s_{i_ell}}frac{alpha_{i_ell j}}{s_{i_ell}} dx
= sum_{k=1}^r alpha_{i_ell j}
in mathbb{Z}
$$
Notice
$$sum_{j=1}^q e_j int_0^w f_j(x,y_0) dx =
int_0^w sum_{j=1}^q e_j f_j(x,y_0) dx = int_0^w dx = w$$
We obtain
$$sum_{j=1}^q left(sum_{k=1}^r alpha_{i_ell j}right)e_j
= w = sum_{j=1}^q w_j e_j$$
Since $e_j$ are linear independent over $mathbb{Q}$, we obtain
$$int_0^w f_j(x,y_0) dx = sum_{k=1}^r alpha_{i_ell j} = w_j$$
From this, we can deduce
$$int_0^hint_0^w f_j(x,y) dx dy = w_j h$$
By a similar argument, we have
$$int_0^wint_0^h f_j(x,y) dy dx = h_j w$$
Since these functions are integrable, we have
$$w_j h = int_0^hint_0^w f_j(x,y) dx dy = int_0^wint_0^h f_j(x,y) dy dx = h_j w$$
Since $w ne 0$, some $w_j ne 0$. Let's say $w_1 ne 0$, we have
$w_1 h = h_1 w implies h_1 ne 0$. As a result,
$$frac{w}{h} = frac{w_1}{h_1} in mathbb{Q}$$
$endgroup$
add a comment |
$begingroup$
For integer $n ge 1$, let $[n]$ be a short hand for the interval of integers ${ 1, 2,ldots, n }$.
Let ${ s_1, s_2, ldots, s_p }$ be the set of sides of a bunch of squares that cover a rectangle of dimension $w times h$.
Since $mathbb{R}$ is a vector space over $mathbb{Q}$, there is a hamel basis $E$ of $mathbb{R}$ over $mathbb{Q}$. Every real number can be uniquely expressed as a finite linear combination of elements from $E$ with rational coefficients.
There will be finitely many of $e in E$ that appear in the expansion of $s_1, ldots, s_p$.
Let $e_1, ldots, e_q in E$ be those appear in expansion of some $s_i$.
There will be $p times q$ coefficients $alpha_{ij} in mathbb{Q}, (i,j) in [p] times [q]$ such that
$$s_i = sum_{j=1}^q alpha_{ij} e_jquadtext{ for } i in [p]$$
Furthermore, for each $j in [q]$, there is some $i in [p]$ with $alpha_{ij}ne 0$.
Rescale $e_i$ if necessary, we can assume all $alpha_{ij} in mathbb{Z}$.
Under this setting, it is easy to see we can find integers $w_j, h_j in mathbb{Z}, j in [q]$ such that
$$w = sum_{j=1}^q w_j e_jquadtext{ and }quad h = sum_{j=1}^q h_j e_j$$
For any $j in [q]$, define function $f_j : [0,w] times [ 0, h ] to mathbb{R}$ by $f_j(x,y) = frac{alpha_{ij}}{s_i}$ whenever $(x,y)$ is covered by a square of side $s_i$.
Aside from a set of measure zero, $f_j$ is well defined. It is a piecewise constant function and integrable over $[0,w]times[0,h]$. We can evaluate their integral over $[0,w]times [0,h]$ in two different orders.
Aside from a finite choice of $y_0$, the line $y = y_0$ cut through
finitely many squares "normally". Let $s_{i_1}, s_{i_2}, ldots, s_{i_r}$ be the sides of the squares it cut through. We have
$$int_0^w f_j(x,y_0) dx
= sum_{k=1}^r int_{sum_{ell=1}^{k-1} s_{i_ell}}^{sum_{ell=1}^{k} s_{i_ell}}frac{alpha_{i_ell j}}{s_{i_ell}} dx
= sum_{k=1}^r alpha_{i_ell j}
in mathbb{Z}
$$
Notice
$$sum_{j=1}^q e_j int_0^w f_j(x,y_0) dx =
int_0^w sum_{j=1}^q e_j f_j(x,y_0) dx = int_0^w dx = w$$
We obtain
$$sum_{j=1}^q left(sum_{k=1}^r alpha_{i_ell j}right)e_j
= w = sum_{j=1}^q w_j e_j$$
Since $e_j$ are linear independent over $mathbb{Q}$, we obtain
$$int_0^w f_j(x,y_0) dx = sum_{k=1}^r alpha_{i_ell j} = w_j$$
From this, we can deduce
$$int_0^hint_0^w f_j(x,y) dx dy = w_j h$$
By a similar argument, we have
$$int_0^wint_0^h f_j(x,y) dy dx = h_j w$$
Since these functions are integrable, we have
$$w_j h = int_0^hint_0^w f_j(x,y) dx dy = int_0^wint_0^h f_j(x,y) dy dx = h_j w$$
Since $w ne 0$, some $w_j ne 0$. Let's say $w_1 ne 0$, we have
$w_1 h = h_1 w implies h_1 ne 0$. As a result,
$$frac{w}{h} = frac{w_1}{h_1} in mathbb{Q}$$
$endgroup$
add a comment |
$begingroup$
For integer $n ge 1$, let $[n]$ be a short hand for the interval of integers ${ 1, 2,ldots, n }$.
Let ${ s_1, s_2, ldots, s_p }$ be the set of sides of a bunch of squares that cover a rectangle of dimension $w times h$.
Since $mathbb{R}$ is a vector space over $mathbb{Q}$, there is a hamel basis $E$ of $mathbb{R}$ over $mathbb{Q}$. Every real number can be uniquely expressed as a finite linear combination of elements from $E$ with rational coefficients.
There will be finitely many of $e in E$ that appear in the expansion of $s_1, ldots, s_p$.
Let $e_1, ldots, e_q in E$ be those appear in expansion of some $s_i$.
There will be $p times q$ coefficients $alpha_{ij} in mathbb{Q}, (i,j) in [p] times [q]$ such that
$$s_i = sum_{j=1}^q alpha_{ij} e_jquadtext{ for } i in [p]$$
Furthermore, for each $j in [q]$, there is some $i in [p]$ with $alpha_{ij}ne 0$.
Rescale $e_i$ if necessary, we can assume all $alpha_{ij} in mathbb{Z}$.
Under this setting, it is easy to see we can find integers $w_j, h_j in mathbb{Z}, j in [q]$ such that
$$w = sum_{j=1}^q w_j e_jquadtext{ and }quad h = sum_{j=1}^q h_j e_j$$
For any $j in [q]$, define function $f_j : [0,w] times [ 0, h ] to mathbb{R}$ by $f_j(x,y) = frac{alpha_{ij}}{s_i}$ whenever $(x,y)$ is covered by a square of side $s_i$.
Aside from a set of measure zero, $f_j$ is well defined. It is a piecewise constant function and integrable over $[0,w]times[0,h]$. We can evaluate their integral over $[0,w]times [0,h]$ in two different orders.
Aside from a finite choice of $y_0$, the line $y = y_0$ cut through
finitely many squares "normally". Let $s_{i_1}, s_{i_2}, ldots, s_{i_r}$ be the sides of the squares it cut through. We have
$$int_0^w f_j(x,y_0) dx
= sum_{k=1}^r int_{sum_{ell=1}^{k-1} s_{i_ell}}^{sum_{ell=1}^{k} s_{i_ell}}frac{alpha_{i_ell j}}{s_{i_ell}} dx
= sum_{k=1}^r alpha_{i_ell j}
in mathbb{Z}
$$
Notice
$$sum_{j=1}^q e_j int_0^w f_j(x,y_0) dx =
int_0^w sum_{j=1}^q e_j f_j(x,y_0) dx = int_0^w dx = w$$
We obtain
$$sum_{j=1}^q left(sum_{k=1}^r alpha_{i_ell j}right)e_j
= w = sum_{j=1}^q w_j e_j$$
Since $e_j$ are linear independent over $mathbb{Q}$, we obtain
$$int_0^w f_j(x,y_0) dx = sum_{k=1}^r alpha_{i_ell j} = w_j$$
From this, we can deduce
$$int_0^hint_0^w f_j(x,y) dx dy = w_j h$$
By a similar argument, we have
$$int_0^wint_0^h f_j(x,y) dy dx = h_j w$$
Since these functions are integrable, we have
$$w_j h = int_0^hint_0^w f_j(x,y) dx dy = int_0^wint_0^h f_j(x,y) dy dx = h_j w$$
Since $w ne 0$, some $w_j ne 0$. Let's say $w_1 ne 0$, we have
$w_1 h = h_1 w implies h_1 ne 0$. As a result,
$$frac{w}{h} = frac{w_1}{h_1} in mathbb{Q}$$
$endgroup$
For integer $n ge 1$, let $[n]$ be a short hand for the interval of integers ${ 1, 2,ldots, n }$.
Let ${ s_1, s_2, ldots, s_p }$ be the set of sides of a bunch of squares that cover a rectangle of dimension $w times h$.
Since $mathbb{R}$ is a vector space over $mathbb{Q}$, there is a hamel basis $E$ of $mathbb{R}$ over $mathbb{Q}$. Every real number can be uniquely expressed as a finite linear combination of elements from $E$ with rational coefficients.
There will be finitely many of $e in E$ that appear in the expansion of $s_1, ldots, s_p$.
Let $e_1, ldots, e_q in E$ be those appear in expansion of some $s_i$.
There will be $p times q$ coefficients $alpha_{ij} in mathbb{Q}, (i,j) in [p] times [q]$ such that
$$s_i = sum_{j=1}^q alpha_{ij} e_jquadtext{ for } i in [p]$$
Furthermore, for each $j in [q]$, there is some $i in [p]$ with $alpha_{ij}ne 0$.
Rescale $e_i$ if necessary, we can assume all $alpha_{ij} in mathbb{Z}$.
Under this setting, it is easy to see we can find integers $w_j, h_j in mathbb{Z}, j in [q]$ such that
$$w = sum_{j=1}^q w_j e_jquadtext{ and }quad h = sum_{j=1}^q h_j e_j$$
For any $j in [q]$, define function $f_j : [0,w] times [ 0, h ] to mathbb{R}$ by $f_j(x,y) = frac{alpha_{ij}}{s_i}$ whenever $(x,y)$ is covered by a square of side $s_i$.
Aside from a set of measure zero, $f_j$ is well defined. It is a piecewise constant function and integrable over $[0,w]times[0,h]$. We can evaluate their integral over $[0,w]times [0,h]$ in two different orders.
Aside from a finite choice of $y_0$, the line $y = y_0$ cut through
finitely many squares "normally". Let $s_{i_1}, s_{i_2}, ldots, s_{i_r}$ be the sides of the squares it cut through. We have
$$int_0^w f_j(x,y_0) dx
= sum_{k=1}^r int_{sum_{ell=1}^{k-1} s_{i_ell}}^{sum_{ell=1}^{k} s_{i_ell}}frac{alpha_{i_ell j}}{s_{i_ell}} dx
= sum_{k=1}^r alpha_{i_ell j}
in mathbb{Z}
$$
Notice
$$sum_{j=1}^q e_j int_0^w f_j(x,y_0) dx =
int_0^w sum_{j=1}^q e_j f_j(x,y_0) dx = int_0^w dx = w$$
We obtain
$$sum_{j=1}^q left(sum_{k=1}^r alpha_{i_ell j}right)e_j
= w = sum_{j=1}^q w_j e_j$$
Since $e_j$ are linear independent over $mathbb{Q}$, we obtain
$$int_0^w f_j(x,y_0) dx = sum_{k=1}^r alpha_{i_ell j} = w_j$$
From this, we can deduce
$$int_0^hint_0^w f_j(x,y) dx dy = w_j h$$
By a similar argument, we have
$$int_0^wint_0^h f_j(x,y) dy dx = h_j w$$
Since these functions are integrable, we have
$$w_j h = int_0^hint_0^w f_j(x,y) dx dy = int_0^wint_0^h f_j(x,y) dy dx = h_j w$$
Since $w ne 0$, some $w_j ne 0$. Let's say $w_1 ne 0$, we have
$w_1 h = h_1 w implies h_1 ne 0$. As a result,
$$frac{w}{h} = frac{w_1}{h_1} in mathbb{Q}$$
edited Dec 20 '18 at 8:52
answered Dec 19 '18 at 19:29
achille huiachille hui
96k5132259
96k5132259
add a comment |
add a comment |
Thanks for contributing an answer to Mathematics Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3046451%2fprove-the-ratio-of-the-length-and-width-of-the-rectangle-is-rational%23new-answer', 'question_page');
}
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function () {
StackExchange.helpers.onClickDraftSave('#login-link');
});
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
Are you requiring that no two of the small squares be congruent or just that they aren't all congruent?
$endgroup$
– lulu
Dec 19 '18 at 14:44
$begingroup$
The question does not condition that. In fact, they may be all congruent, but this case would be very simple, And my teacher ask me to consider the cases they are not all congruent, and give a proof.
$endgroup$
– user627221
Dec 19 '18 at 14:50
1
$begingroup$
I think you can prove by induction that the smallest square can be used as the standard tile and all other squares can be tiled by it, so that you end up with a rectangular grid of same-size squares.
$endgroup$
– Max Freiburghaus
Dec 19 '18 at 15:05
$begingroup$
Gut feeling: There is a proof technique similar to Dehn invariants lurking here.
$endgroup$
– Chris Culter
Dec 19 '18 at 17:49
1
$begingroup$
@ChrisCulter you are right, insofar as this result was originally proved by Max Dehn. :-)
$endgroup$
– Josse van Dobben de Bruyn
Dec 19 '18 at 19:49