How Can One Prove the Area of a Triangle Formula Using Step Regions?

courtrigrad
Messages
1,236
Reaction score
2
Prove that every triangular region is measurable and its area is one half the product of its base and altitude.

Let Q be a set that can be enclosed between two step regions S and T , so that S \subseteq Q \subseteq T If there is one number c such that a(S) \leq c \leq a(T), then Q is measurable, and a(Q) = c. So we know that c = \frac{1}{2}bh. So there has to be two step regions so that the area of the triangle is between them. We know that every rectangle is measurable, and the a(R) = bh. So how do I prove that c = \frac{1}{2}bh?
 
Physics news on Phys.org
I believe you know that if S and T are measurable, then so is S u T and moreover, the formula a(S u T) = a(S) + a(T) - a(ST) holds. Do you also know that if S and T are measurable with S a subset of T, then a(S) < a(T)? That property is referred to as monotonicity.

Let Q be the triangle. Define:

\mathcal{T} = \{T \mbox{ measurable } | Q \subseteq T\}

\mathcal{T}_R = \{T \mbox{ a union of rectangles } | Q \subseteq T\}

\tau = \inf \{a(T) | T \in \mathcal{T}\}

\tau _R = \inf \{a(T) | T \in \mathcal{T}_R\}

\mathcal{S} = \{S \mbox{ measurable } | S \subseteq Q\}

\mathcal{S}_R = \{S \mbox{ a union of rectangles } | S \subseteq Q\}

\sigma = \sup \{a(S) | S \in \mathcal{S}\}

\sigma _R = \sup \{a(S) | S \in \mathcal{S}_R\}

c = \frac{bh}{2}

Prove that \mathcal{T}_R \subset \mathcal{T}, and from that get \tau _R \geq \tau. Prove \mathcal{S}_R \subset \mathcal{S}, and from that get \sigma _R \leq \sigma. Prove that you can cover the triangle with rectangles such that the total area of those rectangles is arbitrarily close to c, and infer that c \geq \tau _R. Likewise, prove that c \leq \sigma _R. Use monotonicity to prove that \tau \geq \sigma. Putting together some of these inequalities gives:

c \geq \tau \geq \sigma \geq c

Giving

\sigma = c = \tau

This is exactly what you want to prove.
 
Last edited:
Sorry to bump a 4 year old post, but I did not want to start my own thread on the same question. I am working through the Apostol Calculus book now, and I would like to ask some questions on parts of this proof.

1. Is it sufficient to say that based on Axiom 5 in Apostol's Calculus (Every rectangle R is in M {the measurable set}) <br /> \mathcal{T}_R \subset \mathcal{T}<br />?

2. If <br /> \mathcal{T}_R \subset \mathcal{T}<br />, how can \tau _R be greater than \tau? How do I prove this?

Basically, this proof is showing the infimum of the area of \tau is equal to the supremum of the area of \mathcal{S}, which is equal to \matchcal{c}, correct?

Also, I don't think I am grasping this:

<br /> \mathcal{T} = \{T \mbox{ measurable } | Q \subseteq T\}<br />
<br /> \mathcal{T}_R = \{T \mbox{ a union of rectangles } | Q \subseteq T\}<br />

Are both \matcalc{T}s the same? Wouldn't it be better to use a different variable for the measurable set and the union of rectangles set? Again, I don't think I am grasping this properly.
 
Last edited:
Even though it is a very old topic, I am working through apostol's calculus and got stuck on the same problem.

What I don't get is how do we do that

AKG said:
Prove that you can cover the triangle with rectangles such that the total area of those rectangles is arbitrarily close to c, and infer that c \geq \tau _R. Likewise, prove that c \leq \sigma _R.

I thought that if we cover Q with a union of T rectangles such that Q \subseteq T, the infimum of \tau_R will be bigger than c, because the areas of rectangles we are covering the triangle are at least as big as the area of triangle itself? Please help to wrap my head around this problem :)
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top