|
Algebraic Quantum Field Theory
Algebraic quantum field theory (AQFT) is an application to local quantum physics of C*-algebra theory. Also referred to as the Haag–Kastler axiomatic framework for quantum field theory, because it was introduced by . The axioms are stated in terms of an algebra given for every open set in Minkowski space, and mappings between those. Haag–Kastler axioms Let \mathcal be the set of all open and bounded subsets of Minkowski space. An algebraic quantum field theory is defined via a net \_ of von Neumann algebras \mathcal(O) on a common Hilbert space \mathcal satisfying the following axioms: * ''Isotony'': O_1 \subset O_2 implies \mathcal(O_1) \subset \mathcal(O_2). * ''Causality'': If O_1 is space-like separated from O_2, then mathcal(O_1),\mathcal(O_2)0. * ''Poincaré covariance'': A strongly continuous unitary representation U(\mathcal) of the Poincaré group \mathcal on \mathcal exists such that \mathcal(gO) = U(g) \mathcal(O) U(g)^*, g \in \mathcal. * ''Spectrum condition' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
C*-algebra
In mathematics, specifically in functional analysis, a C∗-algebra (pronounced "C-star") is a Banach algebra together with an involution satisfying the properties of the adjoint. A particular case is that of a complex algebra ''A'' of continuous linear operators on a complex Hilbert space with two additional properties: * ''A'' is a topologically closed set in the norm topology of operators. * ''A'' is closed under the operation of taking adjoints of operators. Another important class of non-Hilbert C*-algebras includes the algebra C_0(X) of complex-valued continuous functions on ''X'' that vanish at infinity, where ''X'' is a locally compact Hausdorff space. C*-algebras were first considered primarily for their use in quantum mechanics to model algebras of physical observables. This line of research began with Werner Heisenberg's matrix mechanics and in a more mathematically developed form with Pascual Jordan around 1933. Subsequently, John von Neumann attempted to establi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Poincaré Covariance
Poincaré is a French surname. Notable people with the surname include: * Henri Poincaré (1854–1912), French physicist, mathematician and philosopher of science * Henriette Poincaré (1858-1943), wife of Prime Minister Raymond Poincaré * Lucien Poincaré (1862–1920), physicist, brother of Raymond and cousin of Henri * Raymond Poincaré (1860–1934), French Prime Minister or President ''inter alia'' from 1913 to 1920, cousin of Henri See also *List of things named after Henri Poincaré In physics and mathematics, a number of ideas are named after Henri Poincaré: * Euler–Poincaré characteristic * Hilbert–Poincaré series * Poincaré–Bendixson theorem * Poincaré–Birkhoff theorem * Poincaré–Birkhoff–Witt theorem, u .... * * {{DEFAULTSORT:Poincare French-language surnames ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Presheaf
In mathematics, a sheaf is a tool for systematically tracking data (such as sets, abelian groups, rings) attached to the open sets of a topological space and defined locally with regard to them. For example, for each open set, the data could be the ring of continuous functions defined on that open set. Such data is well behaved in that it can be restricted to smaller open sets, and also the data assigned to an open set is equivalent to all collections of compatible data assigned to collections of smaller open sets covering the original open set (intuitively, every piece of data is the sum of its parts). The field of mathematics that studies sheaves is called sheaf theory. Sheaves are understood conceptually as general and abstract objects. Their correct definition is rather technical. They are specifically defined as sheaves of sets or as sheaves of rings, for example, depending on the type of data assigned to the open sets. There are also maps (or morphisms) from one ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Net (mathematics)
In mathematics, more specifically in general topology and related branches, a net or Moore–Smith sequence is a generalization of the notion of a sequence. In essence, a sequence is a function whose domain is the natural numbers. The codomain of this function is usually some topological space. The motivation for generalizing the notion of a sequence is that, in the context of topology, sequences do not fully encode all information about functions between topological spaces. In particular, the following two conditions are, in general, not equivalent for a map f between topological spaces X and Y: #The map f is continuous in the topological sense; #Given any point x in X, and any sequence in X converging to x, the composition of f with this sequence converges to f(x) (continuous in the sequential sense). While it is necessarily true that condition 1 implies condition 2 (The truth of the condition 1 ensures the truth of the conditions 2.), the reverse implication is not nece ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Partial Trace
In linear algebra and functional analysis, the partial trace is a generalization of the trace. Whereas the trace is a scalar valued function on operators, the partial trace is an operator-valued function. The partial trace has applications in quantum information and decoherence which is relevant for quantum measurement and thereby to the decoherent approaches to interpretations of quantum mechanics, including consistent histories and the relative state interpretation. Details Suppose V, W are finite-dimensional vector spaces over a field, with dimensions m and n, respectively. For any space A, let L(A) denote the space of linear operators on A. The partial trace over W is then written as \operatorname_W: \operatorname(V \otimes W) \to \operatorname(V). It is defined as follows: For T\in \operatorname(V \otimes W), let e_1, \ldots, e_m , and f_1, \ldots, f_n , be bases for ''V'' and ''W'' respectively; then ''T'' has a matrix representation : \ \quad 1 \leq k, i \leq m, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Norm (mathematics)
In mathematics, a norm is a function from a real or complex vector space to the non-negative real numbers that behaves in certain ways like the distance from the origin: it commutes with scaling, obeys a form of the triangle inequality, and is zero only at the origin. In particular, the Euclidean distance of a vector from the origin is a norm, called the Euclidean norm, or 2-norm, which may also be defined as the square root of the inner product of a vector with itself. A seminorm satisfies the first two properties of a norm, but may be zero for vectors other than the origin. A vector space with a specified norm is called a normed vector space. In a similar manner, a vector space with a seminorm is called a ''seminormed vector space''. The term pseudonorm has been used for several related meanings. It may be a synonym of "seminorm". A pseudonorm may satisfy the same axioms as a norm, with the equality replaced by an inequality "\,\leq\," in the homogeneity axiom. It can also re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Positive Linear Functional
In mathematics, more specifically in functional analysis, a positive linear functional on an ordered vector space (V, \leq) is a linear functional f on V so that for all positive elements v \in V, that is v \geq 0, it holds that f(v) \geq 0. In other words, a positive linear functional is guaranteed to take nonnegative values for positive elements. The significance of positive linear functionals lies in results such as Riesz–Markov–Kakutani representation theorem. When V is a complex vector space, it is assumed that for all v\ge0, f(v) is real. As in the case when V is a C*-algebra with its partially ordered subspace of self-adjoint elements, sometimes a partial order is placed on only a subspace W\subseteq V, and the partial order does not extend to all of V, in which case the positive elements of V are the positive elements of W, by abuse of notation. This implies that for a C*-algebra, a positive linear functional sends any x \in V equal to s^s for some s \in V to a real nu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
State (functional Analysis)
In functional analysis, a state of an operator system is a positive linear functional of norm 1. States in functional analysis generalize the notion of density matrices in quantum mechanics, which represent quantum states, both . Density matrices in turn generalize state vectors, which only represent pure states. For ''M'' an operator system in a C*-algebra ''A'' with identity, the set of all states of'' ''M, sometimes denoted by S(''M''), is convex, weak-* closed in the Banach dual space ''M''*. Thus the set of all states of ''M'' with the weak-* topology forms a compact Hausdorff space, known as the state space of ''M'' . In the C*-algebraic formulation of quantum mechanics, states in this previous sense correspond to physical states, i.e. mappings from physical observables (self-adjoint elements of the C*-algebra) to their expected measurement outcome (real number). Jordan decomposition States can be viewed as noncommutative generalizations of probability measures. By Gel ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Isomorphism
In mathematics, an isomorphism is a structure-preserving mapping between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word isomorphism is derived from the Ancient Greek: ἴσος ''isos'' "equal", and μορφή ''morphe'' "form" or "shape". The interest in isomorphisms lies in the fact that two isomorphic objects have the same properties (excluding further information such as additional structure or names of objects). Thus isomorphic structures cannot be distinguished from the point of view of structure only, and may be identified. In mathematical jargon, one says that two objects are . An automorphism is an isomorphism from a structure to itself. An isomorphism between two structures is a canonical isomorphism (a canonical map that is an isomorphism) if there is only one isomorphism between the two structures (as it is the case for solutions of a univer ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Causal Completion
Causality (also referred to as causation, or cause and effect) is influence by which one event, process, state, or object (''a'' ''cause'') contributes to the production of another event, process, state, or object (an ''effect'') where the cause is partly responsible for the effect, and the effect is partly dependent on the cause. In general, a process has many causes, which are also said to be ''causal factors'' for it, and all lie in its past. An effect can in turn be a cause of, or causal factor for, many other effects, which all lie in its future. Some writers have held that causality is metaphysically prior to notions of time and space. Causality is an abstraction that indicates how the world progresses. As such a basic concept, it is more apt as an explanation of other concepts of progression than as something to be explained by others more basic. The concept is like those of agency and efficacy. For this reason, a leap of intuition may be needed to grasp it. Accordi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Commutative Operation
In mathematics, a binary operation is commutative if changing the order of the operands does not change the result. It is a fundamental property of many binary operations, and many mathematical proofs depend on it. Most familiar as the name of the property that says something like or , the property can also be used in more advanced settings. The name is needed because there are operations, such as division and subtraction, that do not have it (for example, ); such operations are ''not'' commutative, and so are referred to as ''noncommutative operations''. The idea that simple operations, such as the multiplication and addition of numbers, are commutative was for many years implicitly assumed. Thus, this property was not named until the 19th century, when mathematics started to become formalized. A similar property exists for binary relations; a binary relation is said to be symmetric if the relation applies regardless of the order of its operands; for example, equality is symme ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Image (mathematics)
In mathematics, the image of a function is the set of all output values it may produce. More generally, evaluating a given function f at each element of a given subset A of its domain produces a set, called the "image of A under (or through) f". Similarly, the inverse image (or preimage) of a given subset B of the codomain of f, is the set of all elements of the domain that map to the members of B. Image and inverse image may also be defined for general binary relations, not just functions. Definition The word "image" is used in three related ways. In these definitions, f : X \to Y is a function from the set X to the set Y. Image of an element If x is a member of X, then the image of x under f, denoted f(x), is the value of f when applied to x. f(x) is alternatively known as the output of f for argument x. Given y, the function f is said to "" or "" if there exists some x in the function's domain such that f(x) = y. Similarly, given a set S, f is said to "" if there exi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
