I Partitions of Euclidean space, cubic lattice, convex sets

AI Thread Summary
The discussion centers on the partitioning of the Euclidean plane into convex sets, each containing a vertex of a unit square lattice, and whether the area A of these sets must be at least 1/2. It is clarified that the original question mistakenly included the requirement for the lattice vertex to be in the interior of the partition, which is now disregarded. The participant suggests that A could range from 1/2 to infinity, raising the question of whether this range can be extended. There is a consideration of the relationship between the diameters of the partition members and area, indicating that if they are bounded, A might equal 1. The discussion concludes with a proposal for a construction that achieves A = 1/2.
Martin Rattigan
Messages
330
Reaction score
3
If the Euclidean plane is partitioned into convex sets each of area A in such a way that each contains exactly one vertex of a unit square lattice and this vertex is in its interior, is it true that A must be at least 1/2?
If not what is the greatest lower bound for A?
The analogous greatest lower bounds for En obviously form a non increasing sequence (ordered by n). What is the value for En?
 
Mathematics news on Phys.org
I would have thought that A must be at least 1, since there's a natural bijection between lattice vertices and the unit squares delimited by the lattice.
Proving it may be somewhat tricky though.
What's the context of the question?
It's not homework is it?
 
No it's not homework (bit old for that).

I was doing some number theory revision a couple of years ago and the question occurred to me after reading Minkowski's theorem on convex regions symmetric about a lattice point (Hardy and Wright 3.9/3.10), having noticed that Theorem 38, used in the proof, referred to congruent and similarly situated regions about the lattice points, but needed congruence only to show uniform boundedness of the regions (he only considers bounded regions) and similar situation apparently not at all (though the proof of Minkowski's theorem which follows on does deal with convex regions which are congruent and similarly situated).

In fact I first considered the question with the partition members being pathwise connected sets with a defined area, not necessarily convex. In this case A can be any value in (0,\infty], I believe, but I couldn't find convex examples.

I went on to look for examples with convex partition members. I should have spent more time remembering what I did before typing the question, because for this case I dropped the requirement that a lattice vertex is in the interior of its corresponding partition member (because I suspected this requirement might force A=1) but the requirement has still found its way into what I wrote. Unfortunately I can't edit my original post any more, so I'll write it bold here:

Please ignore the phrase "... and this vertex is in its interior" in the original question.

With that proviso I think A can be anywhere in [\frac{1}{2},\infty). The question is can this range be extended?

I didn't follow the reasoning in your reply. If the diameters of the partition members have a common finite upper bound, then I think A=1 (with essentially the same proof as Theorems 38/41 in Hardy and Wright), but this is not a premiss of the question. Neither is it stated that the partition members are congruent. I think I have a construction for a suitable partition with A=\frac{1}{2}.
 
Last edited:
Suppose ,instead of the usual x,y coordinate system with an I basis vector along the x -axis and a corresponding j basis vector along the y-axis we instead have a different pair of basis vectors ,call them e and f along their respective axes. I have seen that this is an important subject in maths My question is what physical applications does such a model apply to? I am asking here because I have devoted quite a lot of time in the past to understanding convectors and the dual...
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Back
Top