C*-algebras have a rich order structure based on positive elements. This structure forms a partially ordered set, with suprema and infima playing key roles in defining completeness and order-preserving operations.
The order structure of C*-algebras is crucial for understanding states and positive functionals. These concepts connect to important theorems like monotone convergence and Kadison transitivity, which help analyze C*-algebra representations and decompositions.
Order Properties
Partial Order and Lattice Structure
- Partial order defines a binary relation on a set satisfying reflexivity, antisymmetry, and transitivity properties
- Lattice structure emerges when every pair of elements in a partially ordered set has both a supremum and infimum
- Hasse diagrams visually represent partial orders (finite sets)
- Complete lattices contain suprema and infima for all subsets, not just pairs of elements
- C*-algebras form partially ordered sets with respect to their positive elements
Supremum and Infimum Concepts
- Supremum (least upper bound) represents the smallest element greater than or equal to all elements in a subset
- Infimum (greatest lower bound) denotes the largest element less than or equal to all elements in a subset
- Supremum and infimum may not always exist in a partially ordered set
- Dedekind-complete partially ordered sets contain suprema and infima for all bounded subsets
- Supremum and infimum play crucial roles in defining completeness of normed spaces and C*-algebras
Order-Related Operations and Theorems
Order-Preserving Operations
- Order-preserving operations maintain the order relation between elements when applied
- Monotone functions serve as examples of order-preserving operations (real-valued functions)
- C*-algebra operations (addition, multiplication, involution) preserve order on positive elements
- Continuous functional calculus in C*-algebras preserves order for increasing functions
- Order-preserving isomorphisms between C*-algebras maintain both algebraic and order structures
Monotone Convergence Theorem and Applications
- Monotone convergence theorem guarantees convergence of monotone bounded sequences in complete lattices
- Applies to increasing sequences of positive elements in C*-algebras
- Extends to nets and filters in more general contexts
- Proves existence of limits for certain sequences of operators in C*-algebras
- Facilitates construction of spectral projections and functional calculus in operator algebras
Positivity in Functional Analysis
States and Positive Functionals
- States define normalized positive linear functionals on C*-algebras
- Positive functionals map positive elements to non-negative real numbers
- Riesz representation theorem connects positive functionals to measures (commutative case)
- GNS construction associates a Hilbert space representation to each state on a C*-algebra
- Kadison transitivity theorem relates pure states to irreducible representations
- States form a convex set, with pure states as extreme points
- Positive functionals decompose C*-algebras into direct sums or direct integrals of simpler algebras