Symmetrization methods

From testwiki
Jump to navigation Jump to search

Template:Short description In mathematics the symmetrization methods are algorithms of transforming a set An to a ball Bn with equal volume vol(B)=vol(A) and centered at the origin. B is called the symmetrized version of A, usually denoted A*. These algorithms show up in solving the classical isoperimetric inequality problem, which asks: Given all two-dimensional shapes of a given area, which of them has the minimal perimeter (for details see Isoperimetric inequality). The conjectured answer was the disk and Steiner in 1838 showed this to be true using the Steiner symmetrization method (described below). From this many other isoperimetric problems sprung and other symmetrization algorithms. For example, Rayleigh's conjecture is that the first eigenvalue of the Dirichlet problem is minimized for the ball (see Rayleigh–Faber–Krahn inequality for details). Another problem is that the Newtonian capacity of a set A is minimized by A* and this was proved by Polya and G. Szego (1951) using circular symmetrization (described below).

Symmetrization

If Ωn is measurable, then it is denoted by Ω* the symmetrized version of Ω i.e. a ball Ω*:=Br(0)n such that vol(Ω*)=vol(Ω). We denote by f* the symmetric decreasing rearrangement of nonnegative measurable function f and define it as f*(x):=01{y:f(y)>t}*(x)dt, where {y:f(y)>t}* is the symmetrized version of preimage set {y:f(y)>t}. The methods described below have been proved to transform Ω to Ω* i.e. given a sequence of symmetrization transformations {Tk} there is lim\limits kdHa(Ω*,Tk(K))=0, where dHa is the Hausdorff distance (for discussion and proofs see Template:Harvtxt)

Steiner symmetrization

Steiner Symmetrization of set Ω

Steiner symmetrization was introduced by Steiner (1838) to solve the isoperimetric theorem stated above. Let Hn be a hyperplane through the origin. Rotate space so that H is the xn=0 (xn is the nth coordinate in n) hyperplane. For each xH let the perpendicular line through xH be Lx={x+yen:y}. Then by replacing each ΩLx by a line centered at H and with length |ΩLx| we obtain the Steiner symmetrized version.

St(Ω):={x+yen:x+zenΩ for some z and |y|12|ΩLx|}.

It is denoted by St(f) the Steiner symmetrization wrt to xn=0 hyperplane of nonnegative measurable function f:d and for fixed x1,,xn1 define it as

St:f(x1,,xn1,)(f(x1,,xn1,))*.

Properties

  • It preserves convexity: if Ω is convex, then St(Ω) is also convex.
  • It is linear: St(x+λΩ)=St(x)+λSt(Ω).
  • Super-additive: St(K)+St(U)St(K+U).

Circular symmetrization

Circular symmetrization of set Ω

A popular method for symmetrization in the plane is Polya's circular symmetrization. After, its generalization will be described to higher dimensions. Let Ω be a domain; then its circular symmetrization Circ(Ω) with regard to the positive real axis is defined as follows: Let

Ωt:={θ[0,2π]:teiθΩ}

i.e. contain the arcs of radius t contained in Ω. So it is defined

  • If Ωt is the full circle, then Circ(Ω){|z|=t}:={|z|=t}.
  • If the length is m(Ωt)=α, then Circ(Ω){|z|=t}:={teiθ:|θ|<α2}.
  • 0,Circ(Ω) iff 0,Ω.

In higher dimensions Ωn, its spherical symmetrization Spn(Ω) wrt to positive axis of x1 is defined as follows: Let Ωr:={x𝕊n1:rxΩ} i.e. contain the caps of radius r contained in Ω. Also, for the first coordinate let angle(x1):=θ if x1=rcosθ. So as above

  • If Ωr is the full cap, then Spn(Ω){|z|=r}:={|z|=r}.
  • If the surface area is ms(Ωt)=α, then Spn(Ω){|z|=r}:={x:|x|=r and 0angle(x1)θα}=:C(θα) where θα is picked so that its surface area is ms(C(θα)=α. In words, C(θα) is a cap symmetric around the positive axis x1 with the same area as the intersection Ω{|z|=r}.
  • 0,Spn(Ω) iff 0,Ω.

Polarization

Polarization of set Ω

Let Ωn be a domain and Hn1n be a hyperplane through the origin. Denote the reflection across that plane to the positive halfspace + as σH or just σ when it is clear from the context. Also, the reflected Ω across hyperplane H is defined as σΩ. Then, the polarized Ω is denoted as Ωσ and defined as follows

  • If xΩ+, then xΩσ.
  • If xΩσ(Ω), then xΩσ.
  • If x(Ωσ(Ω)), then σxΩσ.

In words, (Ωσ(Ω)) is simply reflected to the halfspace +. It turns out that this transformation can approximate the above ones (in the Hausdorff distance) (see Template:Harvtxt).

References

Template:Reflist