Bootstrap model

Bootstrap model

In physics, the term bootstrap model is used for a class of theories that use very general consistency criteria to determine the form of a quantum theory from some assumptions on the spectrum of particles.

In the 1960s and '70s, the ever-growing list of strongly interacting particles — mesons and baryons — made it clear to physicists that none of these particles are elementary. Geoffrey Chew and others went so far as to question the distinction between composite and elementary particles, advocating a "nuclear democracy" in which the idea that some particles were more elementary than others was discarded. Instead, they sought to derive as much information as possible about the strong interaction from plausible assumptions about the S-matrix, which describes what happens when particles of any sort collide, an approach advocated by Werner Heisenberg two decades earlier.

The reason the program had any hope of success was because of crossing, the principle that the forces between particles are determined by particle exchange. Once the spectrum of particles is known, the force law is known, and this means that the spectrum is constrained to bound states which form through the action of these forces. The simplest way to solve the consistency condition is to postulate a few elementary particles of spin less than or equal to one, and construct the scattering perturbatively through field theory, but this method does not allow for particles of spin greater than 1 and without the then undiscoved phenomenon of confinement, it is naively inconsistent with the observed Regge behavior of hadrons.

Chew and followers believed that it would be possible to use crossing symmetry and Regge behavior to formulate a consistent S-matrix for infinitely many particle types. The Regge hypothesis would determine the spectrum, crossing and analyticity would determine the scattering amplitude--- the forces, while unitarity would determine the self-consistent quantum corrections in a way analogous to including loops. The only fully successful implementation of the program required another assumption to organize the mathematics of unitarity--- the narrow resonance approximation. This meant that all the hadrons were stable particles in the first approximation, so that scattering and decays could be thought of as a perturbation. This allowed a bootstrap model with infinitely many particle types to be constructed like a field theory--- the lowest order scattering amplitude should show Regge behavior and unitarity would determine the loop corrections order by order. This is how Gabriele Veneziano and many others, constructed string theory, which remains the only theory constructed from general consistency conditions and mild assumptions on the spectrum.

Many in the bootstrap community believed that field theory, which was plagued by problems of definition, was fundamentally inconsistent at high energies. Some believed that there is only one consistent theory which requires infinitely many particle species and whose form can be found by consistency alone. This is nowadays known not to be true, since there are many theories which are nonperturbatively consistent, each with their own S-matrix. Without the narrow-resonance approximation, the bootstrap program did not have a clear expansion parameter, and the consistency equations were often complicated and unwieldy, so that the method had limited success. It fell out of favor with the rise of quantum chromodynamics, which described mesons and baryons in terms of elementary particles called quarks and gluons.

More generally, "bootstrapping" refers to any method of reaching higher understanding by building on lower foundations. The name derives from the fictional Baron Munchausen, one of whose many tall tales involved lifting himself off the ground by pulling on the laces of his own boots.

References

* R. J. Eden, P. V. Landshoff, D. I. Olive and J. C. Polkinghorne, "The Analytic S-Matrix", Cambridge U. Press, 1966.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Bootstrap aggregating — (bagging) is a meta algorithm to improve machine learning of classification and regression models in terms of stability and classification accuracy. It also reduces variance and helps to avoid overfitting. Although it is usually applied to… …   Wikipedia

  • Bootstrap paradox — The bootstrap paradox is a paradox of time travel in which information or objects can exist without having been created. After information or an object is sent back in time, it is recovered in the present and becomes the very object/information… …   Wikipedia

  • Bootstrap Network — The Bootstrap Network is where people help each other start businesses through trust and support. Influenced by the successes of the Open source model and successful entrepreneurs like Richard Branson, it encourages development through modular… …   Wikipedia

  • Bootstrap funding — Financial bootstrapping is a term used to cover different methods for avoiding using the financial resources of external investors. Bootstrapping can be defined as “a collection of methods used to minimize the amount of outside debt and equity… …   Wikipedia

  • Operation Bootstrap — For other uses, see Bootstrapping and Bootstrapping (law). Operation Bootstrap (Operación Manos a la Obra) is the name given to the ambitious projects which industrialized Puerto Rico in the mid 20th century. Contents 1 History 2 See also 3… …   Wikipedia

  • Werner Nahm — (2004) Werner Nahm ist ein deutscher mathematischer und theoretischer Physiker. Nahm studierte ab 1966 an der Goethe Universität Frankfurt am Main und der Ludwig Maximilians Universität München, wo er 1970 sein Diplom in Physik erwarb. Er… …   Deutsch Wikipedia

  • Steven Frautschi — Steven C. Frautschi (* 6. Dezember 1933) ist ein US amerikanischer theoretischer Physiker. Frautschi wuchs in Madison (Wisconsin) auf und studierte ab dem Alter von 16 Jahren an der Harvard University bei John H. van Vleck. 1954 graduierte er und …   Deutsch Wikipedia

  • Bootstrapping (statistics) — In statistics, bootstrapping is a modern, computer intensive, general purpose approach to statistical inference, falling within a broader class of resampling methods.Bootstrapping is the practice of estimating properties of an estimator (such as… …   Wikipedia

  • Maximum parsimony — Maximum parsimony, often simply referred to as parsimony, is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under maximum parsimony, the preferred phylogenetic tree is the tree that… …   Wikipedia

  • Maximum parsimony (phylogenetics) — Parsimony is a non parametric statistical method commonly used in computational phylogenetics for estimating phylogenies. Under parsimony, the preferred phylogenetic tree is the tree that requires the least evolutionary change to explain some… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”