Microsoft Word - 13-21 Pilay & Pilay Equipartitioning Points.doc Pythagoras, 71, 13-21 (July 2010) 13 Equipartitioning and Balancing Points of Polygons    Shunmugam Pillay & Poobhalan Pillay  School of Mathematical Sciences  University of KwaZulu‐Natal  pillaysc@ukzn.ac.za & pillayph@ukzn.ac.za    The centre of mass G of a triangle has the property that the rays to the vertices from G  sweep out triangles having equal areas. We show that such points, termed equipartitioning  points in this paper, need not exist in other polygons. A necessary and sufficient condition  for a quadrilateral to have an equipartitioning point is that one of its diagonals bisects the  other.  The  general  theorem,  namely,  necessary  and  sufficient  conditions  for  equipartitioning points for arbitrary polygons to exist, is also stated and proved. When this  happens, they are in general, distinct from the centre of mass. In parallelograms, and only  in them, do the two points coincide.  This paper provides a specific scenario that can be utilised to stimulate learners into investigating a geometrical problem through the questioning process. The investigation leads to conjectures that are verifiable with the aid of computer software like the Geometer’s Sketchpad, and then the formal proofs verifying the conjectures are made. Traditionally the function of proof has been seen to be to verify or justify a mathematical statement. It is well known that proofs, especially in geometry, are a major problem for learners. For most learners mathematical statements (theorems) seem obvious and they see no need for proofs. Often, they do not appreciate a need for proofs and get frustrated when asked to prove a given theorem or “to prove” a statement from a textbook or a teacher (De Villiers, 2003, p. 5). To stimulate genuine interest in proof, De Villiers (1997), Chazan (1990) and others have argued that it requires that students are inducted early into the art of problem posing, allowing sufficient opportunity for exploration, conjecturing, refuting, reformulating and explaining. Movshovitz-Hadar (1988) has similarly suggested stimulating presentations of results that solicit the surprise and curiosity of students so that they are susceptible to responsive proofs, which leave them with “an appreciation of the invention, along with a feeling of becoming wiser” (p. 15). Pólya emphasizes that the students’ interest and motivation must stem from mathematics itself. It is the duty of the teacher to select tasks for the students that are: not too difficult and not too easy, natural and interesting and appropriate to their knowledge. Mathematics should also be used to develop problem solving skills and gain confidence and hence students “may experience the tension and enjoy the triumph of discovery” (1945, p. v). Further the reform movement in mathematics education requires the teacher to provide tasks that are stimulating, relevant and foster growth in knowledge. This can be achieved by helping students connect mathematical ideas and concepts to real life situations (National Council of Teachers of Mathematics, 1991). To this end, the problem in Figure 1 can be posed and investigated in a Grade 11 class. Such an investigation may proceed along the following lines. Equipartitioning and balancing points of polygons 14 Mr Baker makes biscuits that are in the shape of polygons. He has templates of triangles, quadrilaterals, pentagons and so on, but although all of them are convex, most of them have random dimensions. He finds a point in his triangle template that has the property that the three triangles formed by joining the point to the three vertices all have the same area. This pleases him, for he can then sell each piece separately at the same price. He calls such points, if they can be found, equipartitioning points. Investigate the following. 1. How does he locate the equipartitioning point inside the triangle and how can he be certain that the point is the correct one? How many such points are there? 2. Can he do the same with a quadrilateral? That is, can all quadrilaterals be divided into four equal triangles in the manner described? 3. Justify your answer. If it cannot be done, for which quadrilaterals would Mr Baker be able to locate at least one equipartitioning point? 4. Investigate the same question for convex polygons having five or more sides. 5. Mr Baker is aware that all polygons have balancing points, also called centres of mass, namely, points at which the mass of the polygon may be presumed to be concentrated. (Here he regards the polygon as a plate having uniform density). Would the balancing point of a polygon be the point Mr Baker is looking for? Figure 1: The problem The investigation The square, rectangle and parallelogram Learners should have no difficulty in identifying the equipartitioning points in these shapes as the points of intersection of the diagonals. Finally they should explain why such points work. The triangle 1. Using appropriate software, locate such points for a predetermined number of triangles. Also ascertain how many such points there are. 2. Use the points obtained to conjecture a rule by which these points may be located without using technology. 3. Give a formal proof of your assertions in 1 and 2. We believe that with a little help maybe, all learners would come to the conclusion that every triangle has exactly one equipartitioning point, and that it is situated at the point of intersection of (any) two of its medians. The uniqueness of the equipartitioning point also can be used to argue that for any triangle all three medians go through the same point, namely, it’s equipartitioning point. This leads to a secondary conjecture. The kite Use appropriate software again to determine whether kites have equipartitioning points. Make a conjecture and give a formal proof of your claim. The general quadrilateral Do the same for trapeziums and cyclic quadrilaterals. What do you conclude? Which quadrilaterals have equipartitioning points? Are these the only ones? Shunmugam Pillay & Poobhalan Pillay 15 Centres of mass Each learner could then be asked to plot the equipartitioning point of stiff triangular boards, and then try to support the triangle with a finger held up vertically under the board, at the point where the equipartitioning is located. If the construction is accurate, the board will balance perfectly. It is known that all polygons possess such balancing points. The terms centres of mass, centre of gravity and centroid are also used. Hence, for triangles, the equipartitioning point coincides with the centre of mass. Formal statements and proofs Formal definition Let A1A2…An be a polygon. An interior point Q of the polygon is called an equipartitioning point of A1A2…An if the n triangles QA1A2, QA2A3, …,QAn-1An, QAnA1 all have the same area. In Figure 2 we have that DC BD ADCarea ABDarea  . Hence if AD is a median, BD = DC, so area ABD = area ADC. That is, a median bisects the area of a triangle. Figure 2 Theorem 1 A triangle has a unique equipartitioning point, namely, the point of concurrency of its medians. Proof We first prove that the point G of concurrency of the medians of a triangle is an equipartitioning point. Figure 3 The symbols a, b, c in Figure 3 refer to the areas of the triangles. Now 2a + b = 2c + b and a + 2b = a + 2c lead to 2a = 2b = 2c. So G is an equipartitioning point. Equipartitioning and balancing points of polygons 16 Conversely, let Q be any equipartitioning point of  ABC Produce BQ to meet AC at D. Let a, x and y be the areas as indicated in Figure 4. Since Q is an equipartitioning point, a = x + y. Figure 4 Now y a x a QD BQ  so x = y, hence AD = DC, proving that Q lies on the median through B. By symmetry, Q also lies on the median through A. Hence, Q is the point of concurrency G of the medians. We have shown that G is the only equipartitioning point. The case for a quadrilateral The following is of independent interest. Theorem 2 A diagonal of a quadrilateral (not necessarily convex) bisects the area of a quadrilateral  the diagonal bisects the other diagonal (see Coxeter & Greitzer, 1967, pp. 54-55). Proof Suppose one of the diagonals bisects the other. Refer to Figure 5. Let the area of  ADE = a and the area of  ABE = b. Then it is an easy matter to see that the same diagonal bisects the area as well. Figure 5 Conversely, let ABCD be a quadrilateral, not necessarily convex, such that DB bisects the area of ABCD. Draw the altitudes AE and CF of  ABD and  DBC as shown in Figure 6. Since the area of  ADB is equal to the area of  CDB, we have 2 1 DB.AE= 2 1 DB.CF, so AE = CF. Let us first assume that E and F are distinct points. Since AE // FC, AECF is a parallelogram. Hence the midpoint of diagonal AC is on FE (and hence on DB or DB produced), proving that one of the diagonals bisects the other. Shunmugam Pillay & Poobhalan Pillay 17 If E = F, AEC is a straight line, DB bisects AC and is perpendicular to it. (In this case ABCD is a kite). This completes the proof. Figure 6 Whereas all polygons have centres of gravity, not all polygons have equipartitioning points, as the case for triangles seems to suggest. The next result provides a necessary and sufficient condition for a quadrilateral to have an equipartitioning point. The convex and non-convex cases are treated separately. Theorem 3 A quadrilateral has an equipartitioning point Q  one of its diagonals bisects the other, and then Q is the midpoint of the first diagonal (see Gilbert, Krusemeyer, & Larson, 1993). Proof We consider two cases, one where the quadrilateral is convex, and the other where it is not convex. Case 1 Let ABCD be a convex quadrilateral such that AC bisects BD (see Figure 7). Figure 7 Let Q be the midpoint of AC and let a, b and c be the indicated areas. Then c = a + b, proving that the midpoint Q of diagonal AC is an equipartitioning point. Conversely, suppose a convex quadrilateral ABCD has an equipartitioning point Q (see Figure 8). Then diagonals QB and QD bisect the areas of quadrilaterals ABCQ and AQCD respectively. Hence from Theorem 1, both QB and DQ contain the midpoint M of AC. Equipartitioning and balancing points of polygons 18 Figure 8 Suppose that Q is different from M. The straight line through Q and M contains D and B, hence DQB is the diagonal DB and it bisects AC. But triangles ADQ and ABQ have the same area, so DQ = QB . We have shown that in the case where Q and M are distinct, diagonal DB bisects diagonal AC and the equipartitioning point Q is the midpoint of DB. Now suppose the equipartitioning point Q = M, the midpoint of AC. The diagonal AC then bisects the area of ABCD. From Theorem 2, diagonal AC bisects diagonal DB and Q (= M) is the midpoint of AC. So the theorem is proved for convex quadrilaterals. Case 2 Let ABCD be a quadrilateral with BCD > 180° (see Figure 9). We shall prove that ABCD has an equipartitioning point Q  AC (produced) bisects DB, and then Q is the midpoint of AC. Figure 9 One direction is straightforward; if AC produced bisects the diagonal BD, then it is easy to see that if Q is the midpoint of AC, then the areas of triangles QAB, QBC, QCD, and QDA are all equal. Suppose then ABCD has an equipartitioning point Q in its interior. The areas of triangles QAB, QBC, QCD and QDA are all equal. Then diagonals AQ and QC bisect the areas of (convex) quadrilaterals ABQD and BQDC respectively. From Theorem 2, the midpoint M of BD lies on AQ and QC produced. Since M is in the exterior of ABCD, A, Q, C and M are collinear. Then BQ bisects the area  ABC so Q is the midpoint of AC. Also AC bisects BD, so we are done. Shunmugam Pillay & Poobhalan Pillay 19 Remarks Learners may now be asked: 1. Explain why parallelograms and kites always have equipartitioning points. 2. Prove that a trapezium has an equipartitioning point if, and only if, it is a parallelogram. The general case We are now in a position to generalise to an arbitrary polygon. Theorem 4 Let A1A2…An be a polygon. For any three adjacent vertices X, Y, Z of the polygon, let Y' be the midpoint of XZ. Then A1A2…An has an equipartitioning point Q  the n lines PP', as P runs through the n vertices, are concurrent, and then the point of concurrency is the equipartitioning point of A1A2…An. Figure 10 Proof Suppose the polygon (refer to Figure 10) has an equipartitioning point Q. Let X, Y, Z be adjacent vertices. From Theorem 2 Q lies on YY' (possibly produced). It follows that Q lies on each of the n lines PP', as P runs through the n vertices, so the n lines are concurrent. Conversely, if Q lies on each such YY' (possibly produced), it is easy to see that for any three adjacent vertices X, Y, Z, triangles QXY and QYZ have equal area, so Q is an equipartitioning point, proving the theorem. Remarks Learners may be asked to verify the following: 1. In the special case where the polygon is a triangle, the three lines mentioned above are just the medians, and, since the medians of a triangle are always concurrent, all triangles have equipartitioning points. 2. In the case of a quadrilateral the concurrency of the four lines above is equivalent to the statement that one of the diagonals bisects the other, and then the point of concurrency is the midpoint of the bisecting diagonal. Balancing points In contrast to equipartitioning points, balancing points (also called centres of mass, centres of gravity or centroids) of all plane regions, and in particular, of all polygons, always exist. The following result (Wales, 2010) provides a method to locate balancing points of polygonal plane regions. It should be mentioned that the centre of mass or centroid of equal point masses placed at the vertices of a polygon, in general, do not coincide with the centre of mass of a polygonal plane region. Equipartitioning and balancing points of polygons 20 Theorem 5 Let R be a plane region bounded by a polygon (see Figure 11). Suppose R is subdivided into two regions R1 and R2 having areas A1 and A2 respectively. Let G1 and G2 be the centres of mass of R1 and R2. Then the centre of mass G of R is a point in the interior of the line segment G1G2 satisfying the condition A1.G1G = A2.G2G. In particular, if the two areas are equal, then G is the midpoint of G1G2. Figure 11 The next theorem classifies those plane quadrilaterals having equipartitioning points coinciding with their centre of mass. Theorem 6 Let ABCD be a quadrilateral that has an equipartitioning point Q. Then Q is the centre of mass of ABCD if, and only if, ABCD is a parallelogram. Proof Let ABCD be a parallelogram whose diagonals AC and BD intersect at M. Figure 12 The centre of mass G1 of  ABD lies on AM with G1M = 3 1 AM. The centre of mass G2 of  CBD lies on CM with G2M = 3 1 CM. Since AM = CM, M is the midpoint of G1G2. Since  ABD and  CBD have equal areas, G, the centre of mass of ABCD, is the midpoint of G1G2, by Theorem 5. That is, G = M. Since the diagonals partition a parallelogram into four equal areas, M = Q, the equipartitioning point. So Q = G is the centre of mass of ABCD. Conversely, let quadrilateral ABCD have equipartitioning point Q, and further, suppose Q = G, the centre of mass of ABCD. Let the diagonals intersect at M. By Theorem 4, we may assume AM = CM and BQ = DQ. Suppose AQC is not a straight line. Let G1 and G2 be the centres of mass  CBD and  ABD respectively. Then G1 lies on CQ and G2 lies on AQ and G1QG2 is a triangle. But G1GG2 is a straight line, contradicting Q = G. Hence AQC is a straight line. It follows that AC and BD bisect each other. Hence ABCD is a parallelogram. Shunmugam Pillay & Poobhalan Pillay 21 The parallelogram technique The following construction provides a simple technique to find the centre of mass of an arbitrary plane quadrilateral. Trisect the four sides and complete the parallelogram determined by these eight points (see Figure 13). The diagonals of the parallelogram meet at the centre of mass of the plane quadrilateral. Figure 13 Discussion We trust that this paper will encourage teachers and learners to investigate different partitionings of polygons into parts of equal area, because it is a very rich topic with some challenging, still unsolved problems (see for example Croft, Falconer, & Guy, 1991). References Chazan, D. (1990). Quasi-empirical views of mathematics and mathematics teaching. Interchange, 21(1), 14-23. doi: 10.1007/BF01809606 Coxeter, H. S. M., & Greitzer, S. L. (1967). Geometry revisited. Washington, DC: Mathematical Association of America. Croft, H. T., Falconer, K. J., & Guy, R. K. (1991). Unsolved problems in geometry. NewYork: Springer- Verlag. De Villiers, M. (1997). The role of proof in investigative, computer-based geometry: Some personal reflections. In J. King & D. Schattschneider, Geometry turned on: Dynamic software in learning, teaching, and research (pp. 15-24). Washington, DC: Mathematical Association of America. De Villiers, M. (2003). Rethinking proof with Sketchpad. Emeryville: Key Curriculum Press. Gilbert, G. T., Krusemeyer, M., & Larson, L. C. (1993). The Wohascum County problem book. Dolciani Mathematical Expositions, 14(10), 68-70, Washington, DC: Mathematical Association of America. Movshovitz-Hadar, N. (1988). Stimulating presentations of theorems followed by responsive proofs. For the Learning of Mathematics, 8(2), 12-19,30. Pólya, G. (1945). How to solve it. A new aspect of mathematical method. Princeton, NJ: Princeton University Press. National Council of Teachers of Mathematics. (1991). Professional standards for teaching mathematics. Reston, VA: National Council of Teachers of Mathematics. Wales, J. (2010). Centroid. Retrieved from http://en.wikipedia.org/wiki/Centroid << /ASCII85EncodePages false /AllowTransparency false /AutoPositionEPSFiles true /AutoRotatePages /None /Binding /Left /CalGrayProfile (Dot Gain 20%) /CalRGBProfile (sRGB IEC61966-2.1) /CalCMYKProfile (U.S. Web Coated \050SWOP\051 v2) /sRGBProfile (sRGB IEC61966-2.1) /CannotEmbedFontPolicy /Error /CompatibilityLevel 1.4 /CompressObjects /Tags /CompressPages true /ConvertImagesToIndexed true /PassThroughJPEGImages true /CreateJobTicket false /DefaultRenderingIntent /Default /DetectBlends true /DetectCurves 0.0000 /ColorConversionStrategy /CMYK /DoThumbnails false /EmbedAllFonts true /EmbedOpenType false /ParseICCProfilesInComments true /EmbedJobOptions true /DSCReportingLevel 0 /EmitDSCWarnings false /EndPage -1 /ImageMemory 1048576 /LockDistillerParams false /MaxSubsetPct 100 /Optimize true /OPM 1 /ParseDSCComments true /ParseDSCCommentsForDocInfo true /PreserveCopyPage true /PreserveDICMYKValues true /PreserveEPSInfo true /PreserveFlatness true /PreserveHalftoneInfo false /PreserveOPIComments true /PreserveOverprintSettings true /StartPage 1 /SubsetFonts true /TransferFunctionInfo /Apply /UCRandBGInfo /Preserve /UsePrologue false /ColorSettingsFile () /AlwaysEmbed [ true ] /NeverEmbed [ true ] /AntiAliasColorImages false /CropColorImages true /ColorImageMinResolution 300 /ColorImageMinResolutionPolicy /OK /DownsampleColorImages true /ColorImageDownsampleType /Bicubic /ColorImageResolution 300 /ColorImageDepth -1 /ColorImageMinDownsampleDepth 1 /ColorImageDownsampleThreshold 1.50000 /EncodeColorImages true /ColorImageFilter /DCTEncode /AutoFilterColorImages true /ColorImageAutoFilterStrategy /JPEG /ColorACSImageDict << /QFactor 0.15 /HSamples [1 1 1 1] /VSamples [1 1 1 1] >> /ColorImageDict << /QFactor 0.15 /HSamples [1 1 1 1] /VSamples [1 1 1 1] >> /JPEG2000ColorACSImageDict << /TileWidth 256 /TileHeight 256 /Quality 30 >> /JPEG2000ColorImageDict << /TileWidth 256 /TileHeight 256 /Quality 30 >> /AntiAliasGrayImages false /CropGrayImages true /GrayImageMinResolution 300 /GrayImageMinResolutionPolicy /OK /DownsampleGrayImages true /GrayImageDownsampleType /Bicubic /GrayImageResolution 300 /GrayImageDepth -1 /GrayImageMinDownsampleDepth 2 /GrayImageDownsampleThreshold 1.50000 /EncodeGrayImages true /GrayImageFilter /DCTEncode /AutoFilterGrayImages true /GrayImageAutoFilterStrategy /JPEG /GrayACSImageDict << /QFactor 0.15 /HSamples [1 1 1 1] /VSamples [1 1 1 1] >> /GrayImageDict << /QFactor 0.15 /HSamples [1 1 1 1] /VSamples [1 1 1 1] >> /JPEG2000GrayACSImageDict << /TileWidth 256 /TileHeight 256 /Quality 30 >> /JPEG2000GrayImageDict << /TileWidth 256 /TileHeight 256 /Quality 30 >> /AntiAliasMonoImages false /CropMonoImages true /MonoImageMinResolution 1200 /MonoImageMinResolutionPolicy /OK /DownsampleMonoImages true /MonoImageDownsampleType /Bicubic /MonoImageResolution 1200 /MonoImageDepth -1 /MonoImageDownsampleThreshold 1.50000 /EncodeMonoImages true /MonoImageFilter /CCITTFaxEncode /MonoImageDict << /K -1 >> /AllowPSXObjects false /CheckCompliance [ /None ] /PDFX1aCheck false /PDFX3Check false /PDFXCompliantPDFOnly false /PDFXNoTrimBoxError true /PDFXTrimBoxToMediaBoxOffset [ 0.00000 0.00000 0.00000 0.00000 ] /PDFXSetBleedBoxToMediaBox true /PDFXBleedBoxToTrimBoxOffset [ 0.00000 0.00000 0.00000 0.00000 ] /PDFXOutputIntentProfile () /PDFXOutputConditionIdentifier () /PDFXOutputCondition () /PDFXRegistryName () /PDFXTrapped /False /CreateJDFFile false /Description << /ARA /BGR /CHS /CHT /CZE /DAN /DEU /ESP /ETI /FRA /GRE /HEB /HRV (Za stvaranje Adobe PDF dokumenata najpogodnijih za visokokvalitetni ispis prije tiskanja koristite ove postavke. Stvoreni PDF dokumenti mogu se otvoriti Acrobat i Adobe Reader 5.0 i kasnijim verzijama.) /HUN /ITA /JPN /KOR /LTH /LVI /NLD (Gebruik deze instellingen om Adobe PDF-documenten te maken die zijn geoptimaliseerd voor prepress-afdrukken van hoge kwaliteit. De gemaakte PDF-documenten kunnen worden geopend met Acrobat en Adobe Reader 5.0 en hoger.) /NOR /POL /PTB /RUM /RUS /SKY /SLV /SUO /SVE /TUR /UKR /ENU (Use these settings to create Adobe PDF documents best suited for high-quality prepress printing. Created PDF documents can be opened with Acrobat and Adobe Reader 5.0 and later.) >> /Namespace [ (Adobe) (Common) (1.0) ] /OtherNamespaces [ << /AsReaderSpreads false /CropImagesToFrames true /ErrorControl /WarnAndContinue /FlattenerIgnoreSpreadOverrides false /IncludeGuidesGrids false /IncludeNonPrinting false /IncludeSlug false /Namespace [ (Adobe) (InDesign) (4.0) ] /OmitPlacedBitmaps false /OmitPlacedEPS false /OmitPlacedPDF false /SimulateOverprint /Legacy >> << /AddBleedMarks false /AddColorBars false /AddCropMarks false /AddPageInfo false /AddRegMarks false /ConvertColors /ConvertToCMYK /DestinationProfileName () /DestinationProfileSelector /DocumentCMYK /Downsample16BitImages true /FlattenerPreset << /PresetSelector /MediumResolution >> /FormElements false /GenerateStructure false /IncludeBookmarks false /IncludeHyperlinks false /IncludeInteractive false /IncludeLayers false /IncludeProfiles false /MultimediaHandling /UseObjectSettings /Namespace [ (Adobe) (CreativeSuite) (2.0) ] /PDFXOutputIntentProfileSelector /DocumentCMYK /PreserveEditing true /UntaggedCMYKHandling /LeaveUntagged /UntaggedRGBHandling /UseDocumentProfile /UseDocumentBleed false >> ] >> setdistillerparams << /HWResolution [2400 2400] /PageSize [612.000 792.000] >> setpagedevice