Skip to main content
Library homepage
 

Text Color

Text Size

 

Margin Size

 

Font Type

Enable Dyslexic Font
Mathematics LibreTexts

20.4: Vanishing Area and Subdivisions

( \newcommand{\kernel}{\mathrm{null}\,}\)

Proposition 20.4.1

Any one-point set as well as any segment in the Euclidean plane have vanishing area.

Proof

Fix a line segment [AB]. Consider a sold square ABCD.

Note that given a positive integer n, there are n disjoint segments [A1B1],,[AnBn] in ABCD, such that each [AiBi] is congruent to [AB] in the sense of the Definition 20.1.1.

截屏2021-03-02 下午5.02.12.png

Applying invariance, additivity, and monotonicity of the area function, we get that

narea [AB]=area ([A1B1][AnBn])area (ABCD)

That is,

area [AB]1narea (ABCD)

for any positive integer n. Therefore, area [AB]0. On the other hand, by definition of area, area [AB]0, hence

area [AB]=0.

For any one-point set {A} we have that {A}[AB]. Therefore,

0area {A}area [AB]=0.

Whence area {A}=0.

Corollary 20.4.1

Any degenerate polygonal set has vanishing area.

Proof

Let P be a degenerate set, say

Since area is nonnegative by definition, applying additivity several times, we get that

area Parea [A1B1]++area [AnBn]++area {C1}++area {Ck}.

By Proposition 20.4.1, the right hand side vanishes.

On the other hand, area P0, hence the result.

We say that polygonal set P is subdivided into two polygonal sets Q1,,Qn if P=Q1Qn and the intersection QiQj is degenerate for any pair i and j. (Recall that according to Claim20.3.1, the intersections QiQj are polygonal.)

Proposition 20.4.2

Assume polygonal sets P is subdivided into polygonal sets Q1,,Qn. Then

area P=area Q1++area Qn.

Proof

截屏2021-03-03 上午8.43.19.png

Assume n=2; by additivity of area,

area P=area Q1+area Q2area (Q1Q2).

Since Q1Q2 is degenerate, by Corollary 20.4.1,

area (Q1Q2)=0.

Applying this formula a few times we get the general case. Indeed, if P is subdivided into Q1,,Qn, then

area P=area Q1+area (Q2Qn)==area Q1+area Q2+area (Q3Qn)=   =area Q1+area Q2++area Qn.

Remark

Two polygonal sets P and P are called equidecomposable if they admit subdivisions into polygonal sets Q1,,Qn and Q1,,Qn such that QiQi for each i.

According to the proposition, if P and P are equidecomposable, then area P=area P. A converse to this statement also holds; namely if two nondegenerate polygonal sets have equal area, then they are equidecomposable.

The last statement was proved by William Wallace, Farkas Bolyai and Paul Gerwien. The analogous statement in three dimensions, known as Hilbert’s third problem, is false; it was proved by Max Dehn.


This page titled 20.4: Vanishing Area and Subdivisions is shared under a CC BY-SA 4.0 license and was authored, remixed, and/or curated by Anton Petrunin via source content that was edited to the style and standards of the LibreTexts platform.

Support Center

How can we help?