• Aucun résultat trouvé

Proving Pick’s formula

N/A
N/A
Protected

Academic year: 2022

Partager "Proving Pick’s formula"

Copied!
3
0
0

Texte intégral

(1)

Season 3Episode 02Proving Pick’s formula

0

Proving Pick’s formula

Season 3

Episode 02 Time frame 2 periods

Objectives :

Find, step by step, a proof of Pik's formula.

Materials :

Lesson : Proof of Pik's formula.

Beamer : Proof of Pik's formula.

Paper for posters.

1 – Devise a plan for the proof 10 mins

A brainstorming sessionto devise a plan for the proof, moderated by the teaher.

2 – Part 1 : Prove that Pick’s formula is additive 45 mins

The aim of this rst part is to prove that if

P

and

T

are two polygons with one edge in ommon, and if Pik's formula holds for

P

and

T

, it also holds for the polygon

P T

obtained by adding

P

and

T

.

3 – Part 2 : Prove Pick’s formula for any polygon 55 mins

Followthe steps : unit square, retangle, right-angled triangle, any triangle, any onvex

(2)

Proof of Pick’s formula

Season 3

Episode 02 Document Lesson

Proposition 1

Pick’s formula is additive : if P and T are two polygons with one edge in common, and if Pick’s formula holds for P and T , it also holds for the polygon P T obtained by adding P and T . This is also true for more than two polygons.

Proof. First, it's obviousfrom the denitions that

A P T = A P + A T

. Then, suppose that Pik'sformulaholdsforthetwopolygons,andweusethesamenotationsasintheprevious

session. Let's all

c

the number of boundary points inommon. Then we see that

I P T = I P + I T + ( c − 2)

and also

B P T = B P + B T − 2( c − 2) − 2 .

Wean dedue that

1

2 B P T + I P T − 1 = 1

2 ( B P + B T − 2( c − 2) − 2) + I P + I T + ( c − 2) − 1

= 1

2 B P + 1

2 B T − ( c − 2) − 1 + I P + I T + ( c − 2) − 1

= 1

2 B P + I P − 1 + 1

2 B T + I T − 1

= A P + A T

= A P T

Sotheformulaalsoholds forthepolygon

P T

.It'seasytoextandthis resulttomorethan

twopolygons.

Lemma 1

Pik's formula is true for the unit square and for any retangle with sides

parallel tothe axes.

Proof.Foraunitsquare

S

,we have

A S = 1

,

B S = 4

and

I S = 0

.As

1 2 B S + I S − 1 = 1

,the

formulaholds.Then,anyretangle withsidesparalleltotheaxesismadeofunitsquares,

so fromProposition 1,the formulaalsoholds for these retangles.

Lemma 2

Pik's formulaholds for any right-angledtrianglewith itsperpendiular sides parallel tothe axes.

Proof. Any suhtriangle

T

isone halfof aretange

R

with sides paralleltothe axes, ut diagonally,andit'slearthat

2 A T = A R

.Let'sall

n

and

m

the numberofpointsoneah side of the retangleand

d

thenumberof pointsonthe diagonal.Then, asimpleanalysis gives

B R = 2( n + m − 2)

and

I R = ( n − 2)( m − 2) B T = n + m − 1 + d

and

I T = ( n − 2)( m − 2) − d

2

(3)

Season 3Episode 02Proving Pick’s formula

2

Then we an ompute on one hand

1

2 B R + I R − 1 = n + m − 2 + ( n − 2)( m − 2) − 1

= n + m − 3 + ( n − 2)( m − 2)

and on the other hand

2( 1

2 B T + I T − 1) = B T + 2 I T − 2

= n + m − 1 + d + ( n − 2)( m − 2) − d − 2

= n + m − 3 + ( n − 2)( m − 2)

The two expressions are equal, and we also know from the previous Lemma that

A R =

1

2 B R + I R − 1

, so we dedue

2 A T = A R = 1

2 B R + I R − 1 = 2( 1

2 B T + I T − 1)

whih impliesthat the formulaistrue for triangle

T

:

A T = 1 2 B T + I T − 1

.

Lemma 3

Pik's formula holds forany lattie triangle.

Proof.Thislemmaisproved byagraphial

argument : any lattie trianglean be tur-

ned into a retangle by attahing at most

three suitable right-angled triangles and

one retangle. Sine the formula is orret

fortherighttrianglesandfortheretangle,

italsofollowsfortheoriginaltriangle.This

last step uses the fat that if the theorem

is true for the polygon PT and for the tri-

angle T, then it'salso true for P; this an

be proved in the same way as propostion

one.

b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b b

b b b b b b b

Theorem 1

Pick’s formula is true for any lattice poly- gon.

Proof. This theorem follows from lemma

3, proposition 1 and the fat that any

lattie polygon an be ut into triangles

(triangulated).

b b b b

b

b

b

Références

Documents relatifs

– exhibits a strong analogy between sorting and Pascal’s triangle, – allows to sort in lattices with quadratic complexity, and that it – is in fact a generalization of insertion

Some months after the first draft of this paper, its goal has been vindicated: the final resolution of the conjecture via methods of Moulin Ollagnier becomes computationally feasible;

To complete the proof of Theorem 1, we must prove that there exist a residual subset D of R such that for every f ∈ D the set of periodic points is dense in the nonwandering set..

Bender, An Itô formula for generalized functionals of a fractional Brownian motion with arbitrary Hurst parameter, Stochastic

Mautner in [M] formulated several integral identities of functions on GL(2).. Although the proof of these GL(2) identities is rather elementary, let us list them,

For a local field F of characteristic 0, let n an irreducible admissible represen- tation of GL2(F) of infinite dimension, and WTC its central character, ~03C0

Pick’s formula is additive : if P and T are two polygons with one edge in common, and if Pick’s formula holds for P and T , it also holds for the polygon PT obtained by adding P and

Trapping holomorphic disks inside pseudoconvexdomains The aim of the section is to prove a priori estimates for the derivative of a disk with the trace in a graphical torus