A short proof of Rayleighs Theorem Olivier Bernardi (MIT) Microsoft - PowerPoint PPT Presentation

Aug 16, 2023 •208 likes •307 views

A short proof of Rayleighs Theorem Olivier Bernardi (MIT) Microsoft Research, January 2011 Spitzers walks in the plane Walks made of n unit steps. Direction of each step is uniformly random. Spitzers walks in the plane Walks made of n

A short proof of Rayleigh’s Theorem Olivier Bernardi (MIT) Microsoft Research, January 2011
Spitzer’s walks in the plane Walks made of n unit steps. Direction of each step is uniformly random.
Spitzer’s walks in the plane Walks made of n unit steps. Direction of each step is uniformly random. Theorem [Rayleigh] The probability for the walk to end at distance 1 less than 1 from the origin is n + 1 .
Spitzer’s walks in the plane Walks made of n steps of random lengths distributed as X . Direction of each step is uniformly random. X ∗ 6 X ∗ 4 Theorem [Rayleigh] The probability for the walk to end at distance 1 less than 1 from the origin is n + 1 . Theorem [B.] For any positive random variable X , i P ( X ∗ i > X ∗ j ) = i + j .
Proof. Lemma . For any positive random variables A, B, C , P ( A > B ∗ C ) + P ( B > A ∗ C ) + P ( C > A ∗ B ) = 1
Proof. Lemma . For any positive random variables A, B, C , P ( A > B ∗ C ) + P ( B > A ∗ C ) + P ( C > A ∗ B ) = 1 Proof . We condition on A = a, B = b, C = c and prove: P ( a > b ∗ c ) + P ( b > a ∗ c ) + P ( c > a ∗ b ) = 1 . • If a ≥ b + c or b ≥ a + c or c ≥ a + b , obvious. • Otherwise, consider the angles α, β, γ of the triangle. One has P ( a > b ∗ c ) = 2 α 2 π etc. Hence P ( a > b ∗ c )+ P ( b > a ∗ c )+ P ( c > a ∗ b ) = α + β + γ = 1 . π γ a b β α c
Proof. Lemma . For any positive random variables A, B, C , P ( A > B ∗ C ) + P ( B > A ∗ C ) + P ( C > A ∗ B ) = 1 Equivalently, P ( A > B ∗ C ) + P ( B > A ∗ C ) = P ( A ∗ B > C ) . Let P ( i, n ) = P ( X ∗ i > X ∗ ( n − i ) ) . We want to prove P ( i, n ) = i n .
Proof. Lemma . For any positive random variables A, B, C , P ( A > B ∗ C ) + P ( B > A ∗ C ) + P ( C > A ∗ B ) = 1 Equivalently, P ( A > B ∗ C ) + P ( B > A ∗ C ) = P ( A ∗ B > C ) . Let P ( i, n ) = P ( X ∗ i > X ∗ ( n − i ) ) . We want to prove P ( i, n ) = i n . Apply the lemma to A = X ∗ i , B = X ∗ j , C = X ∗ ( n − i − j ) . This gives P ( i, n ) + P ( j, n ) = P ( i + j, n ) whenever i + j ≤ n . Thus n P (1 , n ) = P ( n, n ) = 1 . This gives P (1 , n ) = 1 n , and P ( i, n ) = i P (1 , n ) = i n . �
The end.

Recommend

E LLIPTIC CURVES II ( THE ASSOCIATIVITY ) The algebraic proof of associativity the ring of

Elliptic curves over F q Formulas for Addition Computer assited proof of associativity Proof of associativity via combinatorial incidence Geometry Bezout Theorem Cayley-Bacharah Theorem Pappus Theorem Pascals Theorem Associativity E

474 views • 21 slides

The Bellows Theorem (Proof) Giovanni Viglietta JAIST July 5, 2018 The Bellows Theorem

The Bellows Theorem (Proof) Giovanni Viglietta JAIST July 5, 2018 The Bellows Theorem (Proof) Bellows theorem: statement Theorem (Sabitov, 1996) The volume V of a polyhedron (of any genus) with edge lengths 1 , , e

1.22k views • 93 slides

Visual theorem proving with the Incredible Proof Machine The idea Theorem Proving without

Interactive Theorem Proving, Nancy August 22, 2016 Joachim Breitner Karlsruhe Institute of Technology University of Pennsylvania, Philadelphia Visual theorem proving with the Incredible Proof Machine The idea Theorem Proving without Syntax

579 views • 43 slides

Rayleigh-B enard Convection and Lorenz Model Rayleigh-B enard Convection Rayleigh-B

Laurette TUCKERMAN laurette@pmmh.espci.fr Rayleigh-B enard Convection and Lorenz Model Rayleigh-B enard Convection Rayleigh-B enard Convection Boussinesq Approximation Calculation and subtraction of the basic state

630 views • 39 slides

NOTES ON THE VAPNIK-CHERVONENKIS THEOREM: BACKGROUND AND PROOF ROLAND WALKER 1. Introduction

NOTES ON THE VAPNIK-CHERVONENKIS THEOREM: BACKGROUND AND PROOF ROLAND WALKER 1. Introduction Vladimir Vapnik and Alexey Chervonenkis proved their eponymous theorem in 1968. The original Russian proof was published in 1971 and then translated to

278 views • 13 slides

Welcome to Nordic Proof Webinar May 26 th 2020 Agenda 09:00 Welcome and short intro to Nordic

Welcome to Nordic Proof Webinar May 26 th 2020 Agenda 09:00 Welcome and short intro to Nordic Proof and the program Siri Stabel Olsen, Coordinator Nordic Proof 09:10 Home treatment and monitoring Charlotte Kira Kimby, VihTek Copenhagen and

460 views • 31 slides

A very complicated proof of the minimax theorem Jonathan Borwein FRSC FAAS FAA FBAS Centre for

Abstract Introduction Various proof techniques Five Prerequisite Tools Proof of minimax Conclusions A very complicated proof of the minimax theorem Jonathan Borwein FRSC FAAS FAA FBAS Centre for Computer Assisted Research Mathematics and its

832 views • 61 slides

PCP Theorem [PCP Theorem is] the most important result in complexity theory since Cooks

PCP Theorem [PCP Theorem is] the most important result in complexity theory since Cooks Theorem. Ingo Wegener, 2005 Computational Complexity, by Fu Yuxi PCP Theorem 1 / 119 S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof

1.53k views • 120 slides

Prandtl and Rayleigh numbers dependences in Rayleigh-B enard convection P.-E. Roche 1 , 2 , B.

1 June 2002 EUROPHYSICS LETTERS Europhys. Lett. , 58 (5), pp. 693698 (2002) Prandtl and Rayleigh numbers dependences in Rayleigh-B enard convection P.-E. Roche 1 , 2 , B. Castaing 1 , 3 , B. Chabaud 1 and B. H ebral 1 1 Centre de

89 views • 6 slides

Bijective proof and generalization of Siladi cs partition theorem Isaac KONAN IRIF, Paris

A Rogers-Ramanujan type identy : Siladi cs partition theorem Generalization of Siladi cs theorem Bijective map Further analysis on higher degrees Bijective proof and generalization of Siladi cs partition theorem Isaac KONAN

1.56k views • 99 slides

From Shang Gao Magic 15 If a 2 + b 2 = c 2 , then ( a , b , c ) is called to be a Background

Magic 15 Magic 15 Background Two Square Theorem Galois Finite Fields Magic 15: A STORY OVER 380 YEARS Proofs of 2-Square Theorem Three Square Theorem Four Square Theorem Universal Polynomials Magic 15 Proof of Fifteen Theorem 15

1.31k views • 97 slides

A Formalised Proof of Craigs Interpolation Theorem in Nominal Isabelle Peter Chapman Peter

Introduction Craigs Theorem Formal Proof Further Work A Formalised Proof of Craigs Interpolation Theorem in Nominal Isabelle Peter Chapman Peter Chapman M unchen Talk Introduction Craigs Theorem Formal Proof Further Work

621 views • 59 slides

CS70: Lecture 2. Outline. Quick Background and Notation. Direct Proof. Theorem: For any a , b , c

162 views • 4 slides

A proof-theoretical journey through programming, model checking and theorem proving David Baelde

A proof-theoretical journey through programming, model checking and theorem proving David Baelde IT University of Copenhagen ASL Meeting, Structural Proof Theory Session Madison, Wisconsin, April 2012 1 / 26 Logic programming A specification

270 views • 26 slides

Limits of geodesic rays and non-visible points of Teichm uller space Hideki Miyachi Osaka

Introduction Proof of Theorem 1 Proof of Theorem 2 (Part 1) Proof of Theorem 2 (Part 2) (o) Limits of geodesic rays and non-visible points of Teichm uller space Hideki Miyachi Osaka University 26 July , 2011 Aspects of hyperbolicity

1.03k views • 72 slides

A simplified proof of Hausslers packing Theorem Nikita Zhivotovskiy 1 1 Technion Based on

A simplified proof of Hausslers packing Theorem Nikita Zhivotovskiy 1 1 Technion Based on https://arxiv.org/abs/1711.10414 Zhivotovskiy A simplified proof of Hausslers packing Theorem 1 / 15 VC dimension Let V { 0 , 1 } n . For I = { i

619 views • 15 slides

Today Proof of Converse Coding Theorem Intuition: For message m , let S m { 0 , 1 } n

Today Proof of Converse Coding Theorem Intuition: For message m , let S m { 0 , 1 } n More on Shannons theory be the set of received words that decode to Proof of converse. m. ( S m = D 1 ( m ) ). Few words on

523 views • 5 slides

A direct proof of the equivalence between Brouwers fan theorem and K onigs lemma with a

A direct proof of the equivalence between Brouwers fan theorem and K onigs lemma with a uniqueness hypothesis Helmut Schwichtenberg Mathematisches Institut, Universit at M unchen Frauenchiemsee, 19. Juni 2006 Goal (1) A direct

331 views • 29 slides

Proof: The theorem is proven using this scheme: a. j. Definition of invertible. j. d.

2.3 Characterizations of Invertible Matrices Theorem 8 (The Invertible Matrix Theorem) Let A be a square n n matrix. The the following statements are equivalent (i.e., for a given A , they are either all true or all false). a. A is an invertible

223 views • 4 slides

A Direct Proof of the Strong HananiTutte Theorem on the Projective Plane ric Colin de

A Direct Proof of the Strong HananiTutte Theorem on the Projective Plane ric Colin de Verdire 1 Vojtch Kalua 2 Pavel Patk 3 Zuzana Patkov 3 Martin Tancer 2 1 Dpartement dinformatique, cole normale suprieure, Paris and

986 views • 69 slides

Formalizing an Analytic Proof of the Prime Number Theorem Dedicated to Mike Gordon John Harrison

Formalizing an Analytic Proof of the Prime Number Theorem Dedicated to Mike Gordon John Harrison Intel Corporation TTVSI (Mikefest) Royal Society, London Wed 26th March 2008 (10:00 10:45) 0 What is the prime number theorem? Let ( x )

495 views • 28 slides

Theorem: If a range space S = ( P, R ) over a set P of size n has VC-dimension k , then the number

Theorem: If a range space S = ( P, R ) over a set P of size n has VC-dimension k , then the number of distinct ranges satisfies k n | R | . i i =0 Proof: Here is a sketch of the proof, which is induction on n and k . (Details

342 views • 5 slides

1 Introduction A proof of Brouwers fixed point theorem using Sperners Lemma is discussed

Lecture date: Feb 1 st , 2008 CS 573: Algorithmic Game Theory Instructor: Chandra Chekuri Scribe: Ramakrishna Gummadi 1 Introduction A proof of Brouwers fixed point theorem using Sperners Lemma is discussed below. To recap from a

177 views • 4 slides

centrifugal convection Rayleigh-Benard convection Rayleigh-Benard convection Gold paint

centrifugal convection Rayleigh-Benard convection Rayleigh-Benard convection Gold paint dissolved in acetone. Put it in a shallow dish. Cover it so that the acetone does not evaporate. Let stabilise and then remove the cover. Evaporation of the

382 views • 6 slides