Why a Sphere’s Surface Area Is Four Times Its Shadow

Two geometric routes from a sphere to circles, and a generalization to convex shapes.

GSGrant Sandersonホスト · 3Blue1Brown
チャンネル
3Blue1Brown
公開日
2018年12月2日
動画
15:50
読了時間
2 分
原文
英語
YouTube で開く
スクロールすると動画は右下に小さくなって再生を続けます。字幕は閲覧言語に合わせて切り替わります。
閲覧言語2 言語で読めます
この記事はまだ日本語に翻訳されていないため、英語の原文を表示しています。
要約

30 秒でわかる

Grant Sanderson explains how projecting a sphere onto its enclosing cylinder preserves infinitesimal area, then proposes a ring-and-shadow exercise and states a general result for convex bodies.

  1. 1Unwrap the cylinderIts side has area 2πR × 2R.
  2. 2Opposite scale factorsWidth grows by R/d while height shrinks by d/R.
  3. 3Compare rings and shadowsA double-angle identity connects projected rings to spherical rings.
  4. 4A broader resultThe average orthogonal shadow area of a convex body is one quarter of its surface area.

ポイント

  1. A sphere and the side of its enclosing cylinder have equal area.
  2. Projection stretches and compresses infinitesimal patches by reciprocal factors.
  3. Thin rings and a double-angle identity give another comparison.
  4. The average shadow area of a convex body is one quarter of its surface area.
トピックMathematics
全文

チャプターごとに整えた全文を読む

文字起こしのみ
01

The sphere and its enclosing cylinder

The area of a sphere is 4πR², four times the area of a circle of the same radius. Grant Sanderson asks for a geometric explanation of that relationship, not merely a formula.

The area of a sphere is 4πR², four times the area of a circle of the same radius. Grant Sanderson asks for a geometric explanation of that relationship, not merely a formula.

A flat sheet cannot wrap a sphere without distortion because their curvatures differ. Two arguments nevertheless connect the sphere to circles, followed by a general fact about convex shapes.

The first approach compares the sphere with the side of its enclosing cylinder. Unwrapped, the cylinder’s side is a rectangle of width 2πR and height 2R, with area 4πR².

02

Why projection preserves area

The key is to understand why the areas match. Approximate the sphere with tiny surface patches and project each horizontally outward to the cylinder.

The key is to understand why the areas match. Approximate the sphere with tiny surface patches and project each horizontally outward to the cylinder.

Projection stretches a patch along its latitude but compresses it vertically because the sphere is tilted. The two effects cancel in the limiting small-patch calculation.

Let d be the distance from a patch to the vertical axis. Similar triangles show that its width scales by R/d as it reaches the cylinder.

A cross-section reveals the second factor. The tangent is perpendicular to the radius; similar right triangles show that the vertical height scales by d/R.

Multiplying R/d by d/R gives one, so infinitesimal area is preserved. The polar endpoints require the limiting interpretation rather than division by zero.

In this particular animation the projected rectangles can also look like rotated originals, but this is a consequence of the chosen parameterization, not a general property of projection.

03

Limits and unwrapping circles

Finer surface patches make the approximations converge to the smooth surface area. This limiting argument is a geometric introduction to the idea behind calculus.

Finer surface patches make the approximations converge to the smooth surface area. This limiting argument is a geometric introduction to the idea behind calculus.

To see four circles inside the unwrapped cylinder, imagine unrolling a circle’s concentric rings into horizontal strips. Their lengths grow linearly with radius, forming a triangle.

That triangle has base 2πR and height R. Four such triangles fit the cylinder rectangle, relating four circle areas to the sphere.

04

A direct shadow exercise

The second argument compares thin spherical rings directly with their shadows on a plane. Sanderson presents it as a guided exercise instead of supplying every step.

The second argument compares thin spherical rings directly with their shadows on a plane. Sanderson presents it as a guided exercise instead of supplying every step.

Parameterize a ring by the angle θ from the vertical axis. Its circumference is 2πR sin θ, and for a small angular width dθ its surface area is approximately 2πR² sin θ dθ.

The shadow ring has area approximately 2πR² sin θ cos θ dθ. The identity 2 sin θ cos θ = sin 2θ connects it to a ring at twice the angle.

As θ covers the northern hemisphere, 2θ covers the whole sphere; accounting for the doubled angular interval gives a total shadow area equal to one quarter of the sphere’s area.

05

The convex-body generalization

Finally, the sphere illustrates a broader result: for a convex three-dimensional body, the average area of its orthogonal shadow over all orientations equals one quarter of its surface area. The video leaves its proof for another time.

Finally, the sphere illustrates a broader result: for a convex three-dimensional body, the average area of its orthogonal shadow over all orientations equals one quarter of its surface area. The video leaves its proof for another time.

同じチャンネルの記事

スライド 20 枚40:44EN
3Blue1Brown· 2026年10月16日Grant Sanderson: There's never been a better time to go into mathGrant Sanderson, Constantin Kogler · 3Blue1BrownStudents fear AI has solved mathematics. Grant Sanderson argues the opposite: even if machines prove theorems better than we do, the institution of math stays valuable—and this is a rare moment when newcomers can reshape it.MathematicsAI for scienceHuman-AI Collaboration+2
スライド 29 枚51:55EN
3Blue1Brown· 2026年9月18日The last IMO problem AI could not solveGrant Sanderson · 3Blue1BrownGrant Sanderson walks through IMO 2025 Problem 6 — a tiling puzzle that frontier models missed — and the visual patience it takes to prove a construction is optimal.MathematicsAI researchReasoning & test-time compute+2
0:55EN
3Blue1Brown· 2026年7月24日The 64 Sugar Cubes Puzzle: Six Equal DistancesA 4×4×4 block has three colors; prove that six same-colored pairs share a distance.MathematicsEducation
33:51EN
3Blue1Brown· 2026年7月16日What Cross-Entropy Connects: Compression, Language Models and KL DivergenceGrant Sanderson · 3Blue1BrownGrant Sanderson builds cross-entropy from code lengths and uses it to explain next-token training and distillation.MathematicsMachine LearningFoundation Models+1
スライド2:25EN
3Blue1Brown· 2026年6月12日How Shannon Measured the Entropy of EnglishA guessing game helped Claude Shannon estimate how much information English text contains, and why prediction is central to compression.MathematicsAI History
スライド1:02EN
3Blue1Brown· 2026年6月10日A Robot Walk and the Puzzle of Optimal Binary EncodingHow few bits does it take to send directions that occur with unequal frequencies?MathematicsScience Communication