{
  "id": "configuration-space",
  "title": "Configuration Space",
  "lang": "en",
  "source_lang": "en",
  "summary": "A configuration space represents all possible arrangements of a system, providing a geometric framework for mechanics, topology, robotics, and many-particle physics.",
  "category": "mathematics",
  "subcategory": "geometry",
  "type": "concept",
  "aliases": [
    "Space of configurations",
    "C-space"
  ],
  "generated_at": "2026-11-05",
  "model": "pro/gpt-6.1-sol",
  "url": "https://aiwiki.page/en/configuration-space/",
  "translations": {
    "zh-Hans": {
      "url": "https://aiwiki.page/zh/configuration-space/",
      "json": "https://aiwiki.page/zh/configuration-space.json"
    }
  },
  "sections": [
    {
      "heading": "",
      "text": "A configuration space is the mathematical space whose points represent the possible configurations of a system: its complete arrangements, without generally including velocities or momenta. A configuration might specify the positions of several particles, the joint angles of a robot, the orientation of a rigid body, or the value of a field throughout a region. A motion of the system is then represented by a curve through this space.\n\nThe concept connects classical mechanics, geometry, topology, and computational motion planning. Its central advantage is to replace the coordinated movement of many components with the movement of a single representative point. The resulting space may have a dimension far greater than ordinary physical space, and its global structure can determine whether a motion is possible, whether two motions are continuously deformable into one another, and which mathematical descriptions of dynamics are appropriate.\n\nThere is no single configuration space associated with every physical object independently of a model. Constraints, collision rules, particle labels, boundary conditions, and decisions about which arrangements count as equivalent all affect its construction. Understanding a configuration space therefore requires both a precise description of the system and attention to the geometry of the resulting set."
    },
    {
      "heading": "Configurations, coordinates, and degrees of freedom",
      "text": "For \\(N\\) labeled point particles moving freely in three-dimensional space, a configuration is an ordered list of positions,\n\n\\[q=(\\mathbf r_1,\\ldots,\\mathbf r_N), \\qquad \\mathbf r_i\\in\\mathbb R^3.\\]\n\nThe configuration space is the Cartesian product\n\n\\[Q=(\\mathbb R^3)^N\\cong\\mathbb R^{3N}.\\]\n\nOne point of this \\(3N\\)-dimensional space specifies the positions of every particle simultaneously. It does not mean that any individual particle moves in a physical space with \\(3N\\) spatial dimensions. The additional dimensions record independent information about different parts of the system.\n\nA system’s degrees of freedom are, in a regular finite-dimensional model, the number of independent coordinates needed to specify a configuration locally. A particle constrained to a sphere has two positional degrees of freedom, even though three Cartesian coordinates can be used to describe its location. Those three coordinates satisfy\n\n\\[x^2+y^2+z^2=R^2,\\]\n\nso only two can vary independently. The sphere itself, rather than any particular pair of coordinates, is the configuration space.\n\nGeneralized coordinates \\(q^1,\\ldots,q^n\\) need not be distances. They may be angles, relative displacements, or other parameters suited to the system. For a simple pendulum whose bob moves on a fixed circle, the configuration space is a circle \\(S^1\\). An angle \\(\\theta\\) describes its configurations, but \\(\\theta\\) and \\(\\theta+2\\pi\\) represent the same point. Treating the angle as an unrestricted real number instead describes an unwound covering space and distinguishes configurations that the physical model identifies.\n\nMany regular configuration spaces are manifolds: spaces that locally resemble Euclidean space, although their global structure may differ. A double pendulum with two independently rotating planar joints has configuration space \\(S^1\\times S^1\\), a two-dimensional torus. Its two angles give convenient periodic coordinates, but no single ordinary coordinate chart covers the entire torus without identifications. Coordinate singularities must consequently be distinguished from singularities of the configuration space itself.\n\nThe choice of what counts as a configuration is part of the model. A featureless sphere may be described by its center alone if orientation has no physical significance. A marked sphere requires orientation as well. Likewise, an extensible rod and a rigid rod have different configuration spaces, even if their observed shapes are momentarily identical. The configuration space records the possibilities admitted by a model, not merely the arrangement seen at one instant."
    },
    {
      "heading": "Constraints, admissible sets, and singularities",
      "text": "Constraints restrict the configurations or motions available to a system. A holonomic constraint can be expressed as a condition on positions and, potentially, time. For a time-independent system initially described by \\(m\\) coordinates, equations\n\n\\[f_a(q)=0,\\qquad a=1,\\ldots,k,\\]\n\ndefine a candidate configuration space. If their Jacobian matrix has rank \\(k\\) throughout the constraint set, that set is locally a smooth manifold of dimension \\(m-k\\). The rank condition is essential: simply subtracting the number of written equations can give an incorrect dimension when equations are redundant or become dependent.\n\nA rigid bar connecting two particles provides a basic example. Its fixed length \\(\\ell\\) imposes\n\n\\[\\|\\mathbf r_2-\\mathbf r_1\\|^2=\\ell^2.\\]\n\nStarting from six positional coordinates in three dimensions, this single independent constraint leaves five degrees of freedom: three for translation and two for the direction of the bar. A full rigid body generally also has an orientation about that direction, but two ideal point endpoints alone do not record it. This illustrates how the mathematical representation of a component determines which motions the model distinguishes.\n\nInequalities produce different geometric features. A particle confined to a closed container satisfies inequalities describing the container walls. Two solid bodies subject to nonpenetration conditions occupy an admissible subset whose boundary contains contact configurations. Such spaces may be manifolds with boundary, spaces with corners, or more complicated sets assembled from pieces of different dimensions. Whether contact is allowed changes the admissible set: excluding all contact generally gives an open free region, while allowing contact includes portions of its boundary.\n\nConstraint sets can also have genuine singularities. Consider two links of lengths \\(a\\) and \\(b\\) whose endpoint is constrained to a specified position. In ordinary configurations, the closure equations may impose independent conditions; at an aligned configuration their derivatives can lose rank. The linkage can then exhibit exceptional instantaneous motions or meeting branches of configurations. A rank drop signals that the regular-level-set theorem no longer applies, but it does not by itself determine the actual local dimension. Higher-order terms in the constraint equations may still restrict finite motion.\n\nNot every motion restriction can be absorbed into a smaller configuration space. A rolling wheel, for example, may occupy configurations specified by planar position, heading, and wheel rotation, yet the no-slip conditions restrict its allowed velocities. Such nonholonomic constraints are generally not integrable into equations involving configuration alone. For a car-like vehicle, the prohibition on sideways velocity does not prohibit a lateral displacement achieved through a sequence of forward, backward, and turning motions. The distinction between admissible positions and admissible instantaneous velocities is fundamental in both mechanics and robotics."
    },
    {
      "heading": "Rigid bodies, rotations, and articulated mechanisms",
      "text": "A freely moving rigid body in three-dimensional Euclidean space has six degrees of freedom: three translational and three rotational. Once a reference frame is attached to the body, its configuration can be represented by a translation \\(\\mathbf t\\in\\mathbb R^3\\) and a rotation \\(R\\). The rotation belongs to the special orthogonal group\n\n\\[SO(3)=\\{R\\in\\mathbb R^{3\\times3}:R^{\\mathsf T}R=I,\\ \\det R=1\\}.\\]\n\nThe transpose, orthogonality, and determinant conditions ensure that \\(R\\) preserves lengths, angles, and orientation. As a manifold, the rigid-body configuration space is \\(\\mathbb R^3\\times SO(3)\\).\n\nTranslations and rotations together form the special Euclidean group \\(SE(3)\\), an important Lie group. Its composition rule is\n\n\\[(R_1,\\mathbf t_1)(R_2,\\mathbf t_2) =(R_1R_2,\\mathbf t_1+R_1\\mathbf t_2).\\]\n\nThis is not the componentwise multiplication of a direct-product group: the first rotation changes the direction of the second translation. The group structure captures the composition of rigid motions, while the underlying manifold describes the configurations available to a rigid body. The distinction matters when deriving velocities, composing transformations, and implementing numerical algorithms.\n\nSeveral coordinate systems represent rotations, each with limitations. Euler angles use three angular parameters but develop singularities at certain orientations, commonly called gimbal lock. Rotation matrices avoid such coordinate singularities at the cost of using nine entries subject to six independent constraints. Unit quaternions use four components satisfying one normalization condition. A quaternion \\(u\\) and its negative \\(-u\\) represent the same rotation, so the unit three-sphere covers \\(SO(3)\\) twice. Topologically, \\(SO(3)\\) is real projective three-space rather than ordinary three-dimensional Euclidean space.\n\nFor a planar rigid body, the corresponding space is\n\n\\[SE(2)\\cong\\mathbb R^2\\times S^1\\]\n\nas a manifold. An articulated mechanism is assembled from rigid links and joints. An ideal revolute joint contributes an angular coordinate, while an ideal prismatic joint contributes a linear displacement. An open serial chain with \\(r\\) unrestricted revolute joints and \\(p\\) unrestricted prismatic joints therefore has an idealized joint space \\((S^1)^r\\times\\mathbb R^p\\), before collision restrictions or other constraints are imposed. Joint limits replace circles or lines by appropriate allowed intervals.\n\nClosed-chain mechanisms require additional closure equations because different chains of links must meet consistently. Their configuration spaces can have multiple assembly modes, disconnected components, and singular configurations. Moreover, the configuration space of a robot is not the same as its workspace: many joint configurations can place an end effector at the same location. A singularity of the map from joints to end-effector pose can occur even when the joint configuration space itself remains perfectly smooth."
    },
    {
      "heading": "Configuration space in analytical mechanics",
      "text": "Configuration space became a central organizing idea through analytical mechanics, especially the formulation presented by Joseph-Louis Lagrange in Mécanique analytique in 1788. Generalized coordinates allow equations of motion to be expressed without retaining every Cartesian coordinate and every constraint force explicitly. Their modern geometric interpretation treats positions as points of a manifold \\(Q\\), with velocities belonging to its tangent spaces. All position–velocity pairs together form the tangent bundle \\(TQ\\).\n\nA Lagrangian is a function \\(L:TQ\\times\\mathbb R\\to\\mathbb R\\), commonly written \\(L(q,\\dot q,t)\\). For many mechanical systems,\n\n\\[L=T-V, \\qquad T=\\frac12\\sum_{i,j}M_{ij}(q)\\dot q^i\\dot q^j.\\]\n\nHere \\(V\\) is potential energy and \\(M(q)\\) is the mass matrix. When positive definite, this matrix defines a metric tensor on configuration space. Its entries incorporate masses, moments of inertia, and the geometrical relations between chosen coordinates. The relevant metric is therefore not necessarily the ordinary Euclidean metric suggested by a coordinate diagram.\n\nThe Euler–Lagrange equations\n\n\\[\\frac{d}{dt}\\frac{\\partial L}{\\partial\\dot q^i} -\\frac{\\partial L}{\\partial q^i}=0\\]\n\nfollow from stationarity of the action\n\n\\[S[q]=\\int_{t_0}^{t_1}L(q,\\dot q,t)\\,dt\\]\n\nunder suitable endpoint-fixed variations. They are local coordinate expressions of dynamics defined geometrically on the configuration space and its tangent bundle. For a system with kinetic energy alone and no applied forces, trajectories are geodesics of the kinetic-energy metric, using time as an affine parameter. Potentials add forces that generally deflect trajectories away from these geodesics.\n\nConfiguration space must be distinguished from phase space. In Hamiltonian mechanics, a state is normally specified by position \\(q\\) and conjugate momentum \\(p\\). The natural geometric setting is the cotangent bundle \\(T^*Q\\), with local coordinates \\((q^i,p_i)\\). If \\(Q\\) has dimension \\(n\\), both \\(TQ\\) and \\(T^*Q\\) have dimension \\(2n\\). Knowing a configuration alone does not usually determine a system’s future: a pendulum at its lowest point can be stationary, moving clockwise, or moving counterclockwise.\n\nFor a regular Lagrangian, the relation\n\n\\[p_i=\\frac{\\partial L}{\\partial\\dot q^i}\\]\n\nlocally connects velocity and momentum descriptions through the Legendre transformation. Degenerate Lagrangians require additional constraint analysis. Configuration space thus supplies the positional foundation of analytical mechanics, but it does not replace the richer spaces needed to formulate complete dynamical states. The choice between configuration, velocity, and momentum descriptions depends on the problem being studied."
    },
    {
      "heading": "Spaces of distinct points and their topology",
      "text": "In topology, “configuration space” often has a more specific meaning: the space of several distinct points in a given space. For a manifold \\(M\\), the ordered configuration space of \\(n\\) points is\n\n\\[F(M,n)= \\{(x_1,\\ldots,x_n)\\in M^n:x_i\\ne x_j\\text{ whenever }i\\ne j\\}.\\]\n\nThe ordering assigns persistent labels to the points. Geometrically, this removes the pairwise collision sets, or diagonals, from the product \\(M^n\\). If \\(M\\) is a smooth \\(d\\)-dimensional manifold without boundary, then \\(F(M,n)\\) is an open submanifold of \\(M^n\\) of dimension \\(dn\\).\n\nDeleting collision configurations can radically alter topology without changing local dimension. For two points in the plane,\n\n\\[F(\\mathbb R^2,2)\\cong \\mathbb R^2\\times(\\mathbb R^2\\setminus\\{0\\}),\\]\n\nusing the first point’s position and the displacement from it to the second. The punctured plane can be continuously contracted onto a circle. Consequently, loops in this configuration space have an integer winding number, measuring how many times the relative displacement winds around the excluded collision. This information is invisible in a simple count of coordinates.\n\nIf the points are indistinguishable, permutations of their labels should not produce different configurations. The unordered configuration space is\n\n\\[C_n(M)=F(M,n)/S_n,\\]\n\nwhere \\(S_n\\) is the symmetric group. The quotient identifies ordered lists that differ only by a permutation. Because the points are distinct, no nonidentity permutation fixes an ordered configuration. This makes the quotient particularly well behaved for manifolds, in contrast with quotients that include coincident particles and therefore admit nontrivial stabilizers.\n\nThese spaces have a close relationship with braid groups. A path in \\(F(\\mathbb R^2,n)\\) traces \\(n\\) labeled particle trajectories, which can be drawn as strands in a diagram with time as the vertical direction. A loop returns every labeled particle to its initial position and determines a pure braid. A loop in the unordered space permits the endpoints to be permuted and determines an ordinary braid. Correspondingly, their fundamental groups are the pure braid group and braid group, respectively. Emil Artin developed the algebraic theory of braids in the 1920s; configuration spaces provide its geometric setting.\n\nSpatial dimension changes these results. Distinct labeled points on a line cannot exchange order without collision, so \\(F(\\mathbb R,n)\\) has \\(n!\\) connected components. For \\(d\\geq3\\), \\(F(\\mathbb R^d,n)\\) is simply connected, and the fundamental group of its unordered quotient is \\(S_n\\). The plane is therefore exceptional: particles can pass around one another, but the resulting winding information cannot generally be removed by deforming their paths without collision."
    },
    {
      "heading": "Symmetry, quotient spaces, and shape",
      "text": "Two configurations may be physically equivalent for a particular question even when their coordinates differ. A molecule translated across a laboratory retains the same internal geometry; a polygon rotated rigidly retains the same shape. Such equivalences are described by a group action of a symmetry group \\(G\\) on the configuration space \\(Q\\). The associated quotient space \\(Q/G\\) consists of the group’s orbits, with each orbit representing all configurations regarded as equivalent.\n\nFor \\(N\\) particles in three dimensions, translation can be removed by fixing the center of mass. If the masses are positive, the condition\n\n\\[\\sum_{i=1}^{N}m_i\\mathbf r_i=0\\]\n\nselects a translation-reduced space of dimension \\(3N-3\\). Removing overall rotations generically removes another three dimensions when \\(N\\geq3\\) and the configuration is noncollinear. The familiar count \\(3N-6\\) for internal positional degrees of freedom relies on these assumptions. It does not apply unchanged to a diatomic system, and linear configurations have different rotational stabilizers from generic noncollinear ones.\n\nThe difficulty is that different configurations can possess different symmetries. A noncollinear labeled arrangement generally has no nonidentity rotation fixing every point, whereas a collinear arrangement is fixed by rotations about its axis. Thus the action of the rotation group is not free everywhere. Its quotient need not be an ordinary smooth manifold; it may contain singular pieces or strata associated with different stabilizer types. These singularities arise from the equivalence relation itself and should not automatically be interpreted as physical collisions or failures of the unreduced model.\n\nA simple example is the shape of three labeled planar points. Removing translation fixes the centroid, and fixing a nonzero overall size leaves a three-sphere in a four-dimensional relative-coordinate space. Quotienting by planar rotations gives a two-sphere, often called the triangle shape sphere. On this sphere, collinear triangles form an equator, while the two hemispheres distinguish opposite orientations of noncollinear triangles. If reflections, relabelings, or collision configurations are also identified or excluded, a different shape space results. “Shape” therefore requires an explicit statement of the equivalences being imposed.\n\nSymmetry reduction also interacts with dynamics. A symmetry of a Lagrangian can imply a conserved momentum through Noether’s theorem, but removing a symmetry from configuration space is not the same operation as reducing dynamics at a fixed momentum. Rotating systems can retain effective centrifugal and geometric terms after reduction. In molecular mechanics and celestial mechanics, careful separation of overall motion from internal motion can simplify equations substantially, but the reduced equations must preserve the effects of the discarded variables rather than merely delete their coordinates."
    },
    {
      "heading": "Obstacles and collision-free robot configurations",
      "text": "In robotics, the configuration-space approach converts collision avoidance for an extended mechanism into a point-motion problem. A robot configuration \\(q\\in Q\\) determines the occupied region \\(A(q)\\) in physical workspace. For a workspace obstacle \\(O\\), its configuration-space obstacle is\n\n\\[Q_{\\mathrm{obs}} =\\{q\\in Q:A(q)\\cap O\\ne\\varnothing\\}.\\]\n\nThe free configuration space is the complement \\(Q_{\\mathrm{free}}=Q\\setminus Q_{\\mathrm{obs}}\\), with boundary conventions adjusted according to whether contact is permitted. A feasible geometric motion is a continuous path lying entirely in \\(Q_{\\mathrm{free}}\\).\n\nFor a translating robot with fixed orientation, configuration obstacles can be constructed using a Minkowski sum. If \\(A\\) is the robot’s reference shape and \\(\\mathbf t\\) its translation, collision occurs when\n\n\\[(A+\\mathbf t)\\cap O\\ne\\varnothing.\\]\n\nEquivalently,\n\n\\[\\mathbf t\\in O\\oplus(-A),\\]\n\nwhere \\(-A=\\{-a:a\\in A\\}\\). A circular robot of radius \\(r\\) moving among planar obstacles can therefore be replaced by a point robot while each obstacle is expanded outward by \\(r\\). This gives an exact collision transformation for that model, not merely a safety approximation.\n\nRotation and articulation make the construction more complicated. A planar polygonal robot has configuration coordinates \\((x,y,\\theta)\\), so its free space is three-dimensional even though its workspace is two-dimensional. A narrow passage may be traversable only at certain orientations. For an articulated arm, collision sets depend on all relevant joint angles and include both collisions with the environment and self-collisions between links. Consequently, a robot’s end effector may have an apparently clear route while the rest of the mechanism cannot follow it.\n\nThe configuration-space treatment of obstacles became prominent through Tomás Lozano-Pérez’s work in spatial planning, including his 1983 paper “Spatial Planning: A Configuration Space Approach.” One of its lasting conceptual contributions is the separation between a robot’s geometry in workspace and the geometry of forbidden configurations. A single complicated robot can be represented as a point, but the complexity has been transferred into higher-dimensional obstacle boundaries rather than eliminated.\n\nCollision freedom alone is not a complete account of executable motion. A path may violate velocity constraints, require excessive acceleration, or pass too close to an obstacle for a chosen tolerance. A curve parameterized by an arbitrary path variable must often be assigned a time law before it becomes a trajectory. For systems with nonholonomic constraints, even a smooth collision-free path may have tangent directions that the robot cannot follow. Such problems require configuration-space geometry to be combined with kinematics, dynamics, and an explicit model of allowable controls."
    },
    {
      "heading": "Motion planning, connectivity, and computational complexity",
      "text": "The elementary motion-planning problem asks whether two configurations \\(q_{\\mathrm{start}}\\) and \\(q_{\\mathrm{goal}}\\) can be joined by a continuous path in \\(Q_{\\mathrm{free}}\\), and, if so, how to construct one. At the topological level, this asks whether the points lie in the same path-connected component. Additional criteria turn it into an optimization problem: the desired path may minimize length, travel time, energy expenditure, or a specified cost. These objectives need not select the same motion, and their meaning depends on a metric or cost model rather than topology alone.\n\nLow-dimensional spaces can sometimes be represented explicitly using cells, arrangements, or graphs that preserve connectivity. For robots and obstacles described by polynomial equalities and inequalities, the free space is semialgebraic, connecting planning with real algebraic geometry. General exact methods can decide broad classes of such problems, but their computational cost grows rapidly. John Reif’s 1979 work established PSPACE-hardness for a generalized version of the mover’s problem. Such results concern precisely specified families of inputs; they do not imply that every practical robot-planning task is equally difficult.\n\nHigh-dimensional spaces motivate sampling-based algorithms. Probabilistic roadmaps, introduced in influential work by Lydia Kavraki, Petr Švestka, Jean-Claude Latombe, and Mark Overmars in 1996, sample configurations, retain collision-free ones, and connect nearby samples through a local planner. Rapidly exploring random trees, introduced by Steven LaValle in 1998, incrementally grow a tree through the space and have been extended to systems with differential constraints. These methods avoid constructing the full boundary of every configuration obstacle, instead relying heavily on repeated collision queries.\n\nTheir guarantees require precise interpretation. Probabilistic completeness means that, under suitable assumptions, the probability of failing to find an existing solution tends to zero as computation increases. It is not a finite-time guarantee that every failure certifies impossibility. Likewise, asymptotic optimality concerns convergence toward an optimum as the number of samples grows, under specified conditions. Narrow passages, poor sampling distributions, and expensive collision checks can remain major practical obstacles. The curse of dimensionality appears because uniformly resolving a space generally requires rapidly increasing resources as its dimension grows.\n\nTopology also limits how globally continuous a planning rule can be. Obstacles can create distinct homotopy classes of paths: routes passing on different sides of a hole cannot always be continuously deformed into one another while keeping endpoints fixed. Michael Farber’s topological complexity, introduced in 2003, measures the minimum number of local continuous motion-planning rules needed to cover endpoint pairs under standard conventions. This concerns the structure of motion-planning rules, not directly the running time of an implementation. It shows that discontinuous choices between qualitatively different routes can be forced by the topology of the configuration space itself."
    },
    {
      "heading": "Statistical mechanics and quantum configuration spaces",
      "text": "In thermodynamics and statistical mechanics, configuration space organizes the positional part of a many-particle ensemble. For classical particles with coordinates \\(q\\), momenta \\(p\\), and Hamiltonian \\(H(q,p)\\), the canonical distribution has weight\n\n\\[e^{-\\beta H(q,p)}, \\qquad \\beta=\\frac{1}{k_{\\mathrm B}T},\\]\n\nwhere \\(T\\) is temperature and \\(k_{\\mathrm B}\\) is the Boltzmann constant. The full distribution normally lives on phase space. Integrating over momenta gives a configurational distribution whose form depends on the kinetic energy and the coordinate measure.\n\nFor Cartesian particle coordinates with constant masses and a separable Hamiltonian \\(H=K(p)+V(q)\\), the positional density is proportional to\n\n\\[e^{-\\beta V(q)}.\\]\n\nIn generalized coordinates with\n\n\\[K(q,p)=\\frac12p^{\\mathsf T}M(q)^{-1}p,\\]\n\nintegrating the Gaussian momentum variables instead gives a density proportional to\n\n\\[\\sqrt{\\det M(q)}\\,e^{-\\beta V(q)}\\]\n\nrelative to the local coordinate volume \\(dq^1\\cdots dq^n\\). Equivalently, the kinetic metric supplies the natural volume factor. This distinction matters when comparing sampling procedures written in different coordinates or handling constrained molecular systems.\n\nFor a molecule, high-probability regions can correspond to different conformations separated by energy barriers. A protein may have thousands of atomic coordinates, while bond constraints or internal-coordinate models reduce the effective description. Projecting its configurations onto a few collective variables can reveal useful structure, but different configurations may project to the same point. Moreover, a free-energy landscape is not simply a potential-energy landscape: it also includes the statistical weight of configurations hidden by the projection. Sampling methods such as Markov chain Monte Carlo explore these distributions without enumerating all configurations.\n\nIn quantum mechanics, a many-particle wavefunction is commonly represented in the position description as\n\n\\[\\psi(\\mathbf r_1,\\ldots,\\mathbf r_N,t).\\]\n\nFor \\(N\\) particles in three dimensions, its positional arguments range over a \\(3N\\)-dimensional configuration space, with additional components or variables when spin and other internal degrees of freedom are included. An entangled state generally cannot be factored into one wavefunction for each particle. The shared configuration-space dependence expresses correlations that cannot be captured by assigning independent spatial wavefunctions to all constituents.\n\nIndistinguishability relates quantum statistics to configuration-space topology. In three or more spatial dimensions, exchanges of identical point particles are governed topologically by permutations; the standard bosonic and fermionic possibilities correspond to symmetric and antisymmetric exchange behavior. In two dimensions, exchanges are described by braids, allowing more general behavior, including anyonic phases and higher-dimensional braid representations. Physical realization requires appropriate quantum systems and dynamics: the topology identifies possible exchange structures but does not, by itself, determine which particles or excitations exist."
    },
    {
      "heading": "Infinite-dimensional and discrete configuration spaces",
      "text": "Finite-dimensional mechanical examples do not exhaust the concept. In a classical field theory, a configuration may specify a field value at every point of space. A real scalar field on a spatial manifold \\(\\Sigma\\), for example, is a function\n\n\\[\\phi:\\Sigma\\to\\mathbb R.\\]\n\nThe configuration space is then an appropriate space of such functions rather than a finite Cartesian product. Its precise definition depends on regularity, boundary conditions, decay at infinity, and the requirements of the equations of motion.\n\nThis leads naturally to functional analysis. Smooth functions are suitable for some geometric questions, while Sobolev spaces provide settings in which derivatives exist in a weak sense and energy functionals remain meaningful. The tangent directions to a linear field configuration space are field variations \\(\\delta\\phi\\). An action is a functional of fields or field histories, and its stationary points yield field equations. Specifying a field configuration on a spatial slice is generally not the same as specifying its complete dynamical state: conjugate momenta or initial time derivatives may also be needed.\n\nGauge theories introduce another layer of equivalence. Distinct mathematical field descriptions can represent the same physical configuration, so the physically relevant space involves quotienting a field space by gauge transformations. A familiar electromagnetic example changes the vector potential by a gradient while leaving the magnetic field unchanged. Global gauge structure can make these quotients geometrically complicated, and gauge-fixing conditions need not select exactly one representative everywhere. As in finite-dimensional symmetry reduction, configurations with different stabilizers can produce singular features in the quotient.\n\nA configuration space can also be discrete. A spin model with \\(N\\) sites and two possible values at each site has\n\n\\[Q=\\{-1,+1\\}^N, \\qquad |Q|=2^N.\\]\n\nFor a countably infinite lattice, configurations form an infinite product space, commonly equipped with the product topology and a suitable measurable structure. Energies assign weights to configurations, while prescribed updates define motion through the space. In a finite model, allowing single-spin flips turns the configuration set into the vertices of a hypercube graph. Different update rules produce different adjacency relations on the same set of configurations.\n\nLattice field theories, cellular automata, and distributed computational systems use related constructions. A local state is assigned to each site or component, and a global configuration records all assignments simultaneously. In these settings the decisive extra structure may be a graph of permitted transitions, a probability measure, or a topology rather than a smooth metric. The mathematical object called a configuration space is therefore not necessarily a manifold: its structure follows from the configurations admitted by the model and the relationships imposed between them."
    }
  ],
  "links": [
    "classical-mechanics",
    "geometry",
    "topology",
    "cartesian-product",
    "degrees-of-freedom",
    "circle",
    "manifold",
    "euclidean-space",
    "jacobian-matrix",
    "lie-group",
    "quaternion",
    "tangent-space",
    "tangent-bundle",
    "metric-tensor",
    "euler-lagrange-equations",
    "geodesic",
    "phase-space",
    "symmetric-group",
    "fundamental-group",
    "group-action",
    "quotient-space-topology",
    "noethers-theorem",
    "minkowski-sum",
    "polynomial",
    "algebraic-geometry",
    "curse-of-dimensionality",
    "thermodynamics",
    "boltzmann-constant",
    "molecule",
    "markov-chain-monte-carlo",
    "quantum-mechanics",
    "functional-analysis",
    "sobolev-space",
    "product-topology"
  ],
  "sources": [],
  "license": "https://creativecommons.org/licenses/by/4.0/"
}