UNCLASSIFIED Reptoduced. if ike ARMED SERVICES TECHNICAL INFORMATION AGENCY ARLINGTON HALL STATION ARLINGTON 12, VIRGINIA UNCLASSIFIED

Similar documents
UNCLASSIFIED. .n ARMED SERVICES TECHNICAL INFORMATION AGENCY ARLINGTON HALL STATION ARLINGTON 12, VIRGINIA UNCLASSIFIED

UNCLASSIFIED AD ARMED SERVICES TECHNICAL INFORMATION AGENCY ARLINGTON HALL STATION ARLINGTON 12, VIRGINIA UNCLASSIFIED

UNCLASSIFIED AD ARMED SERVICES TECHNICAL INFORMATION AGENCY ARLINGTON HALL STATION ARLINGTO 12, VIRGINIA UNCLASSIFIED

UNCLASSIFIED AD NUMBER LIMITATION CHANGES

UNCLASSIFIED AD ARMED SERVICES TECHNICAL INFORMATION AGENCY ARLINGTON HALL STATION ARLINGT0 12, VIRGINIA UNCLASSIFIED

UNCLASSIFIED 'K AD ARMED SERVICES TECHNICAL INFORMATION AGENCY ARLINGTON HALL STATION ARLINGTON 12, VIRGINIA UNCLASSIFIED

"UNCLASSIFIED AD DEFENSE DOCUMENTATION CENTER FOR SCIENTIFIC AND TECHNICAL INFORMATION CAMERON STATION, ALEXANDRIA. VIRGINIA UNCLASSIFIED.

Army Air Forces Specification 7 December 1945 EQUIPMENT: GENERAL SPECIFICATION FOR ENVIRONMENTAL TEST OF

UNCLASSIFIED AD Mhe ARMED SERVICES TECHNICAL INFORMATION AGENCY ARLINGTON HALL STATION ARLINGTON 12, VIRGINIA U NCLASSI1[FIED

S 3 j ESD-TR W OS VL, t-i 1 TRADE-OFFS BETWEEN PARTS OF THE OBJECTIVE FUNCTION OF A LINEAR PROGRAM

UNCLASSIFIED AD DEFENSE DOCUMENTATION CENTER FOR SCIENTIFIC AND TECHNICAL INFORMATION CAMERON STATION. ALEXANDRIA. VIRGINIA UNCLASSIFIED

THE INFRARED SPECTRA AND VIBRATIONAL ASSIGNMENTS FOR SOME ORGANO-METALLIC COMPOUNDS

TM April 1963 ELECTRONIC SYSTEMS DIVISION AIR FORCE SYSTEMS COMMAND UNITED STATES AIR FORCE. L. G. Hanscom Field, Bedford, Massachusetts

Conduction Theories in Gaseous Plasmas and Solids: Final Report, 1961

UNCLASSIFIED AD DEFENSE DOCUMENTATION CENTER FOR SCIENTIFIC AND TCHNICAL INFORMATION CAMERON STATION, ALEXANDRIA. VIRGINIA UNCLASSIFIED

UNCLASSIFIED. AD 295 1l10 ARMED SERVICES TECHNICAL INFUM ARLINGON HALL SFATION ARLINGFON 12, VIRGINIA AGCY NSO UNCLASSIFIED,

UNCLASSIFIED AD ARMED SERVICES TECHNICAL INFORMATION AGENCY ARLING)N HALL STATIN ARLINGTON 12, VIRGINIA UNCLASSIFIED

ei vices lecnmca Ripriduced ly DOCUMENT SERVICE ßEHTE KHOTT BUIimilt. BUTT»!. 2.

UNCLASSIFIED A30 333~ ARMED SERVICES TECHNICAL INFORMION AGENCY ARLIGTON HALL STATION ARLINGTON 12, VIRGINIA "UNC LASS IFIED

UNCLASSIFIED AD DEFENSE DOCUMENTATION CENTER FOR SCIENTIFIC AND TECHNICAL INFORMATION CAMERON STATION, ALEXANDRIA, VIRGINIA UNCLASSIFIED

TO Approved for public release, distribution unlimited

UNCLASSIFED AD DEFENSE DOCUMENTATION CENTER FOR SCIENTIFIC AND TECHNICAL INFORMATION CAMERON STATION ALEXANDRIA. VIRGINIA UNCLASSIFIED

A L A BA M A L A W R E V IE W

A GENERAL METHOD FOR PRODUCING RANDOM V ARIABtES IN A COMPUTER. George Marsaglia. Boeing Scientific Research Laboratories Seattle, Washington

A matrix over a field F is a rectangular array of elements from F. The symbol

UNCLASSIFIED AD NUMBER LIMITATION CHANGES

UJNCLASSI FIED A D:FENSE DOCUMENTATION CENTER FOR SCIENTIFIC AND TECHNICAL INFORMATION CAMERON STATION, AI.EXANDRIA. VIRGINIA UNCLASSIFIED

Chapter 4 Euclid Space

Reproduced DOCUMENT SERVICE CENTER ARMED SERVICES TECHNICAL INFORMATION AGENCY U. B. BUILDING, DAYTON, 2, OHIO

THE MINIMUM NUMBER OF LINEAR DECISION FUNCTIONS TO IMPLEMENT A DECISION PROCESS DECEMBER H. Joksch D. Liss. Prepared for

UNCLASSIFIED AD ARMED SERVICES TECHNICAL INFORMATION AGENCY ARLINGTON HALL STATION ARLINGTON 12, VIRGINIA UNCLASSIFIED

UNCLASSIFIED AD DEFENSE DOCUMENTATION CENTER FOR SCIENTIFIC AND TECHNICAL INFORMATION VIRGINIA CAMERON SIATION, ALEXANDRIA.

(2) * ; v(x,y)=r-j [p(x + ty)~ p(x-ty)]dt (r > 0)

Y. H. Harris Kwong SUNY College at Fredonia, Fredonia, NY (Submitted May 1987)

Course 311: Michaelmas Term 2005 Part III: Topics in Commutative Algebra

Lecture Notes 1: Vector spaces

ON THE "BANG-BANG" CONTROL PROBLEM*

Measure-theoretic probability

Approximation Algorithms

Lecture 4: Purifications and fidelity

Spheres with maximum inner diameter

UNCLASSIFIED ADL DEFENSE DOCUMENTATION CENTER FOR SCIENTIFIC AND TECHNICAL INFORMATION CAMERON STATION ALEXANDRIA. VIRGINIA UNCLASSIFIED

Random Variable. Pr(X = a) = Pr(s)

SPACES OF MATRICES WITH SEVERAL ZERO EIGENVALUES

AREA-BISECTING POLYGONAL PATHS. Warren Page New York City Technical College, CUNY

INTRODUCTION TO FINITE ELEMENT METHODS

Joint distributions and independence

WHEN ARE REES CONGRUENCES PRINCIPAL?

arxiv: v1 [math.ac] 11 Dec 2013

UNCLASSIFIED AD Reproduced ARMED SERVICES TECHNICAL INFORMATION AGENCY ARLINGTON HALL STATION ARLINGTON 12, VIRGINIA UNCLASSIFIED

UNCLASSIFIED AD NUMBER LIMITATION CHANGES

ON THE VOLUME OF THE INTERSECTION OF TWO L"p BALLS

io -1 i UN LASSIFIED firmed Services echnicall nforma ion Hgency DOCUMENT by SERVICE CENTER KNOTT BUILDING, DAYTON, 2, OHIO Reproduced

TO Approved for public release, distribution unlimited

ELEMENTARY LINEAR ALGEBRA

Tutorial on Principal Component Analysis

a 11 x 1 + a 12 x a 1n x n = b 1 a 21 x 1 + a 22 x a 2n x n = b 2.

arxiv: v1 [math.pr] 29 Dec 2015

Math 341: Convex Geometry. Xi Chen

Ma 227 Review for Systems of DEs

P. ERDÖS 2. We need several lemmas or the proo o the upper bound in (1). LEMMA 1. { d ( (k)) r 2 < x (log x)c5. This result is due to van der Corput*.

Lax Solution Part 4. October 27, 2016

This pre-publication material is for review purposes only. Any typographical or technical errors will be corrected prior to publication.

LOWELL JOURNAL. MUST APOLOGIZE. such communication with the shore as Is m i Boimhle, noewwary and proper for the comfort

NONLINEAR CIRCUITS XXI. Prof. E. A. Guillemin Prof. H. J. Zimmermann T. E. Stern Prof. S. J. Mason J. Gross R. D. Thornton RESEARCH OBJECTIVES

A/P Warrants. June 15, To Approve. To Ratify. Authorize the City Manager to approve such expenditures as are legally due and

ON THE AVERAGE NUMBER OF REAL ROOTS OF A RANDOM ALGEBRAIC EQUATION

Gaussian representation of a class of Riesz probability distributions

ELEMENTARY LINEAR ALGEBRA

ELEMENTARY LINEAR ALGEBRA

1. Subspaces A subset M of Hilbert space H is a subspace of it is closed under the operation of forming linear combinations;i.e.,

Simple derivation of the parameter formulas for motions and transfers

CHAPTER III THE CURVE AND THE EQUATION. The bisectors of the adjacent angles formed by two lines is. To solve any locus problem involves two things :

HW1 solutions. 1. α Ef(x) β, where Ef(x) is the expected value of f(x), i.e., Ef(x) = n. i=1 p if(a i ). (The function f : R R is given.

cot* SEPTEMBER 1965 a CC 0^\ 0 «*«***

SOUTHWESTERN ELECTRIC POWER COMPANY SCHEDULE H-6.1b NUCLEAR UNIT OUTAGE DATA. For the Test Year Ended March 31, 2009

UNCLASSIFIED AD ARM ED SERVICES TECHNICAL INFORMATION AGENCY ARLINGTON HALL STATION ARLINGIN 12, VIRGINIA UNCLASSIFIED

Low-discrepancy constructions in the triangle

UNCLASSI FILED L10160 DEFENSE DOCUMENTATION CENTER FOR SCIENTIFIC AND TECHNICAL INFORMATION CAMERON STAMTIOI, ALEXANDRIA, VIRGINIA UNCLASSIFIED

RELATIVELY UNIFORM CONVERGENCE OF SEQUENCES OF FUNCTIONS*

Chapter 1 Preliminaries

FOR COMPACT CONVEX SETS

TECHNICAL NOTE. A Finite Algorithm for Finding the Projection of a Point onto the Canonical Simplex of R"

UNCLASSIFIED M 43^208 DEFENSE DOCUMENTATION CENTER FOR SCIENTIFIC AND TECHNICAL INFORMATION CAMERON STATION. ALEXANDRIA. VIRGINIA UNCLASSIFIED

arxiv: v2 [math.mg] 25 Oct 2017

(x, y) = d(x, y) = x y.

Bare minimum on matrix algebra. Psychology 588: Covariance structure and factor models

UNCLASSIFIED AD luf, the ARMED SERVICES TECHMCAL INFORMATION AGENCY ARLINGTON HALL STATION ARLINGTON 12, VIRGINIA UNCLASSIFIED

Using the Rational Root Theorem to Find Real and Imaginary Roots Real roots can be one of two types: ra...-\; 0 or - l (- - ONLl --

Progress, tbe Universal LaW of f'laiare; Tbodgbt. tbe 3olVer)t of fier Problems. C H IC A G O. J U N E

On Moore Graphs with Diameters 2 and 3

The Equivalence of Ergodicity and Weak Mixing for Infinitely Divisible Processes1

Mathematics for Cryptography

Exhibit 2-9/30/15 Invoice Filing Page 1841 of Page 3660 Docket No

A CHARACTERIZATION OF INNER PRODUCT SPACES

Keywords: Acinonyx jubatus/cheetah/development/diet/hand raising/health/kitten/medication

Lecture 1 and 2: Random Spanning Trees

ilpi4ka3 MuHucrepcrBo o6pasobahufl Huxeropollcnofi o Onacrrl rocyaapctnennofi rrorosofi s2015 ro4y fl? /CI.?G

Convex Geometry. Carsten Schütt

i.ea IE !e e sv?f 'il i+x3p \r= v * 5,?: S i- co i, ==:= SOrq) Xgs'iY # oo .9 9 PE * v E=S s->'d =ar4lq 5,n =.9 '{nl a':1 t F #l *r C\ t-e

Transcription:

. UNCLASSIFIED. 273207 Reptoduced if ike ARMED SERVICES TECHNICAL INFORMATION AGENCY ARLINGTON HALL STATION ARLINGTON 12, VIRGINIA UNCLASSIFIED

NOTICE: When government or other drawings, specifications or other data are used for any purpose other than in connection with a definitely related government procurement operation, the U. S. Government thereby incurs no responsibility, nor any obligation -whatsoever; and the fact that the Government may have fozsulated, furnished, or in any way supplied the said drawings, specifications, or other data is not to be regarded by implication or otherwise as in any manner licensing the holder or any other person or corporation, or conveying any rights or permission to manufacture, use or sell any patented invention that may in any way be related thereto.

D1.82-0152 CM CO 01 BOEINGrl-JSsB RIES DO Uniform Distributions Over a Simplex G. Marsaglia Mathematics Research December, 1961 ASTIA "rprpnrirpna W MAK 23 1962 6 i - -i - s" ii: l.sja

Dl-82-0152 UNIFORM DISTRIBUTIONS OVER A SIMPLEX by G. Maraaglia Mathematical Note No. 250 Mathematics Research Laboratory BOEING SCIENTIFIC RESEARCH LABORATORIES December 1961

». UNIFORM DISTRIBUTIONS OVER A SIMPLEX 1. Introduction We are interested in a random assignment of n + 1 probabilities p..,...,p., with P-i+***+p + -i = l«by that we mean that the random vector IT = (p..,...,p,,) is uniformly distributed over the simplex f "I S, = (x 1,...,x ^j): x. > 0, 2 x. = ij-, and this, in turn, has a meaning we will make precise in section 2. We will find the joint distri- bution of the p's and consider various ways of representing the p's in terms of familiar random variables. It turns out that the joint distribution of the p's is very simple when given in terms of P[p 1 > a.,...,p,.,> a.-] rather than the conventional P[p 1 < a..,...,p..< a..], in fact, P[p 1 > a^^,...^^^ a ] = (l - a 1 - - a n+:l ) n. The principal purpose of the development is to get Theorem 4-> which provides a method for generating exponential (and hence normal, using polar coordinates) random variables In a computer IT is chosen from S,, then a random variable z is chosen so that zp 1»zp«,...,zp, are Independent and exponentially distributed. We will also point out how TT may be used to produce points uniformly over the simplex supported by an arbitrary set of linearly Independent points in space. Thus the main purpose of the development is to provide some theory on which certain "Monte Carlo" techniques may be based, but the development will also provide an approach to problems involving uniform order statistics which is different from that usually taken.

2. Uniform Distributions Let R be Euclidean n-space, and let \ be Lebesgue measure. We say that z,,...,z are jointly uniformly, distributed, or that the vector ^=(z 1,...,z) is uniformly distributed, over a subset SCR with positive Lebesgue measure, if the probability measure for C is proportional to Lebesgue measure for X-measurable B, P[(z,,...,z )eb] = X(B)/\(S). Then z..,...,z have a joint density function; it is constant, l/x{s), over S and zero elsewhere. If A is the n x n non-singular matrix of a linear transformation T, then T(C)J ( = CA), is uniformly distributed over the image set T(S). Let G be the simplex supported by k linearly independent points k k a,,...,a, in R : G = [ß: ß = Sea., c. > 0, Zc. = l]. We say that r\ = (y,,...,y, ) is uniformly distributed over the simplex G if for some 1 the vector (y-,»y^»»y* -i >y.! + -i >»jo i- s uniformly distributed) in the above sense, over the projection of G onto R, formed by suppressing the 1th coordinate, i.e., T.(G), where T. is the trans- formation (y 1,...,y k ) > (y 1 >y2>"-»y i _ 1»y i+1»-">y k ) taking K^ onto R,... This is equivalent to saying that the probability that r] fall in a subset H of G is proportional to the surface area of H. For each i, T.(n) will be uniformly distributed in the first sense over T.(G), except in the nuisance case when one of the coordinates, say x., of each point ^ = (x,...,x,) of G is constant; x. = c. Then only T.(i) will be uniformly distributed.

We note in particular that if ^ = (p-.».»p.,) is uniformly distributed over S = ^xl"--' x n+l ): x i ^0' 2x^1], then each set of n of the p's is uniformly distributed over the regular polytope n S* = {(x^...^): x i > 0, 2x^1}. If A is the k x k non-singular matrix of a linear transformation T, then T(ri), {=TIA), is uniformly distributed over the simplex T(G). This follows from noting that T is the product of elementary linear transformations, and if y 1,...,y, are uniformly distributed over a simplex, then ay 1,y 2,...,y k (a ^ 0), or y;?^^» >y k or y 1 + cy,y 5,...,y, are uniformly distributed over the appropriately transformed simplex. We have in particular: Theorem 1. If TT = (p,...,p ) is uniformly distributed over the simplex S = [(x^...,x ): x i > 0, 2 x i = l] and If * 1»««'»o are n + 1 linearly independent points in R.-i > then the random vector pa.. + p 5 cio + * + P + i a +1 is uniformly distributed over G, the l l d * n+l n+i simplex supported by the a's: G = [Y : Y = ^ c.a.,c. > 0, 2 c. = l]. 1 i i i 1 i This theorem provides a practical method for producing random points uniformly over regions with linear boundaries, for example, in certain Monte Carlo procedures, and it also shows how the distributions of the coordinates of a random uniform point from a simplex may be found in terms of the distribution of a linear combination of p..,...,p...

If Y-1 > >Y a re n linearly Independent points in R and (p 1,...,p ) is uniformly distributed over S* = [(^»...»x ): x. > 0, 2 x. < l], then P-IYT + * * + P Y is uniformly distributed over the set H = [ß: ß = 2 c^y^j c^ > 0, 2 c. < l}. Let Y 0 be "the origin. Then H may be viewed as the convex polytope supported by Y 0 >Y- >»«'>Y > i.e., H = [&: & = c^ + + c n Y n + c Y 0, c i > 0, 2 0.= l}. 1 Hence, if ß.. - ß n,...,ß - ß are linearly independent, and if TT = (p,,...,p,p,,) is uniformly distributed over = ((x 1,...,x ii+1 ): Xj^ ^ 0, 2x^^ = 1}, then Pi p i +... + p n ß n + p ß 0 = p 1 (ß 1 - ß 0 ) + p 2 (ß 2 _ ß o ) +... + P^Cß^ - ß n ) + ß n is uniformly distributed over the convex hull of n" r n ß 0,ß :.,...,ß, that set being the translate of the convex hull of ß 0 " ß 0,ß l " Po',,,,ß n " Po* Theorem 2. If tr = (p,...,p ) is uniformly distributed over the sim P lex s n+i = {( x 1'...» x ) : ^ > 0» 2 ^ =!] and if ß 0,ß 1,...,ß n are n + 1 points in R such that ß^-ß^...^ -ß are linearly Independent, then the random vector P-iß-i + + p ß + p., ß n is uniformly distributed over H, the convex polytope supported by the ß's: H = {6: 6 = d 1 ß 1 +... + d n ß n + d ß 0, d i > 0, 2 d i = 1}. The most common application of this result is in the plane to choose a point ß from the triangle formed by ß n >ßi>ß? we choose (p^p^p^) uniformly from S^ and put ß = p^ + p 2 ß 2 + P^Q. TO choose a point uniformly from a polygonal region in the plane, we divide

the region Into triangles, choose a triangle with probability proportional to its area, then choose a point -uniformly from that triangle. If (p-.,...^ ) is -uniformly distributed over the polytope S* = {(x-,...,x ) : x. ^ 0, 2 x, < l], then the vector U = (p-,»p-i + P 9 >«««ip-i + p? + *** + P ) is uniformly distributed over On = {(y -!» >y n ) s 0 < Yx < 72 1 '" < y n 1 1 ] and hence ^e components of u are distributed as the order statistics of independent uniform [0,1] random variables u,,...,u. Going in the other direction, if Uz-.x <U/ \ < ' < U/ \ are the order statistics of n Independent -uniform [0,1] random variables, then the vector (u/..\,u/ 2 -i - U/..\,,U/ -v - U/j, TO IS uniformly distributed over S* and the vector C^d).^(2) " u (i) ''' *' u ( n ) " u (n-l) ^ " U (n) ) ls uniformly distributed over S " ^Xl',, ',x n+j ): x i > 0, Z x i = l}. This relationship provides a practical method for producing TT uniformly on S, in a computer we order a set of n independent uniform random variables and take successive differences. We will need the following fact: if u,,...,u are Independent random variables, each uniform on [0,l], and 0 < c < 1, then (1) Pfa-L + +u <c]=c/n!. n J ' This is a special case of the well-known result on the distribution of the sum of uniform random variables, but it can be proved by Induction

mmmmmmammkmkmmmmmmtkktthkkskkkhm HBMn^HBHÜ quite easily, since 1 c P[u 1 + '"+ u < c] = 5 P[u + + u < c u = x]dx = 5 P[u 1 +*"+ u X 1 - x]dj We note that (l) gives the Lebesgue measure of the region (2) A = {(x 1,...,x n ): x 1 > 0,...,x n > 0, x 1 + + x n < c}. 3 The Joint Distribution of p..,...,p Theorem 3«If v - (p,,...^,p..^ is uniformly distributed over 1 n+l n n 1 S,, = [(x,,...,x ^j): x. > 0, 2 x. = l], then the.joint distribution of the p's is, for non-negative a..,...,a,, : P[p 1 > a 1,p 2 > a 2,...,p n > a n,p > a ] = (1 - a 1 - a 2 - - a ) n for a.. + + a... < 1 and zero for a, + +a,.. >1. l n+i i The proof follows readily from the fact that the two sets A = {(x^...^)^ > 0,...,x n > 0,x 1 +"'+ x n < cj B = l(y 1 >.-,y n ):y 1 - a^ 0,...,y n - a n > 0,(y 1 - a 1 )+(y 2 - a 2 ) + ---+(y n - a n ) < c] are congruent, and, by (2) and the remark preceding (2), their common Lebesgue measure is c /n t, for 0 < c < 1. Then P fpl> a l J ""Pn+l > a n+l ] = P^l > a l'- "?!!> "n' 1 " Pi - r p > a ] n n J =?[?!" *!> 0,...,p n - a n > 0 > (p 1 - a 1 )+---+(p n - a n )< 1 - ^ a n + l ] The latter is the probability that (p. (...,p ) will fall in B, with c = 1 - a^ - -a - a,, and hence equals X(B)/X(S*) = c. n n

Putting the appropriate a's equal to zero, we have Gorollary. If TT=(P,,...,p,p,) is uniformly distributed over S -, then the.joint distribution of p 1,...,p,,(k < n), is given by P[P 1 > a-j^,...,?^ a k ] = (1 - a 1 - a 2 - - a k ) n, a^ 0,a 1 + + a k < 1, and» taking partial derivatives, the.joint density of p,..,,p is n(n+l) (n-k+l)(l-x 1 ^^ for x i > 0 ' x 1 + * * *+ x k <! and zero elsewhere. We now get this interesting result: Theorem / k. If tt=(p 1,...,p +l ) is uniformly distributed over S,, = {(x^,...,x ): x. > 0, S x. = l], and if z has density function x e~ /n!, x > 0, and is independent of TT, then the random variables zp 1 >zp 2,...,zp are independent and exponentially distributed, (density e~, x > 0). given z: The proof comes from integrating the conditional probability for 00 n -x p[z Pl > b 1,...,zp > b ] = 5?[z Vl > h^...,^^ b z = x] ^-^ix 00 b n b.-.n-x oo v hnnv = f pr D > J. D > -S±l] x e dx = f n!l... n+ls n xv^ J.flP^ x'-"' p J X K n+l^ x ^Ti i,_ T ~T~> n' dx - 0 b,+---+b x jn x n; 1

Letting c = b^. + + b -, and y = x - c, we have 00 oo -, «n ^- c vn ) e -x t dx = e" 0 oo n -y j r nl 1 c -b. Thus P [zb^ b 1,..., zp > b ] = e 1, which means that zp 1,...,zp,, are Independent and each has density function e -A -x. direction: Noting that zp. ^1 = PJ» we have a result in the opposite Corollary. If y-, > >y,-1 are independent, exponential random variables, then "n+l y^+ -^y'n+l r,4.^, yi+'-'+y, " yi+'-'^n+i are uniformly distributed over the simplex S = ^Xl'--" X n+l ): X l ^0' ^xi =1^- The representation of p-,...,p ^ in terms of independent exponential random variables y,...,y provides an elementary method for establishing well-known properties of uniform order statistics. For example, let 7^2 y,+ +v v, = 1 y-l+'-'+y, v v = _li 12.» n+l 2 y 1 +-"-^y. n y.+'-'+y, Then (v 1,v,...,v ) are uniformly distributed over the polytope On = {( x 1»«"» x n) : 0 < x 1 < x 2 < < x n <l} and hence are distributed

as the order statistics of n independent uniform [0,1] random variables. Now let k be given, 1 < k ^ n. Then v 1,...,v, 1 may be written (5) y~+^^^^vk, and v,,,,...,v may be written 71*2?!+ *7, k-1 y^-'-^^k' '*, "y^t^r^p^k'? (6) 'k+l v. + (1-v. ) -. k k y k+l +,, " ty ', v, + (l-vj k ir k+l" +y k+2 yk+i + *--^ ^ + (1 - V k) W^T 'k+l 'n+l ' and it is obvious that, for given v, the random variables in (5) are distributed as the order statistics of k-1 uniform variables on the interval [0,v, ],and are independent of the variables in (6), which are distributed as the order statistics of (n-k) uniform variables on the interval [v,, 1 ]. One may prove directly that each of v,,...,v has a beta distribution, but an interesting alternative method is to take advantage of known facts concerning the ratios of quadratic forms in normal variables, as each of the v's may be viewed as such. The relationship between the beta and the F distributions may be brought in at this point, too.