Closed trapped surfaces are a concept used in black hole solutions of general relativity which describe the inner region of an event horizon. Roger Penrose defined the notion of closed trapped surfaces in 1965. A trapped surface is one where light is not moving away from the black hole. The boundary of the union of all trapped surfaces around a black hole is called an apparent horizon. A related term trapped null surface is often used interchangeably. However, when discussing causal horizons, trapped null surfaces are defined as only null vector fields giving rise to null surfaces. But marginally trapped surfaces may be spacelike, timelike or null. They are spacelike surfaces (topological spheres, tubes, etc.) with restricted bounds, their area tending to decrease locally along any possible future direction and with a dual definition with respect to the past. The trapped surface is a spacelike surface of co-dimension 2, in a Lorentzian spacetime. It follows that any normal vector can be expressed as a linear combination of two future directed null vectors, normalised by: k+ · k− = −2 The k+ vector is directed “outwards” and k− “inwards”. The set of all such vectors engenders one outgoing and one ingoing null congruence. The surface is designated trapped if the cross sections of both congruences decrease in area as they exit the surface; and this is apparent in the mean curvature vector, which is: Hɑ= −θ+k−ɑ − θ−k+ɑ The surface is trapped if both the null expansions θ± are negative, signifying that the mean curvature vector is timelike and future directed. The surface is marginally trapped if the outer expansion θ+ = 0 and the inner expansion θ− ≤ 0. A trapped null surface is a set of points defined in the context of general relativity as a closed surface on which outward-pointing light rays are actually converging (moving inwards). Trapped null surfaces are used in the definition of the apparent horizon which typically surrounds a black hole. We take a (compact, orientable, spacelike) surface, and find its outward pointing normal vectors.

À propos de ce résultat
Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.