*-algebra

From HandWiki

In mathematics, and more specifically in abstract algebra, a *-algebra (or involutive algebra; read as "star-algebra") is a mathematical structure consisting of two involutive rings R and A, where R is commutative and A has the structure of an associative algebra over R. Involutive algebras generalize the idea of a number system equipped with conjugation, for example the complex numbers and complex conjugation, matrices over the complex numbers and conjugate transpose, and linear operators over a Hilbert space and Hermitian adjoints. However, it may happen that an algebra admits no involution.[lower-alpha 1]

Definitions

*-ring

In mathematics, a *-ring is a ring with a map * : AA that is an antiautomorphism and an involution.

More precisely, * is required to satisfy the following properties:[1]

  • (x + y)* = x* + y*
  • (x y)* = y* x*
  • 1* = 1
  • (x*)* = x

for all x, y in A.

This is also called an involutive ring, involutory ring, and ring with involution. The third axiom is implied by the second and fourth axioms, making it redundant.

Elements such that x* = x are called self-adjoint.[2]

Archetypical examples of a *-ring are fields of complex numbers and algebraic numbers with complex conjugation as the involution. One can define a sesquilinear form over any *-ring.

Also, one can define *-versions of algebraic objects, such as ideal and subring, with the requirement to be *-invariant: xIx* ∈ I and so on.

*-rings are unrelated to star semirings in the theory of computation.

*-algebra

A *-algebra A is a *-ring,[lower-alpha 2] with involution * that is an associative algebra over a commutative *-ring R with involution , such that (r x)* = rx*  ∀rR, xA.[3]

The base *-ring R is often the complex numbers (with acting as complex conjugation).

It follows from the axioms that * on A is conjugate-linear in R, meaning

(λ x + μy)* = λx* + μy*

for λ, μR, x, yA.

A *-homomorphism f : AB is an algebra homomorphism that is compatible with the involutions of A and B, i.e.,

  • f(a*) = f(a)* for all a in A.[2]

Philosophy of the *-operation

The *-operation on a *-ring is analogous to complex conjugation on the complex numbers. The *-operation on a *-algebra is analogous to taking adjoints in complex matrix algebras.

Notation

The * involution is a unary operation written with a postfixed star glyph centered above or near the mean line:

xx*, or
xx (TeX: x^*),

but not as "x"; see the asterisk article for details.

Examples

  • Any commutative ring becomes a *-ring with the trivial (identical) involution.
  • The most familiar example of a *-ring and a *-algebra over reals is the field of complex numbers C where * is just complex conjugation.
  • More generally, a field extension made by adjunction of a square root (such as the imaginary unit −1) is a *-algebra over the original field, considered as a trivially-*-ring. The * flips the sign of that square root.
  • A quadratic integer ring (for some D) is a commutative *-ring with the * defined in the similar way; quadratic fields are *-algebras over appropriate quadratic integer rings.
  • Quaternions, split-complex numbers, dual numbers, and possibly other hypercomplex number systems form *-rings (with their built-in conjugation operation) and *-algebras over reals (where * is trivial). None of the three is a complex algebra.
  • Hurwitz quaternions form a non-commutative *-ring with the quaternion conjugation.
  • The matrix algebra of n × n matrices over R with * given by the transposition.
  • The matrix algebra of n × n matrices over C with * given by the conjugate transpose.
  • Its generalization, the Hermitian adjoint in the algebra of bounded linear operators on a Hilbert space also defines a *-algebra.
  • The polynomial ring R[x] over a commutative trivially-*-ring R is a *-algebra over R with P *(x) = P (−x).
  • If (A, +, ×, *) is simultaneously a *-ring, an algebra over a ring R (commutative), and (r x)* = r (x*)  ∀rR, xA, then A is a *-algebra over R (where * is trivial).
    • As a partial case, any *-ring is a *-algebra over integers.
  • Any commutative *-ring is a *-algebra over itself and, more generally, over any its *-subring.
  • For a commutative *-ring R, its quotient by any its *-ideal is a *-algebra over R.
    • For example, any commutative trivially-*-ring is a *-algebra over its dual numbers ring, a *-ring with non-trivial *, because the quotient by ε = 0 makes the original ring.
    • The same about a commutative ring K and its polynomial ring K[x]: the quotient by x = 0 restores K.
  • In Hecke algebra, an involution is important to the Kazhdan–Lusztig polynomial.
  • The endomorphism ring of an elliptic curve becomes a *-algebra over the integers, where the involution is given by taking the dual isogeny. A similar construction works for abelian varieties with a polarization, in which case it is called the Rosati involution (see Milne's lecture notes on abelian varieties).

Involutive Hopf algebras are important examples of *-algebras (with the additional structure of a compatible comultiplication); the most familiar example being:

Non-Example

Not every algebra admits an involution:

Regard the 2×2 matrices over the complex numbers. Consider the following subalgebra: 𝒜:={(ab00):a,b}

Any nontrivial antiautomorphism necessarily has the form:[4] φz[(1000)]=(1z00)φz[(0100)]=(0000) for any complex number z.

It follows that any nontrivial antiautomorphism fails to be involutive: φz2[(0100)]=(0000)(0100)

Concluding that the subalgebra admits no involution.

Additional structures

Many properties of the transpose hold for general *-algebras:

  • The Hermitian elements form a Jordan algebra;
  • The skew Hermitian elements form a Lie algebra;
  • If 2 is invertible in the *-ring, then the operators 1/2(1 + *) and 1/2(1 − *) are orthogonal idempotents,[2] called symmetrizing and anti-symmetrizing, so the algebra decomposes as a direct sum of modules (vector spaces if the *-ring is a field) of symmetric and anti-symmetric (Hermitian and skew Hermitian) elements. These spaces do not, generally, form associative algebras, because the idempotents are operators, not elements of the algebra.

Skew structures

Given a *-ring, there is also the map −* : x ↦ −x*. It does not define a *-ring structure (unless the characteristic is 2, in which case −* is identical to the original *), as 1 ↦ −1, neither is it antimultiplicative, but it satisfies the other axioms (linear, involution) and hence is quite similar to *-algebra where xx*.

Elements fixed by this map (i.e., such that a = −a*) are called skew Hermitian.

For the complex numbers with complex conjugation, the real numbers are the Hermitian elements, and the imaginary numbers are the skew Hermitian.

See also

Notes

  1. In this context, involution is taken to mean an involutory antiautomorphism, also known as an anti-involution.
  2. Most definitions do not require a *-algebra to have the unity, i.e. a *-algebra is allowed to be a *-rng only.

References

  1. Weisstein, Eric W. (2015). "C-Star Algebra". http://mathworld.wolfram.com/C-Star-Algebra.html. 
  2. 2.0 2.1 2.2 Baez, John (2015). "Octonions". University of California, Riverside. Archived from the original on 26 March 2015. https://web.archive.org/web/20150326133405/http://math.ucr.edu/home/baez/octonions/node5.html. Retrieved 27 January 2015. 
  3. star-algebra in nLab
  4. Winker, S. K.; Wos, L.; Lusk, E. L. (1981). "Semigroups, Antiautomorphisms, and Involutions: A Computer Solution to an Open Problem, I". Mathematics of Computation 37 (156): 533–545. doi:10.2307/2007445. ISSN 0025-5718. https://www.jstor.org/stable/2007445. 

Template:Spectral theory

Short description: Algebraic structure of set algebra

In mathematical analysis and in probability theory, a σ-algebra ("sigma algebra") is part of the formalism for defining sets that can be measured. In calculus and analysis, for example, σ-algebras are used to define the concept of sets with area or volume. In probability theory, they are used to define events with a well-defined probability. In this way, σ-algebras help to formalize the notion of size.

In formal terms, a σ-algebra (also σ-field, where the σ comes from the German "Summe",[1] meaning "sum") on a set X is a nonempty collection Σ of subsets of X closed under complement, countable unions, and countable intersections. The ordered pair (X,Σ) is called a measurable space.

The set X is understood to be an ambient space (such as the 2D plane or the set of outcomes when rolling a six-sided die {1,2,3,4,5,6}), and the collection Σ is a choice of subsets declared to have a well-defined size. The closure requirements for σ-algebras are designed to capture our intuitive ideas about how sizes combine: if there is a well-defined probability that an event occurs, there should be a well-defined probability that it does not occur (closure under complements); if several sets have a well-defined size, so should their combination (countable unions); if several events have a well-defined probability of occurring, so should the event where they all occur simultaneously (countable intersections).

The definition of σ-algebra resembles other mathematical structures such as a topology (which is required to be closed under all unions but only finite intersections, and which doesn't necessarily contain all complements of its sets) or a set algebra (which is closed only under finite unions and intersections).

Examples of σ-algebras

If X={a,b,c,d} one possible σ-algebra on X is Σ={,{a,b},{c,d},{a,b,c,d}}, where is the empty set. In general, a finite algebra is always a σ-algebra.

If {A1,A2,A3,}, is a countable partition of X then the collection of all unions of sets in the partition (including the empty set) is a σ-algebra.

A more useful example is the set of subsets of the real line formed by starting with all open intervals and adding in all countable unions, countable intersections, and relative complements and continuing this process (by transfinite iteration through all countable ordinals) until the relevant closure properties are achieved (a construction known as the Borel hierarchy).

Motivation

There are at least three key motivators for σ-algebras: defining measures, manipulating limits of sets, and managing partial information characterized by sets.

Measure

A measure on X is a function that assigns a non-negative real number to subsets of X; this can be thought of as making precise a notion of "size" or "volume" for sets. We want the size of the union of disjoint sets to be the sum of their individual sizes, even for an infinite sequence of disjoint sets.

One would like to assign a size to every subset of X, but in many natural settings, this is not possible. For example, the axiom of choice implies that when the size under consideration is the ordinary notion of length for subsets of the real line, then there exist sets for which no size exists, for example, the Vitali sets. For this reason, one considers instead a smaller collection of privileged subsets of X. These subsets will be called the measurable sets. They are closed under operations that one would expect for measurable sets, that is, the complement of a measurable set is a measurable set and the countable union of measurable sets is a measurable set. Non-empty collections of sets with these properties are called σ-algebras.

Limits of sets

Many uses of measure, such as the probability concept of almost sure convergence, involve limits of sequences of sets. For this, closure under countable unions and intersections is paramount. Set limits are defined as follows on σ-algebras.

  • The limit supremum or outer limit of a sequence A1,A2,A3, of subsets of X is lim supnAn=n=1m=nAm=n=1AnAn+1. It consists of all points x that are in infinitely many of these sets (or equivalently, that are in cofinally many of them). That is, xlim supnAn if and only if there exists an infinite subsequence An1,An2, (where n1<n2<) of sets that all contain x; that is, such that xAn1An2.
  • The limit infimum or inner limit of a sequence A1,A2,A3, of subsets of X is lim infnAn=n=1m=nAm=n=1AnAn+1. It consists of all points that are in all but finitely many of these sets (or equivalently, that are eventually in all of them). That is, xlim infnAn if and only if there exists an index N such that AN,AN+1, all contain x; that is, such that xANAN+1.

The inner limit is always a subset of the outer limit: lim infnAnlim supnAn. If these two sets are equal then their limit limnAn exists and is equal to this common set: limnAn:=lim infnAn=lim supnAn.

Sub σ-algebras

In much of probability, especially when conditional expectation is involved, one is concerned with sets that represent only part of all the possible information that can be observed. This partial information can be characterized with a smaller σ-algebra which is a subset of the principal σ-algebra; it consists of the collection of subsets relevant only to and determined only by the partial information. Formally, if Σ,Σ are σ-algebras on X, then Σ is a sub σ-algebra of Σ if ΣΣ.

The Bernoulli process provides a simple example. This consists of a sequence of random coin flips, coming up Heads (H) or Tails (T), of unbounded length. The sample space Ω consists of all possible infinite sequences of H or T: Ω={H,T}={(x1,x2,x3,):xi{H,T},i1}.

The full sigma algebra can be generated from an ascending sequence of subalgebras, by considering the information that might be obtained after observing some or all of the first n coin flips. This sequence of subalgebras is given by 𝒢n={A×{Ω}:A{H,T}n} Each of these is finer than the last, and so can be ordered as a filtration

𝒢0𝒢1𝒢2𝒢

The first subalgebra 𝒢0={,Ω} is the trivial algebra: it has only two elements in it, the empty set and the total space. The second subalgebra 𝒢1 has four elements: the two in 𝒢0 plus two more: sequences that start with H and sequences that start with T. Each subalgebra is finer than the last. The n'th subalgebra contains 2n+1 elements: it divides the total space Ω into all of the possible sequences that might have been observed after n flips, including the possible non-observation of some of the flips.

The limiting algebra 𝒢 is the smallest σ-algebra containing all the others. It is the algebra generated by the product topology or weak topology on the product space {H,T}.

Definition and properties

Definition

Let X be some set, and let P(X) represent its power set, the set of all subsets of X. Then a subset ΣP(X) is called a σ-algebra if it satisfies the following three properties:[2]

  1. X is in Σ.
  2. Σ is closed under complementation: If some set A is in Σ, then so is its complement, XA.
  3. Σ is closed under countable unions: If A1,A2,A3, are in Σ, then so is A=A1A2A3.

From these properties, it follows that the σ-algebra is also closed under countable intersections (by applying De Morgan's laws).

It also follows that the empty set is in Σ, since by (1) X is in Σ and (2) asserts that its complement, the empty set, is also in Σ. Moreover, since {X,} satisfies all 3 conditions, it follows that {X,} is the smallest possible σ-algebra on X. The largest possible σ-algebra on X is P(X).

Elements of the σ-algebra are called measurable sets. An ordered pair (X,Σ), where X is a set and Σ is a σ-algebra over X, is called a measurable space. A function between two measurable spaces is called a measurable function if the preimage of every measurable set is measurable. The collection of measurable spaces forms a category, with the measurable functions as morphisms. Measures are defined as certain types of functions from a σ-algebra to [0,].

A σ-algebra is both a π-system and a Dynkin system (λ-system). The converse is true as well, by Dynkin's theorem (see below).

Dynkin's π-λ theorem

This theorem (or the related monotone class theorem) is an essential tool for proving many results about properties of specific σ-algebras. It capitalizes on the nature of two simpler classes of sets, namely the following.

  • A π-system P is a collection of subsets of X that is closed under finitely many intersections, and
  • A Dynkin system (or λ-system) D is a collection of subsets of X that contains X and is closed under complement and under countable unions of disjoint subsets.

Dynkin's π-λ theorem says, if P is a π-system and D is a Dynkin system that contains P, then the σ-algebra σ(P) generated by P is contained in D. Since certain π-systems are relatively simple classes, it may not be hard to verify that all sets in P enjoy the property under consideration while, on the other hand, showing that the collection D of all subsets with the property is a Dynkin system can also be straightforward. Dynkin's π-λ Theorem then implies that all sets in σ(P) enjoy the property, avoiding the task of checking it for an arbitrary set in σ(P).

One of the most fundamental uses of the π-λ theorem is to show equivalence of separately defined measures or integrals. For example, it is used to equate a probability for a random variable X with the Lebesgue-Stieltjes integral typically associated with computing the probability: (XA)=AF(dx) for all A in the Borel σ-algebra on , where F(x) is the cumulative distribution function for X, defined on , while is a probability measure, defined on a σ-algebra Σ of subsets of some sample space Ω.

Combining σ-algebras

Suppose {Σα:α𝒜} is a collection of σ-algebras on a space X.

Meet

The intersection of a collection of σ-algebras is a σ-algebra. To emphasize its character as a σ-algebra, it often is denoted by: α𝒜Σα.

Sketch of Proof: Let Σ* denote the intersection. Since X is in every Σα,Σ* is not empty. Closure under complement and countable unions for every Σα implies the same must be true for Σ*. Therefore, Σ* is a σ-algebra.

Join

The union of a collection of σ-algebras is not generally a σ-algebra, or even an algebra, but it generates a σ-algebra known as the join which typically is denoted α𝒜Σα=σ(α𝒜Σα). A π-system that generates the join is 𝒫={i=1nAi:AiΣαi,αi𝒜, n1}. Sketch of Proof: By the case n=1, it is seen that each Σα𝒫, so α𝒜Σα𝒫. This implies σ(α𝒜Σα)σ(𝒫) by the definition of a σ-algebra generated by a collection of subsets. On the other hand, 𝒫σ(α𝒜Σα) which, by Dynkin's π-λ theorem, implies σ(𝒫)σ(α𝒜Σα).

σ-algebras for subspaces

Suppose Y is a subset of X and let (X,Σ) be a measurable space.

  • The collection {YB:BΣ} is a σ-algebra of subsets of Y.
  • Suppose (Y,Λ) is a measurable space. The collection {AX:AYΛ} is a σ-algebra of subsets of X.

Relation to σ-ring

A σ-algebra Σ is just a σ-ring that contains the universal set X.[3] A σ-ring need not be a σ-algebra, as for example measurable subsets of zero Lebesgue measure in the real line are a σ-ring, but not a σ-algebra since the real line has infinite measure and thus cannot be obtained by their countable union. If, instead of zero measure, one takes measurable subsets of finite Lebesgue measure, those are a ring but not a σ-ring, since the real line can be obtained by their countable union yet its measure is not finite.

Typographic note

σ-algebras are sometimes denoted using calligraphic capital letters, or the Fraktur typeface. Thus (X,Σ) may be denoted as (X,) or (X,𝔉).

Particular cases and examples

Separable σ-algebras

A separable σ-algebra (or separable σ-field) is a σ-algebra that is a separable space when considered as a metric space with metric ρ(A,B)=μ(AB) for A,B and a given finite measure μ (and with being the symmetric difference operator).[4] Any σ-algebra generated by a countable collection of sets is separable, but the converse need not hold. For example, the Lebesgue σ-algebra is separable (since every Lebesgue measurable set is equivalent to some Borel set) but not countably generated (since its cardinality is higher than continuum).

A separable measure space has a natural pseudometric that renders it separable as a pseudometric space. The distance between two sets is defined as the measure of the symmetric difference of the two sets. The symmetric difference of two distinct sets can have measure zero; hence the pseudometric as defined above need not be a true metric. However, if sets whose symmetric difference has measure zero are identified into a single equivalence class, the resulting quotient set can be properly metrized by the induced metric. If the measure space is separable, it can be shown that the corresponding metric space is, too.

Simple set-based examples

Let X be any set.

  • The family consisting only of the empty set and the set X, called the minimal or trivial σ-algebra over X.
  • The power set of X, called the discrete σ-algebra.
  • The collection {,A,XA,X} is a simple σ-algebra generated by the subset A.
  • The collection of subsets of X which are countable or whose complements are countable is a σ-algebra (which is distinct from the power set of X if and only if X is uncountable). This is the σ-algebra generated by the singletons of X. Note: "countable" includes finite or empty.
  • The collection of all unions of sets in a countable partition of X is a σ-algebra.

Stopping time sigma-algebras

A stopping time τ can define a σ-algebra τ, the so-called stopping time sigma-algebra, which in a filtered probability space describes the information up to the random time τ in the sense that, if the filtered probability space is interpreted as a random experiment, the maximum information that can be found out about the experiment from arbitrarily often repeating it until the time τ is τ.[5]

σ-algebras generated by families of sets

σ-algebra generated by an arbitrary family

Let F be an arbitrary family of subsets of X. Then there exists a unique smallest σ-algebra which contains every set in F (even though F may or may not itself be a σ-algebra). It is, in fact, the intersection of all σ-algebras containing F. (See intersections of σ-algebras above.) This σ-algebra is denoted σ(F) and is called the σ-algebra generated by F.

If F is empty, then σ()={,X}. Otherwise σ(F) consists of all the subsets of X that can be made from elements of F by a countable number of complement, union and intersection operations.

For a simple example, consider the set X={1,2,3}. Then the σ-algebra generated by the single subset {1} is σ({1})={,{1},{2,3},{1,2,3}}. By an abuse of notation, when a collection of subsets contains only one element, A, σ(A) may be written instead of σ({A}); in the prior example σ({1}) instead of σ({{1}}). Indeed, using σ(A1,A2,) to mean σ({A1,A2,}) is also quite common.

There are many families of subsets that generate useful σ-algebras. Some of these are presented here.

σ-algebra generated by a function

If f is a function from a set X to a set Y and B is a σ-algebra of subsets of Y, then the σ-algebra generated by the function f, denoted by σ(f), is the collection of all inverse images f1(S) of the sets S in B. That is, σ(f)={f1(S):SB}.

A function f from a set X to a set Y is measurable with respect to a σ-algebra Σ of subsets of X if and only if σ(f) is a subset of Σ.

One common situation, and understood by default if B is not specified explicitly, is when Y is a metric or topological space and B is the collection of Borel sets on Y.

If f is a function from X to n then σ(f) is generated by the family of subsets which are inverse images of intervals/rectangles in n: σ(f)=σ({f1([a1,b1]××[an,bn]):ai,bi}).

A useful property is the following. Assume f is a measurable map from (X,ΣX) to (S,ΣS) and g is a measurable map from (X,ΣX) to (T,ΣT). If there exists a measurable map h from (T,ΣT) to (S,ΣS) such that f(x)=h(g(x)) for all x, then σ(f)σ(g). If S is finite or countably infinite or, more generally, (S,ΣS) is a standard Borel space (for example, a separable complete metric space with its associated Borel sets), then the converse is also true.[6] Examples of standard Borel spaces include n with its Borel sets and with the cylinder σ-algebra described below.

Borel and Lebesgue σ-algebras

An important example is the Borel algebra over any topological space: the σ-algebra generated by the open sets (or, equivalently, by the closed sets). This σ-algebra is not, in general, the whole power set. For a non-trivial example that is not a Borel set, see the Vitali set or Non-Borel sets.

On the Euclidean space n, another σ-algebra is of importance: that of all Lebesgue measurable sets. This σ-algebra contains more sets than the Borel σ-algebra on n and is preferred in integration theory, as it gives a complete measure space.

Product σ-algebra

Let (X1,Σ1) and (X2,Σ2) be two measurable spaces. The σ-algebra for the corresponding product space X1×X2 is called the product σ-algebra and is defined by Σ1×Σ2=σ({B1×B2:B1Σ1,B2Σ2}).

Observe that {B1×B2:B1Σ1,B2Σ2} is a π-system.

The Borel σ-algebra for n is generated by half-infinite rectangles and by finite rectangles. For example, (n)=σ({(,b1]××(,bn]:bi})=σ({(a1,b1]××(an,bn]:ai,bi}).

For each of these two examples, the generating family is a π-system.

σ-algebra generated by cylinder sets

Suppose X𝕋={f:f(t), t𝕋}

is a set of real-valued functions. Let () denote the Borel subsets of . A cylinder subset of X is a finitely restricted set defined as Ct1,,tn(B1,,Bn)={fX:f(ti)Bi,1in}.

Each {Ct1,,tn(B1,,Bn):Bi(),1in} is a π-system that generates a σ-algebra Σt1,,tn. Then the family of subsets X=n=1ti𝕋,inΣt1,,tn is an algebra that generates the cylinder σ-algebra for X. This σ-algebra is a subalgebra of the Borel σ-algebra determined by the product topology of 𝕋 restricted to X.

An important special case is when 𝕋 is the set of natural numbers and X is a set of real-valued sequences. In this case, it suffices to consider the cylinder sets Cn(B1,,Bn)=(B1××Bn×)X={(x1,x2,,xn,xn+1,)X:xiBi,1in}, for which Σn=σ({Cn(B1,,Bn):Bi(),1in}) is a non-decreasing sequence of σ-algebras.

Ball σ-algebra

The ball σ-algebra is the smallest σ-algebra containing all the open (and/or closed) balls. This is never larger than the Borel σ-algebra. Note that the two σ-algebra are equal for separable spaces. For some nonseparable spaces, some maps are ball measurable even though they are not Borel measurable, making use of the ball σ-algebra useful in the analysis of such maps.[7]

σ-algebra generated by random variable or vector

Suppose (Ω,Σ,) is a probability space. If Y:Ωn is measurable with respect to the Borel σ-algebra on n then Y is called a random variable (n=1) or random vector (n>1). The σ-algebra generated by Y is σ(Y)={Y1(A):A(n)}.

σ-algebra generated by a stochastic process

Suppose (Ω,Σ,) is a probability space and 𝕋 is the set of real-valued functions on 𝕋. If Y:ΩX𝕋 is measurable with respect to the cylinder σ-algebra σ(X) (see above) for X then Y is called a stochastic process or random process. The σ-algebra generated by Y is σ(Y)={Y1(A):Aσ(X)}=σ({Y1(A):AX}), the σ-algebra generated by the inverse images of cylinder sets.

See also

Template:Families of sets

References

  1. Elstrodt, J. (2018). Maß- Und Integrationstheorie. Springer Spektrum Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-57939-8
  2. Rudin, Walter (1987). Real & Complex Analysis. McGraw-Hill. ISBN 0-07-054234-1. 
  3. Vestrup, Eric M. (2009). The Theory of Measures and Integration. John Wiley & Sons. p. 12. ISBN 978-0-470-31795-2. 
  4. Džamonja, Mirna; Kunen, Kenneth (1995). "Properties of the class of measure separable compact spaces". Fundamenta Mathematicae: 262. https://archive.uea.ac.uk/~h020/fundamenta.pdf. "If μ is a Borel measure on X, the measure algebra of (X,μ) is the Boolean algebra of all Borel sets modulo μ-null sets. If μ is finite, then such a measure algebra is also a metric space, with the distance between the two sets being the measure of their symmetric difference. Then, we say that μ is separable if and only if this metric space is separable as a topological space.". 
  5. Fischer, Tom (2013). "On simple representations of stopping times and stopping time sigma-algebras". Statistics and Probability Letters 83 (1): 345–349. doi:10.1016/j.spl.2012.09.024. https://dx.doi.org/10.1016/j.spl.2012.09.024. 
  6. Kallenberg, Olav (2001). Foundations of Modern Probability (2nd ed.). Springer. p. 7. ISBN 0-387-95313-2. 
  7. van der Vaart, A. W., & Wellner, J. A. (1996). Weak Convergence and Empirical Processes. In Springer Series in Statistics. Springer New York. https://doi.org/10.1007/978-1-4757-2545-2
Short description: Function type in category theory


The commutative diagram, which defines[clarification needed] a property required by morphisms of the original category, so that they can be morphisms of the newly defined category of F-algebras.

In mathematics, specifically in category theory, F-algebras generalize the notion of algebraic structure. Rewriting the algebraic laws in terms of morphisms eliminates all references to quantified elements from the axioms, and these algebraic laws may then be glued together in terms of a single functor F, the signature.

F-algebras can also be used to represent data structures used in programming, such as lists and trees.

The main related concepts are initial F-algebras which may serve to encapsulate the induction principle, and the dual construction F-coalgebras.

Definition

If C is a category, and F:CC is an endofunctor of C, then an F-algebra is a tuple (A,α), where A is an object of C and α is a C-morphism F(A)A. The object A is called the carrier of the algebra. When it is permissible from context, algebras are often referred to by their carrier only instead of the tuple.

A homomorphism from an F-algebra (A,α) to an F-algebra (B,β) is a C-morphism f:AB such that fα=βF(f), according to the following commutative diagram:

Template:Dark mode invert

Equipped with these morphisms, F-algebras constitute a category.

The dual construction are F-coalgebras, which are objects A* together with a morphism α*:A*F(A*).

Examples

Groups

Classically, a group is a set G with a group law m:G×GG, with m(x,y)=xy, satisfying three axioms: the existence of an identity element, the existence of an inverse for each element of the group, and associativity.

To put this in a categorical framework, first define the identity and inverse as functions (morphisms of the set G) by e:1G with e(*)=1, and i:GG with i(x)=x1. Here 1 denotes the set with one element 1={*}, which allows one to identify elements xG with morphisms 1G.

It is then possible to write the axioms of a group in terms of functions (note how the existential quantifier is absent):

  • xG,yG,zG,m(m(x,y),z)=m(x,m(y,z)),
  • xG,m(e(*),x)=m(x,e(*))=x,
  • xG,m(i(x),x)=m(x,i(x))=e(*).

Then this can be expressed with commutative diagrams:[1][2]

Template:Dark mode invert              Template:Dark mode invert              Template:Dark mode invert             

Now use the coproduct (the disjoint union of sets) to glue the three morphisms in one: α=e+i+m according to

α:1+G+G×GG,*1,xx1,(x,y)xy.

Thus a group is an F-algebra where F is the functor F(G)=1+G+G×G. However the reverse is not necessarily true. Some F-algebra where F is the functor F(G)=1+G+G×G are not groups.

The above construction is used to define group objects over an arbitrary category with finite products and a terminal object 1. When the category admits finite coproducts, the group objects are F-algebras. For example, finite groups are F-algebras in the category of finite sets and Lie groups are F-algebras in the category of smooth manifolds with smooth maps.

Algebraic structures

Going one step ahead of universal algebra, most algebraic structures are F-algebras. For example, abelian groups are F-algebras for the same functor F(G) = 1 + G + G×G as for groups, with an additional axiom for commutativity: mt=m mt = m, where t(x,y) = (y,x) is the transpose on GxG.

Monoids are F-algebras of signature F(M) = 1 + M×M. In the same vein, semigroups are F-algebras of signature F(S) = S×S

Rings, domains and fields are also F-algebras with a signature involving two laws +,•: R×R → R, an additive identity 0: 1 → R, a multiplicative identity 1: 1 → R, and an additive inverse for each element -: RR. As all these functions share the same codomain R they can be glued into a single signature function 1 + 1 + R + R×R + R×RR, with axioms to express associativity, distributivity, and so on. This makes rings F-algebras on the category of sets with signature 1 + 1 + R + R×R + R×R.

Alternatively, we can look at the functor F(R) = 1 + R×R in the category of abelian groups. In that context, the multiplication is a homomorphism, meaning m(x + y, z) = m(x,z) + m(y,z) and m(x,y + z) = m(x,y) + m(x,z), which are precisely the distributivity conditions. Therefore, a ring is an F-algebra of signature 1 + R×R over the category of abelian groups which satisfies two axioms (associativity and identity for the multiplication).

When we come to vector spaces and modules, the signature functor includes a scalar multiplication k×EE, and the signature F(E) = 1 + E + k×E is parametrized by k over the category of fields, or rings.

Algebras over a field can be viewed as F-algebras of signature 1 + 1 + A + A×A + A×A + k×A over the category of sets, of signature 1 + A×A over the category of modules (a module with an internal multiplication), and of signature k×A over the category of rings (a ring with a scalar multiplication), when they are associative and unitary.

Lattice

Not all mathematical structures are F-algebras. For example, a poset P may be defined in categorical terms with a morphism s:P × P → Ω, on a subobject classifier (Ω = {0,1} in the category of sets and s(x,y)=1 precisely when xy). The axioms restricting the morphism s to define a poset can be rewritten in terms of morphisms. However, as the codomain of s is Ω and not P, it is not an F-algebra.

However, lattices, which are partial orders in which every two elements have a supremum and an infimum, and in particular total orders, are F-algebras. This is because they can equivalently be defined in terms of the algebraic operations: xy = inf(x,y) and xy = sup(x,y), subject to certain axioms (commutativity, associativity, absorption and idempotency). Thus they are F-algebras of signature P x P + P x P. It is often said that lattice theory draws on both order theory and universal algebra.

Recurrence

Consider the functor F:𝐒𝐞𝐭𝐒𝐞𝐭 that sends a set X to 1+X. Here, 𝐒𝐞𝐭 denotes the category of sets, + denotes the usual coproduct given by the disjoint union, and 1 is a terminal object (i.e. any singleton set). Then, the set of natural numbers together with the function [zero,succ]:1+—which is the coproduct of the functions zero:10 and succ:nn+1—is an F-algebra.

Initial F-algebra

If the category of F-algebras for a given endofunctor F has an initial object, it is called an initial algebra. The algebra (,[zero,succ]) in the above example is an initial algebra. Various finite data structures used in programming, such as lists and trees, can be obtained as initial algebras of specific endofunctors.

Types defined by using least fixed point construct with functor F can be regarded as an initial F-algebra, provided that parametricity holds for the type.[3]

See also Universal algebra.

Terminal F-coalgebra

In a dual way, a similar relationship exists between notions of greatest fixed point and terminal F-coalgebra. These can be used for allowing potentially infinite objects while maintaining strong normalization property.[3] In the strongly normalizing Charity programming language (i.e. each program terminates in it), coinductive data types can be used to achieve surprising results, enabling the definition of lookup constructs to implement such “strong” functions like the Ackermann function.[4]

See also

Notes

  1. The vertical arrows without labels in the second diagram must be unique since * is terminal.
  2. Strictly speaking, (i,id) and (id,i) are labelled inconsistently with the other diagrams as these morphisms "diagonalise" first.
  3. 3.0 3.1 Philip Wadler: Recursive types for free! University of Glasgow, June 1990. Draft.
  4. Robin Cockett: Charitable Thoughts (ps and ps.gz)

References

  • Pierce, Benjamin C. (1991). "F-Algebras". Basic Category Theory for Computer Scientists. MIT Press. ISBN 0-262-66071-7. 
  • Barr, Michael; Wells, Charles (1990). Category theory for computing science. New York: Prentice Hall. p. 355. ISBN 0131204866. OCLC 19126000. 

In the mathematical field of functional analysis, a nuclear C*-algebra is a C*-algebra A such that for every C*-algebra B the injective and projective C*-cross norms coincides on the algebraic tensor product AB and the completion of AB with respect to this norm is a C*-algebra. This property was first studied by (Takesaki 1964) under the name "Property T", which is not related to Kazhdan's property T.

Characterizations

Nuclearity admits the following equivalent characterizations:

Examples

The commutative unital C* algebra of (real or complex-valued) continuous functions on a compact Hausdorff space as well as the noncommutative unital algebra of n×n real or complex matrices are nuclear.[1]

See also

References

  • Connes, Alain (1976), "Classification of injective factors.", Annals of Mathematics, Second Series 104 (1): 73–115, doi:10.2307/1971057, ISSN 0003-486X 
  • Effros, Edward G.; Ruan, Zhong-Jin (2000), Operator spaces, London Mathematical Society Monographs. New Series, 23, The Clarendon Press Oxford University Press, ISBN 978-0-19-853482-2, http://www.oup.com/us/catalog/general/subject/Mathematics/PureMathematics/?ci=9780198534822 
  • Lance, E. Christopher (1982), "Tensor products and nuclear C*-algebras", Operator algebras and applications, Part I (Kingston, Ont., 1980), Proc. Sympos. Pure Math., 38, Providence, R.I.: Amer. Math. Soc., pp. 379–399 
  • Pisier, Gilles (2003), Introduction to operator space theory, London Mathematical Society Lecture Note Series, 294, Cambridge University Press, ISBN 978-0-521-81165-1 
  • Rørdam, M. (2002), "Classification of nuclear simple C*-algebras", Classification of nuclear C*-algebras. Entropy in operator algebras, Encyclopaedia Math. Sci., 126, Berlin, New York: Springer-Verlag, pp. 1–145 
  • Takesaki, Masamichi (1964), "On the cross-norm of the direct product of C*-algebras", The Tohoku Mathematical Journal, Second Series 16: 111–122, doi:10.2748/tmj/1178243737, ISSN 0040-8735 
  • Takesaki, Masamichi (2003), "Nuclear C*-algebras", Theory of operator algebras. III, Encyclopaedia of Mathematical Sciences, 127, Berlin, New York: Springer-Verlag, pp. 153–204, ISBN 978-3-540-42913-5 

Template:Topological tensor products and nuclear spaces

Template:Spectral theory

Warning: Default sort key "Nuclear C-algebra" overrides earlier default sort key "-algebra".

it:C*-algebra#C*-algebra nucleare

  1. REDIRECT Predictable process
Short description: Mathematical concept

In mathematics, the spectrum of a C*-algebra or dual of a C*-algebra A, denoted Â, is the set of unitary equivalence classes of irreducible *-representations of A. A *-representation π of A on a Hilbert space H is irreducible if, and only if, there is no closed subspace K different from H and {0} which is invariant under all operators π(x) with xA. We implicitly assume that irreducible representation means non-null irreducible representation, thus excluding trivial (i.e. identically 0) representations on one-dimensional spaces. As explained below, the spectrum  is also naturally a topological space; this is similar to the notion of the spectrum of a ring.

One of the most important applications of this concept is to provide a notion of dual object for any locally compact group. This dual object is suitable for formulating a Fourier transform and a Plancherel theorem for unimodular separable locally compact groups of type I and a decomposition theorem for arbitrary representations of separable locally compact groups of type I. The resulting duality theory for locally compact groups is however much weaker than the Tannaka–Krein duality theory for compact topological groups or Pontryagin duality for locally compact abelian groups, both of which are complete invariants. That the dual is not a complete invariant is easily seen as the dual of any finite-dimensional full matrix algebra Mn(C) consists of a single point.

Primitive spectrum

The topology of  can be defined in several equivalent ways. We first define it in terms of the primitive spectrum .

The primitive spectrum of A is the set of primitive ideals Prim(A) of A, where a primitive ideal is the kernel of a non-zero irreducible *-representation. The set of primitive ideals is a topological space with the hull-kernel topology (or Jacobson topology). This is defined as follows: If X is a set of primitive ideals, its hull-kernel closure is

X={ρPrim(A):ρπXπ}.

Hull-kernel closure is easily shown to be an idempotent operation, that is

X=X,

and it can be shown to satisfy the Kuratowski closure axioms. As a consequence, it can be shown that there is a unique topology τ on Prim(A) such that the closure of a set X with respect to τ is identical to the hull-kernel closure of X.

Since unitarily equivalent representations have the same kernel, the map π ↦ ker(π) factors through a surjective map

k:A^Prim(A).

We use the map k to define the topology on  as follows:

Definition. The open sets of  are inverse images k−1(U) of open subsets U of Prim(A). This is indeed a topology.

The hull-kernel topology is an analogue for non-commutative rings of the Zariski topology for commutative rings.

The topology on  induced from the hull-kernel topology has other characterizations in terms of states of A.

Examples

Commutative C*-algebras

3-dimensional commutative C*-algebra and its ideals. Each of 8 ideals corresponds to a closed subset of discrete 3-points space (or to an open complement). Primitive ideals correspond to closed singletons. See details at the image description page.

The spectrum of a commutative C*-algebra A coincides with the Gelfand dual of A (not to be confused with the dual A' of the Banach space A). In particular, suppose X is a compact Hausdorff space. Then there is a natural homeomorphism

I:XPrim(C(X)).

This mapping is defined by

I(x)={fC(X):f(x)=0}.

I(x) is a closed maximal ideal in C(X) so is in fact primitive. For details of the proof, see the Dixmier reference. For a commutative C*-algebra,

A^Prim(A).

The C*-algebra of bounded operators

Let H be a separable infinite-dimensional Hilbert space. L(H) has two norm-closed *-ideals: I0 = {0} and the ideal K = K(H) of compact operators. Thus as a set, Prim(L(H)) = {I0K}. Now

  • {K} is a closed subset of Prim(L(H)).
  • The closure of {I0} is Prim(L(H)).

Thus Prim(L(H)) is a non-Hausdorff space.

The spectrum of L(H) on the other hand is much larger. There are many inequivalent irreducible representations with kernel K(H) or with kernel {0}.

Finite-dimensional C*-algebras

Suppose A is a finite-dimensional C*-algebra. It is known A is isomorphic to a finite direct sum of full matrix algebras:

Aemin(A)Ae,

where min(A) are the minimal central projections of A. The spectrum of A is canonically isomorphic to min(A) with the discrete topology. For finite-dimensional C*-algebras, we also have the isomorphism

A^Prim(A).

Other characterizations of the spectrum

The hull-kernel topology is easy to describe abstractly, but in practice for C*-algebras associated to locally compact topological groups, other characterizations of the topology on the spectrum in terms of positive definite functions are desirable.

In fact, the topology on  is intimately connected with the concept of weak containment of representations as is shown by the following:

Theorem. Let S be a subset of Â. Then the following are equivalent for an irreducible representation π;
  1. The equivalence class of π in  is in the closure of S
  2. Every state associated to π, that is one of the form
fξ(x)=ξπ(x)ξ
with ||ξ|| = 1, is the weak limit of states associated to representations in S.

The second condition means exactly that π is weakly contained in S.

The GNS construction is a recipe for associating states of a C*-algebra A to representations of A. By one of the basic theorems associated to the GNS construction, a state f is pure if and only if the associated representation πf is irreducible. Moreover, the mapping κ : PureState(A) → Â defined by f ↦ πf is a surjective map.

From the previous theorem one can easily prove the following;

Theorem The mapping
κ:PureState(A)A^
given by the GNS construction is continuous and open.

The space Irrn(A)

There is yet another characterization of the topology on  which arises by considering the space of representations as a topological space with an appropriate pointwise convergence topology. More precisely, let n be a cardinal number and let Hn be the canonical Hilbert space of dimension n.

Irrn(A) is the space of irreducible *-representations of A on Hn with the point-weak topology. In terms of convergence of nets, this topology is defined by πi → π; if and only if

πi(x)ξηπ(x)ξηξ,ηHn xA.

It turns out that this topology on Irrn(A) is the same as the point-strong topology, i.e. πi → π if and only if

πi(x)ξπ(x)ξ normwise ξHn xA.
Theorem. Let Ân be the subset of  consisting of equivalence classes of representations whose underlying Hilbert space has dimension n. The canonical map Irrn(A) → Ân is continuous and open. In particular, Ân can be regarded as the quotient topological space of Irrn(A) under unitary equivalence.

Remark. The piecing together of the various Ân can be quite complicated.

Mackey–Borel structure

 is a topological space and thus can also be regarded as a Borel space. A famous conjecture of G. Mackey proposed that a separable locally compact group is of type I if and only if the Borel space is standard, i.e. is isomorphic (in the category of Borel spaces) to the underlying Borel space of a complete separable metric space. Mackey called Borel spaces with this property smooth. This conjecture was proved by James Glimm for separable C*-algebras in the 1961 paper listed in the references below.

Definition. A non-degenerate *-representation π of a separable C*-algebra A is a factor representation if and only if the center of the von Neumann algebra generated by π(A) is one-dimensional. A C*-algebra A is of type I if and only if any separable factor representation of A is a finite or countable multiple of an irreducible one.

Examples of separable locally compact groups G such that C*(G) is of type I are connected (real) nilpotent Lie groups and connected real semi-simple Lie groups. Thus the Heisenberg groups are all of type I. Compact and abelian groups are also of type I.

Theorem. If A is separable, Â is smooth if and only if A is of type I.

The result implies a far-reaching generalization of the structure of representations of separable type I C*-algebras and correspondingly of separable locally compact groups of type I.

Algebraic primitive spectra

Since a C*-algebra A is a ring, we can also consider the set of primitive ideals of A, where A is regarded algebraically. For a ring an ideal is primitive if and only if it is the annihilator of a simple module. It turns out that for a C*-algebra A, an ideal is algebraically primitive if and only if it is primitive in the sense defined above.

Theorem. Let A be a C*-algebra. Any algebraically irreducible representation of A on a complex vector space is algebraically equivalent to a topologically irreducible *-representation on a Hilbert space. Topologically irreducible *-representations on a Hilbert space are algebraically isomorphic if and only if they are unitarily equivalent.

This is the Corollary of Theorem 2.9.5 of the Dixmier reference.

If G is a locally compact group, the topology on dual space of the group C*-algebra C*(G) of G is called the Fell topology, named after J. M. G. Fell.

References

  • J. Dixmier, C*-Algebras, North-Holland, 1977 (a translation of Les C*-algèbres et leurs représentations)
  • J. Dixmier, Les C*-algèbres et leurs représentations, Gauthier-Villars, 1969.
  • J. Glimm, Type I C*-algebras, Annals of Mathematics, vol 73, 1961.
  • G. Mackey, The Theory of Group Representations, The University of Chicago Press, 1955.

Warning: Default sort key "Spectrum of a C-algebra" overrides earlier default sort key "Nuclear C-algebra". In mathematics — specifically, in measure theory and functional analysis — the cylindrical σ-algebra[1] or product σ-algebra[2][3] is a type of σ-algebra which is often used when studying product measures or probability measures of random variables on Banach spaces.

For a product space, the cylinder σ-algebra is the one that is generated by cylinder sets.

In the context of a Banach space X and its dual space of continuous linear functionals X, the cylindrical σ-algebra 𝔄(X,X) is defined to be the coarsest σ-algebra (that is, the one with the fewest measurable sets) such that every continuous linear function on X is a measurable function. In general, 𝔄(X,X) is not the same as the Borel σ-algebra on X, which is the coarsest σ-algebra that contains all open subsets of X.

Definition

Consider two topological vector spaces N and M with dual pairing ,:=,N,M, then we can define the so called Borel cylinder sets

Cf1,,fm,B={xN:(x,f1,,x,fm)B}

for some f1,,fmM and B(m). The family of all these sets is denoted as 𝔄f1,,fn. Then

Cyl(N,M)=n𝔄f1,,fn

is called the cylindrical algebra. Equivalently one can also look at the open cylinder sets and get the same algebra.

The cylindrical σ-algebra 𝔄(N,M)=σ(Cyl(N,M)) is the σ-algebra generated by the cylindrical algebra.[4]

Properties

  • Let X a Hausdorff locally convex space which is also a hereditarily Lindelöf space, then
𝔄(X,X)=(X).[5]

See also

References

  1. Gine, Evarist; Nickl, Richard (2016). Mathematical Foundations of Infinite-Dimensional Statistical Models. Cambridge University Press. p. 16. 
  2. Athreya, Krishna; Lahiri, Soumendra (2006). Measure Theory and Probability Theory. Springer. pp. 202–203. 
  3. Cohn, Donald (2013). Measure Theory (Second ed.). Birkhauser. p. 365. 
  4. Richard M. Dudley, Jacob Feldman und Lucien Le Cam (1971), Princeton University, ed., "On Seminorms and Probabilities, and Abstract Wiener Spaces", Annals of Mathematics 93 (2): 390-392 
  5. Mitoma, Itaru; Okada, Susumu; Okazaki, Yoshiaki (1977). "Cylindrical σ-algebra and cylindrical measure". Osaka Journal of Mathematics (Osaka University and Osaka Metropolitan University, Departments of Mathematics) 14 (3): 640. 
  • Ledoux, Michel (1991). Probability in Banach spaces. Berlin: Springer-Verlag. pp. xii+480. ISBN 3-540-52013-9.  (See chapter 2)

Template:Measure theory Template:Banach spaces

Warning: Default sort key "Cylindrical sigma-algebra" overrides earlier default sort key "Spectrum of a C-algebra".

In mathematics, an ultragraph C*-algebra is a universal C*-algebra generated by partial isometries on a collection of Hilbert spaces constructed from ultragraphs.[1]pp. 6-7. These C*-algebras were created in order to simultaneously generalize the classes of graph C*-algebras and Exel–Laca algebras, giving a unified framework for studying these objects.[1] This is because every graph can be encoded as an ultragraph, and similarly, every infinite graph giving an Exel-Laca algebras can also be encoded as an ultragraph.

Definitions

Ultragraphs

An ultragraph 𝒢=(G0,𝒢1,r,s) consists of a set of vertices G0, a set of edges 𝒢1, a source map s:𝒢1G0, and a range map r:𝒢1P(G0){} taking values in the power set collection P(G0){} of nonempty subsets of the vertex set. A directed graph is the special case of an ultragraph in which the range of each edge is a singleton, and ultragraphs may be thought of as generalized directed graph in which each edges starts at a single vertex and points to a nonempty subset of vertices.

Example

Ultragraph visualization
Ultragraph ({v,w,x},{e,f,g},s,r)

An easy way to visualize an ultragraph is to consider a directed graph with a set of labelled vertices, where each label corresponds to a subset in the image of an element of the range map. For example, given an ultragraph with vertices and edge labels

G0={v,w,x}

,

𝒢1={e,f,g}

with source an range maps

s(e)=vs(f)=ws(g)=xr(e)={v,w,x}r(f)={x}r(g)={v,w}

can be visualized as the image on the right.

Ultragraph algebras

Given an ultragraph 𝒢=(G0,𝒢1,r,s), we define 𝒢0 to be the smallest subset of P(G0) containing the singleton sets {{v}:vG0}, containing the range sets {r(e):e𝒢1}, and closed under intersections, unions, and relative complements. A Cuntz–Krieger 𝒢-family is a collection of projections {pA:A𝒢0} together with a collection of partial isometries {se:e𝒢1} with mutually orthogonal ranges satisfying

  1. p, pApB=pAB, pA+pBpAB=pAB for all A𝒢0,
  2. se*se=pr(e) for all e𝒢1,
  3. pv=s(e)=vsese* whenever vG0 is a vertex that emits a finite number of edges, and
  4. sese*ps(e) for all e𝒢1.

The ultragraph C*-algebra C*(𝒢) is the universal C*-algebra generated by a Cuntz–Krieger 𝒢-family.

Properties

Every graph C*-algebra is seen to be an ultragraph algebra by simply considering the graph as a special case of an ultragraph, and realizing that 𝒢0 is the collection of all finite subsets of G0 and pA=vApv for each A𝒢0. Every Exel–Laca algebras is also an ultragraph C*-algebra: If A is an infinite square matrix with index set I and entries in {0,1}, one can define an ultragraph by G0:=, G1:=I, s(i)=i, and r(i)={jI:A(i,j)=1}. It can be shown that C*(𝒢) is isomorphic to the Exel–Laca algebra 𝒪A.[1]

Ultragraph C*-algebras are useful tools for studying both graph C*-algebras and Exel–Laca algebras. Among other benefits, modeling an Exel–Laca algebra as ultragraph C*-algebra allows one to use the ultragraph as a tool to study the associated C*-algebras, thereby providing the option to use graph-theoretic techniques, rather than matrix techniques, when studying the Exel–Laca algebra. Ultragraph C*-algebras have been used to show that every simple AF-algebra is isomorphic to either a graph C*-algebra or an Exel–Laca algebra.[2] They have also been used to prove that every AF-algebra with no (nonzero) finite-dimensional quotient is isomorphic to an Exel–Laca algebra.[2]

While the classes of graph C*-algebras, Exel–Laca algebras, and ultragraph C*-algebras each contain C*-algebras not isomorphic to any C*-algebra in the other two classes, the three classes have been shown to coincide up to Morita equivalence.[3]

See also

Notes

  1. 1.0 1.1 1.2 A unified approach to Exel–Laca algebras and C*-algebras associated to graphs, Mark Tomforde, J. Operator Theory 50 (2003), no. 2, 345–368.
  2. 2.0 2.1 Realization of AF-algebras as graph algebras, Exel–Laca algebras, and ultragraph algebras, Takeshi Katsura, Aidan Sims, and Mark Tomforde, J. Funct. Anal. 257 (2009), no. 5, 1589–1620.
  3. Graph algebras, Exel–Laca algebras, and ultragraph algebras coincide up to Morita equivalence, Takeshi Katsura, Paul Muhly, Aidan Sims, and Mark Tomforde, J. Reine Angew. Math. 640 (2010), 135–165.
Short description: Generalization of a Lie algebra

In mathematics, a Lie n-algebra is a generalization of a Lie algebra, a vector space with a bracket, to higher order operations. For example, in the case of a Lie 2-algebra, the Jacobi identity is replaced by an isomorphism called a Jacobiator.[1]

See also

References

  1. Baez & Crans 2004, 1. Introduction

Further reading

In mathematics, an AW*-algebra is an algebraic generalization of a W*-algebra. They were introduced by Irving Kaplansky in 1951.[1] As operator algebras, von Neumann algebras, among all C*-algebras, are typically handled using one of two means: they are the dual space of some Banach space, and they are determined to a large extent by their projections. The idea behind AW*-algebras is to forget the former, topological, condition, and use only the latter, algebraic, condition.

Definition

Recall that a projection of a C*-algebra is a self-adjoint idempotent element. A C*-algebra A is an AW*-algebra if for every subset S of A, the left annihilator

AnnL(S)={aAsS,as=0}

is generated as a left ideal by some projection p of A, and similarly the right annihilator is generated as a right ideal by some projection q:

SAp,qProj(A):AnnL(S)=Ap,AnnR(S)=qA.

Hence an AW*-algebra is a C*-algebra that is at the same time a Baer *-ring.

The original definition of Kaplansky states that an AW*-algebra is a C*-algebra such that (1) any set of orthogonal projections has a least upper bound, and (2) each maximal commutative C*-subalgebra is generated by its projections. The first condition states that the projections have an interesting structure, while the second condition ensures that there are enough projections for it to be interesting.[1] Note that the second condition is equivalent to the condition that each maximal commutative C*-subalgebra is monotone complete.

Structure theory

Many results concerning von Neumann algebras carry over to AW*-algebras. For example, AW*-algebras can be classified according to the behavior of their projections, and decompose into types.[2] For another example, normal matrices with entries in an AW*-algebra can always be diagonalized.[3] AW*-algebras also always have polar decomposition.[4]

However, there are also ways in which AW*-algebras behave differently from von Neumann algebras.[5] For example, AW*-algebras of type I can exhibit pathological properties,[6] even though Kaplansky already showed that such algebras with trivial center are automatically von Neumann algebras.

The commutative case

A commutative C*-algebra is an AW*-algebra if and only if its spectrum is a Stonean space. Via Stone duality, commutative AW*-algebras therefore correspond to complete Boolean algebras. The projections of a commutative AW*-algebra form a complete Boolean algebra, and conversely, any complete Boolean algebra is isomorphic to the projections of some commutative AW*-algebra.

References

  1. 1.0 1.1 Kaplansky, Irving (1951). "Projections in Banach algebras". Annals of Mathematics 53 (2): 235–249. doi:10.2307/1969540. 
  2. Berberian, Sterling (1972). Baer *-rings. Springer. 
  3. Heunen, Chris; Reyes, Manuel L. (2013). "Diagonalizing matrices over AW*-algebras". Journal of Functional Analysis 264 (8): 1873–1898. doi:10.1016/j.jfa.2013.01.022. 
  4. Ara, Pere (1989). "Left and right projections are equivalent in Rickart C*-algebras". Journal of Algebra 120 (2): 433–448. doi:10.1016/0021-8693(89)90209-3. 
  5. Wright, J. D. Maitland. "AW*-algebra". Springer. http://www.encyclopediaofmath.org/index.php/AW*-algebra. 
  6. Ozawa, Masanao (1984). "Nonuniqueness of the cardinality attached to homogeneous AW*-algebras". Proceedings of the American Mathematical Society 93: 681–684. doi:10.2307/2045544. 

Warning: Default sort key "AW-algebra" overrides earlier default sort key "Cylindrical sigma-algebra".

In mathematics, BF algebras are a class of algebraic structures arising out of a symmetric "Yin Yang" concept for Bipolar Fuzzy logic, the name was introduced by Andrzej Walendziak in 2007. The name covers discrete versions, but a canonical example arises in the BF space [-1,0]x[0,1] of pairs of (false-ness, truth-ness).

Definition

A BF-algebra is a non-empty subset X with a constant 0 and a binary operation * satisfying the following:

  1. x*x=0
  2. x*0=x
  3. 0*(x*y)=y*x

Example

Let Z be the set of integers and '' be the binary operation 'subtraction'. Then the algebraic structure (Z,) obeys the following properties:

  1. xx=0
  2. x0=x
  3. 0(xy)=yx

References

Short description: Topological complex vector space

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 C0(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 establish a general framework for these algebras, which culminated in a series of papers on rings of operators. These papers considered a special class of C*-algebras that are now known as von Neumann algebras.

Around 1943, the work of Israel Gelfand and Mark Naimark yielded an abstract characterisation of C*-algebras making no reference to operators on a Hilbert space.

C*-algebras are now an important tool in the theory of unitary representations of locally compact groups, and are also used in algebraic formulations of quantum mechanics. Another active area of research is the program to obtain classification, or to determine the extent of which classification is possible, for separable simple nuclear C*-algebras.

Abstract characterization

We begin with the abstract characterization of C*-algebras given in the 1943 paper by Gelfand and Naimark.

A C*-algebra, A, is a Banach algebra over the field of complex numbers, together with a map xx* for xA with the following properties:

x**=(x*)*=x
  • For all x, y in A:
(x+y)*=x*+y*
(xy)*=y*x*
  • For every complex number λ and every x in A:
(λx)*=λx*.
  • For all x in A:
xx*=xx*.

Remark. The first four identities say that A is a *-algebra. The last identity is called the C* identity and is equivalent to:

xx*=x2,

which is sometimes called the B*-identity. For history behind the names C*- and B*-algebras, see the history section below.

The C*-identity is a very strong requirement. For instance, together with the spectral radius formula, it implies that the C*-norm is uniquely determined by the algebraic structure:

x2=x*x=sup{|λ|:x*xλ1 is not invertible}.

A bounded linear map, π : AB, between C*-algebras A and B is called a *-homomorphism if

  • For x and y in A
π(xy)=π(x)π(y)
  • For x in A
π(x*)=π(x)*

In the case of C*-algebras, any *-homomorphism π between C*-algebras is contractive, i.e. bounded with norm ≤ 1. Furthermore, an injective *-homomorphism between C*-algebras is isometric. These are consequences of the C*-identity.

A bijective *-homomorphism π is called a C*-isomorphism, in which case A and B are said to be isomorphic.

Some history: B*-algebras and C*-algebras

The term B*-algebra was introduced by C. E. Rickart in 1946 to describe Banach *-algebras that satisfy the condition:

  • xx*=x2 for all x in the given B*-algebra. (B*-condition)

This condition automatically implies that the *-involution is isometric, that is, x=x*. Hence, xx*=xx*, and therefore, a B*-algebra is also a C*-algebra. Conversely, the C*-condition implies the B*-condition. This is nontrivial, and can be proved without using the condition x=x*.[1] For these reasons, the term B*-algebra is rarely used in current terminology, and has been replaced by the term 'C*-algebra'.

The term C*-algebra was introduced by I. E. Segal in 1947 to describe norm-closed subalgebras of B(H), namely, the space of bounded operators on some Hilbert space H. 'C' stood for 'closed'.[2][3] In his paper Segal defines a C*-algebra as a "uniformly closed, self-adjoint algebra of bounded operators on a Hilbert space".[4]

Structure of C*-algebras

C*-algebras have a large number of properties that are technically convenient. Some of these properties can be established by using the continuous functional calculus or by reduction to commutative C*-algebras. In the latter case, we can use the fact that the structure of these is completely determined by the Gelfand isomorphism.

Self-adjoint elements

Self-adjoint elements are those of the form x=x*. The set of elements of a C*-algebra A of the form x*x forms a closed convex cone. This cone is identical to the elements of the form xx*. Elements of this cone are called non-negative (or sometimes positive, even though this terminology conflicts with its use for elements of )

The set of self-adjoint elements of a C*-algebra A naturally has the structure of a partially ordered vector space; the ordering is usually denoted . In this ordering, a self-adjoint element xA satisfies x0 if and only if the spectrum of x is non-negative, if and only if x=s*s for some sA. Two self-adjoint elements x and y of A satisfy xy if xy0.

This partially ordered subspace allows the definition of a positive linear functional on a C*-algebra, which in turn is used to define the states of a C*-algebra, which in turn can be used to construct the spectrum of a C*-algebra using the GNS construction.

Quotients and approximate identities

Any C*-algebra A has an approximate identity. In fact, there is a directed family {eλ}λ∈I of self-adjoint elements of A such that

xeλx
0eλeμ1 whenever λμ.
In case A is separable, A has a sequential approximate identity. More generally, A will have a sequential approximate identity if and only if A contains a strictly positive element, i.e. a positive element h such that hAh is dense in A.

Using approximate identities, one can show that the algebraic quotient of a C*-algebra by a closed proper two-sided ideal, with the natural norm, is a C*-algebra.

Similarly, a closed two-sided ideal of a C*-algebra is itself a C*-algebra.

Examples

Finite-dimensional C*-algebras

The algebra M(n, C) of n × n matrices over C becomes a C*-algebra if we consider matrices as operators on the Euclidean space, Cn, and use the operator norm ||·|| on matrices. The involution is given by the conjugate transpose. More generally, one can consider finite direct sums of matrix algebras. In fact, all C*-algebras that are finite dimensional as vector spaces are of this form, up to isomorphism. The self-adjoint requirement means finite-dimensional C*-algebras are semisimple, from which fact one can deduce the following theorem of Artin–Wedderburn type:

Theorem. A finite-dimensional C*-algebra, A, is canonically isomorphic to a finite direct sum

A=eminAAe

where min A is the set of minimal nonzero self-adjoint central projections of A.

Each C*-algebra, Ae, is isomorphic (in a noncanonical way) to the full matrix algebra M(dim(e), C). The finite family indexed on min A given by {dim(e)}e is called the dimension vector of A. This vector uniquely determines the isomorphism class of a finite-dimensional C*-algebra. In the language of K-theory, this vector is the positive cone of the K0 group of A.

A †-algebra (or, more explicitly, a †-closed algebra) is the name occasionally used in physics[5] for a finite-dimensional C*-algebra. The dagger, †, is used in the name because physicists typically use the symbol to denote a Hermitian adjoint, and are often not worried about the subtleties associated with an infinite number of dimensions. (Mathematicians usually use the asterisk, *, to denote the Hermitian adjoint.) †-algebras feature prominently in quantum mechanics, and especially quantum information science.

An immediate generalization of finite dimensional C*-algebras are the approximately finite dimensional C*-algebras.

C*-algebras of operators

The prototypical example of a C*-algebra is the algebra B(H) of bounded (equivalently continuous) linear operators defined on a complex Hilbert space H; here x* denotes the adjoint operator of the operator x : HH. In fact, every C*-algebra, A, is *-isomorphic to a norm-closed adjoint closed subalgebra of B(H) for a suitable Hilbert space, H; this is the content of the Gelfand–Naimark theorem.

C*-algebras of compact operators

Let H be a separable infinite-dimensional Hilbert space. The algebra K(H) of compact operators on H is a norm closed subalgebra of B(H). It is also closed under involution; hence it is a C*-algebra.

Concrete C*-algebras of compact operators admit a characterization similar to Wedderburn's theorem for finite dimensional C*-algebras:

Theorem. If A is a C*-subalgebra of K(H), then there exists Hilbert spaces {Hi}iI such that

AiIK(Hi),

where the (C*-)direct sum consists of elements (Ti) of the Cartesian product Π K(Hi) with ||Ti|| → 0.

Though K(H) does not have an identity element, a sequential approximate identity for K(H) can be developed. To be specific, H is isomorphic to the space of square summable sequences l2; we may assume that H = l2. For each natural number n let Hn be the subspace of sequences of l2 which vanish for indices kn and let en be the orthogonal projection onto Hn. The sequence {en}n is an approximate identity for K(H).

K(H) is a two-sided closed ideal of B(H). For separable Hilbert spaces, it is the unique ideal. The quotient of B(H) by K(H) is the Calkin algebra.

Commutative C*-algebras

Let X be a locally compact Hausdorff space. The space C0(X) of complex-valued continuous functions on X that vanish at infinity (defined in the article on local compactness) forms a commutative C*-algebra C0(X) under pointwise multiplication and addition. The involution is pointwise conjugation. C0(X) has a multiplicative unit element if and only if X is compact. As does any C*-algebra, C0(X) has an approximate identity. In the case of C0(X) this is immediate: consider the directed set of compact subsets of X, and for each compact K let fK be a function of compact support which is identically 1 on K. Such functions exist by the Tietze extension theorem, which applies to locally compact Hausdorff spaces. Any such sequence of functions {fK} is an approximate identity.

The Gelfand representation states that every commutative C*-algebra is *-isomorphic to the algebra C0(X), where X is the space of characters equipped with the weak* topology. Furthermore, if C0(X) is isomorphic to C0(Y) as C*-algebras, it follows that X and Y are homeomorphic. This characterization is one of the motivations for the noncommutative topology and noncommutative geometry programs.

C*-enveloping algebra

Given a Banach *-algebra A with an approximate identity, there is a unique (up to C*-isomorphism) C*-algebra E(A) and *-morphism π from A into E(A) that is universal, that is, every other continuous *-morphism π ' : AB factors uniquely through π. The algebra E(A) is called the C*-enveloping algebra of the Banach *-algebra A.

Of particular importance is the C*-algebra of a locally compact group G. This is defined as the enveloping C*-algebra of the group algebra of G. The C*-algebra of G provides context for general harmonic analysis of G in the case G is non-abelian. In particular, the dual of a locally compact group is defined to be the primitive ideal space of the group C*-algebra. See spectrum of a C*-algebra.

Von Neumann algebras

Von Neumann algebras, known as W* algebras before the 1960s, are a special kind of C*-algebra. They are required to be closed in the weak operator topology, which is weaker than the norm topology.

The Sherman–Takeda theorem implies that any C*-algebra has a universal enveloping W*-algebra, such that any homomorphism to a W*-algebra factors through it.

Type for C*-algebras

A C*-algebra A is of type I if and only if for all non-degenerate representations π of A the von Neumann algebra π(A)″ (that is, the bicommutant of π(A)) is a type I von Neumann algebra. In fact it is sufficient to consider only factor representations, i.e. representations π for which π(A)″ is a factor.

A locally compact group is said to be of type I if and only if its group C*-algebra is type I.

However, if a C*-algebra has non-type I representations, then by results of James Glimm it also has representations of type II and type III. Thus for C*-algebras and locally compact groups, it is only meaningful to speak of type I and non type I properties.

C*-algebras and quantum field theory

In quantum mechanics, one typically describes a physical system with a C*-algebra A with unit element; the self-adjoint elements of A (elements x with x* = x) are thought of as the observables, the measurable quantities, of the system. A state of the system is defined as a positive functional on A (a C-linear map φ : AC with φ(u*u) ≥ 0 for all uA) such that φ(1) = 1. The expected value of the observable x, if the system is in state φ, is then φ(x).

This C*-algebra approach is used in the Haag–Kastler axiomatization of local quantum field theory, where every open set of Minkowski spacetime is associated with a C*-algebra.

See also

Notes

  1. Doran & Belfi 1986, pp. 5–6, Google Books.
  2. Doran & Belfi 1986, p. 6, Google Books.
  3. Segal 1947
  4. Segal 1947, p. 75
  5. John A. Holbrook, David W. Kribs, and Raymond Laflamme. "Noiseless Subsystems and the Structure of the Commutant in Quantum Error Correction." Quantum Information Processing. Volume 2, Number 5, pp. 381–419. Oct 2003.

References

Template:Spectral theory

Short description: Middle-school math class in the U.S.
A visual proof of the Pythagorean theorem

Pre-algebra is a common name for a course taught in middle school mathematics in the United States, usually taught in the 6th, 7th, 8th, or 9th grade.[1] The main objective of it is to prepare students for the study of algebra. Usually, Algebra I is taught in the 8th or 9th grade.[2]

As an intermediate stage after arithmetic, pre-algebra helps students pass specific conceptual barriers. Students are introduced to the idea that an equals sign, rather than just being the answer to a question as in basic arithmetic, means that two sides are equivalent and can be manipulated together. They may also learn how numbers, variables, and words can be used in the same ways.[3]

Subjects

Subjects taught in a pre-algebra course may include:

Pre-algebra may include subjects from geometry, especially to further the understanding of algebra in applications to area and volume.

Pre-algebra may also include subjects from statistics to identify probability and interpret data.

Proficiency in pre-algebra is an indicator of college success. It can also be taught as a remedial course for college students.[5]

See also

References

  1. In the Introduction to their book on prealgebra.(Szczepanski Kositsky) say that "the math in this book should match what's taught in many middle school classrooms in California, Florida, New York, Texas, and other states." (p. xix)
  2. "A Leak in the STEM Pipeline: Taking Algebra Early" (in en). U.S. Department of Education. November 2018. https://www2.ed.gov/datastory/stem/algebra/index.html. 
  3. Linchevski, Liora (1995). "Algebra With Numbers and Arithmetic With Letters: A Definition of Prealgebra". Journal of Mathematical Behavior 14: 113–120. doi:10.1016/0732-3123(95)90026-8. 
  4. "Gifted and Talented Honors Prealgebra | Johns Hopkins Center for Talented Youth" (in en). https://cty.jhu.edu/online/courses/mathematics/prealgebra.html. 
  5. Gningue, Serigne Mbaye; Menil, Violeta C.; Fuchs, Eric (June 1, 2014). "Applying Bruner's Theory of Representation to Teach Pre-Algebra and Algebra Concepts to Community College Students Using Virtual Manipulatives". The Electronic Journal of Mathematics and Technology 8. ISSN 1933-2823. 

Warning: Default sort key "Prealgebra" overrides earlier default sort key "AW-algebra".


Short description: Sigma-algebra used in probability and ergodic theory


In mathematics, especially in probability theory and ergodic theory, the invariant sigma-algebra is a sigma-algebra formed by sets which are invariant under a group action or dynamical system. It can be interpreted as of being "indifferent" to the dynamics.

The invariant sigma-algebra appears in the study of ergodic systems, as well as in theorems of probability theory such as de Finetti's theorem and the Hewitt-Savage law.

Definition

Strictly invariant sets

Let (X,) be a measurable space, and let T:(X,)(X,) be a measurable function. A measurable subset S is called invariant if and only if T1(S)=S.[1][2][3] Equivalently, if for every xX, we have that xS if and only if T(x)S.

More generally, let M be a group or a monoid, let α:M×XX be a monoid action, and denote the action of mM on X by αm:XX. A subset SX is α-invariant if for every mM, αm1(S)=S.

Almost surely invariant sets

Let (X,) be a measurable space, and let T:(X,)(X,) be a measurable function. A measurable subset (event) S is called almost surely invariant if and only if its indicator function 1S is almost surely equal to the indicator function 1T1(S).[4][5][3]

Similarly, given a measure-preserving Markov kernel k:(X,,p)(X,,p), we call an event S almost surely invariant if and only if k(Sx)=1S(x) for almost all xX.

As for the case of strictly invariant sets, the definition can be extended to an arbitrary group or monoid action.

In many cases, almost surely invariant sets differ by invariant sets only by a null set (see below).

Sigma-algebra structure

Both strictly invariant sets and almost surely invariant sets are closed under taking countable unions and complements, and hence they form sigma-algebras. These sigma-algebras are usually called either the invariant sigma-algebra or the sigma-algebra of invariant events, both in the strict case and in the almost sure case, depending on the author.[1][2][3][4][5] For the purpose of the article, let's denote by the sigma-algebra of strictly invariant sets, and by ~ the sigma-algebra of almost surely invariant sets.

Properties

  • Given a measure-preserving function T:(X,𝒜,p)(X,𝒜,p), a set A𝒜 is almost surely invariant if and only if there exists a strictly invariant set A such that p(AA)=0.[6][5]
  • Given measurable functions T:(X,𝒜)(X,𝒜) and f:(X,𝒜)(,), we have that f is invariant, meaning that fT=f, if and only if it is -measurable.[2][3][5] The same is true replacing (,) with any measurable space where the sigma-algebra separates points.

Examples

Exchangeable sigma-algebra

Given a measurable space (X,𝒜), denote by (X,𝒜) be the countable cartesian power of X, equipped with the product sigma-algebra. We can view X as the space of infinite sequences of elements of X,

X={(x0,x1,x2,),xiX}.

Consider now the group S of finite permutations of , i.e. bijections σ: such that σ(n)n only for finitely many n. Each finite permutation σ acts measurably on X by permuting the components, and so we have an action of the countable group S on X.

An invariant event for this sigma-algebra is often called an exchangeable event or symmetric event, and the sigma-algebra of invariant events is often called the exchangeable sigma-algebra. A random variable on X is exchangeable (i.e. permutation-invariant) if and only if it is measurable for the exchangeable sigma-algebra.

The exchangeable sigma-algebra plays a role in the Hewitt-Savage zero-one law, which can be equivalently stated by saying that for every probability measure p on (X,𝒜), the product measure p on X assigns to each exchangeable event probability either zero or one.[9] Equivalently, for the measure p, every exchangeable random variable on X is almost surely constant.

It also plays a role in the de Finetti theorem.[9]

Shift-invariant sigma-algebra

As in the example above, given a measurable space (X,𝒜), consider the countably infinite cartesian product (X,𝒜). Consider now the shift map T:XX given by mapping (x0,x1,x2,)X to (x1,x2,x3,)X. An invariant event for this sigma-algebra is called a shift-invariant event, and the resulting sigma-algebra is sometimes called the shift-invariant sigma-algebra.

This sigma-algebra is related to the one of tail events, which is given by the following intersection,

n(mn𝒜m),

where 𝒜m𝒜 is the sigma-algebra induced on X by the projection on the m-th component πm:(X,𝒜)(X,𝒜).

Every shift-invariant event is a tail event, but the converse is not true.

See also

Citations

  1. 1.0 1.1 1.2 Billingsley (1995), pp. 313–314
  2. 2.0 2.1 2.2 Douc et al. (2018), p. 99
  3. 3.0 3.1 3.2 3.3 3.4 Klenke (2020), p. 494-495
  4. 4.0 4.1 Viana & Oliveira (2016), p. 94
  5. 5.0 5.1 5.2 5.3 5.4 Durrett (2010), p. 330
  6. Viana & Oliveira (2016), p. 3
  7. Douc et al. (2018), p. 102
  8. Viana & Oliveira (2016), p. 95
  9. 9.0 9.1 Hewitt & Savage (1955)

References