Lebesgue measure vs. box counting dimension

Coin
Messages
564
Reaction score
1
Short version: What is the difference between the Lebesgue measure and the box counting dimension of a set?


Long version: I was reading up on the definition of the Lebesgue measure, and the description of how to take the Lebesgue measure of a set (which I understood basically as "cover the set with ranges of a certain size, then count the number of ranges in the limit as the size of the ranges goes to zero) sounded exactly like the procedure for taking the set's box counting dimension. Meanwhile I found this cryptic sentence on Mathworld:

The Minkowski measure of a bounded, closed set is the same as its Lebesgue measure

The Minkowski measure is of course the same as the box counting dimension; I'm assuming the Minkowski dimension and the Minkowski measure are the same thing (which I guess leads to another question I should be asking-- what if anything is the difference between measure and dimension?). So is it correct that the Lebesgue measure and the box counting dimension are in fact the same thing for a bounded, closed set? And if so, in what way does this fail to be the case for unbounded or open sets?
 
Physics news on Phys.org
I am not familiar with box counting dimension. However, Lebesgue measure is not at all the same as dimension. You can have measure defined for n-dimensional spaces of any dimension or even on more abstract spaces where dimension isn't even defined.

For one dimensional space, the simplest version starts with intervals and define measure as the length of the interval. It is then extended to other sets (sigma field) using countable unions and intersections.
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.
Back
Top