Bare Expansion: Theory & Applications

• Bare expansion is a canonical series method where quantities are expressed as formal Taylor series using non-interacting (bare) parameters.
• It is applied across various domains including quantum field theory, statistical mechanics, QBF solving, and model theory to provide a clear starting framework.
• The approach offers transparent baseline estimates but faces challenges like slow convergence and factorial growth of terms that often lead to resummation or dressing techniques.

A bare expansion is a canonical initial series expansion scheme in mathematics and theoretical physics, as well as in computer science, in which one expresses quantities directly as formal series in terms of a small parameter or coupling—without incorporating or resumming feedback from higher orders or “dressing” into the expansion objects. The terminology arises in diverse contexts: diagrammatic perturbation theory (“bare diagrams”), high-temperature expansions in statistical mechanics (“bare-mass expansion”), non-recursive expansion algorithms in quantified Boolean formula (QBF) solving (“bare expansion”), and model theory (expansions adding no new structure to open sets). Despite differing technical details, bare expansions share the feature of being constructed strictly and transparently from the underlying problem definition, providing the unique, unadorned expansion that precedes partial or full resummations, recursive extensions, or structural augmentation.

1. Bare Expansion in Diagrammatic Quantum Field Theory

The archetype of “bare expansion” appears in perturbative many-body physics, where observables such as correlation functions are expanded as Taylor series in the interaction strength, with all internal lines and vertices expressed in terms of noninteracting (“bare”) propagators and interactions. Letting $$S[\psi,\bar\psi] = \langle \psi|G_0^{-1}|\psi \rangle + S_{\text{int}}[\psi,\bar\psi]$$ be the action for fermionic degrees of freedom, the bare expansion is generated by introducing a continuous coupling $\xi$, defining $$S^{(\xi)} = \langle \psi|G_0^{-1}|\psi \rangle + \xi S_{\text{int}}$$. For any correlation function $G^{(\xi)}(\cdots)$, analyticity in $\xi$ justifies the Taylor expansion about $\xi=0$, with coefficients precisely the sum of all bare Feynman diagrams at each order. Setting $\xi=1$ yields the physical observable as an infinite sum of bare diagrams. On finite lattices at finite temperature, the analyticity radius $R$ satisfies $R > 1$, so the bare series is convergent for the physical value $\xi=1$ (Rossi et al., 2015).

Bare expansions stand in contrast to dressed (skeleton) expansions, which result from reorganizing or resumming subsets of diagrams, often by replacing bare propagators with self-consistently computed “dressed” ones. Rossi et al. demonstrate that, provided the action $S^{(\xi)}$ is analytic in $\xi$, the Taylor expansion (dressed or bare) converges to the correct result wherever $\xi=1$ lies within the analyticity domain. The bare expansion is thus the uniquely justified baseline series; any rearranged expansion must be recast as a Taylor series in some $\xi$ for equivalent rigor (Rossi et al., 2015).

2. Bare-Mass Expansion and High-Temperature Series

In statistical mechanics, especially the study of critical phenomena in the Ising model, the bare expansion takes the form of a high-temperature or $1/M$ series, where $M$ is defined as the bare mass $M = 2D\chi/\mu$ ($\chi$: susceptibility; $\mu$: second correlation moment). The inverse temperature $\beta$ is expanded as a function of $M$: $$\beta(M) = b_1 M^{-1} + b_2 M^{-2} + b_3 M^{-3} + \ldots$$ with explicit coefficients, e.g., $b_1 = 1$, $b_2 = -6$, $b_3 = 124/3$ for the three-dimensional simple cubic lattice (Yamada, 2013).

To improve convergence and extract critical parameters, the $\delta$-expansion is applied: the series is “dilated,” and binomial transforms are introduced, resulting in an order-by-order improved estimate. Free parameters ($\rho$, $\sigma$, etc.) are incorporated via derivatives of $\beta(M)$ to suppress leading corrections, and the principle of minimum sensitivity is invoked to select parameters and expansion points where the result is maximally stationary. Bare-mass expansions augmented by these techniques yield high-precision estimates of the critical inverse temperature $\beta_c$ and the critical exponent $\nu$; for instance, at $N=25$, a three-parameter scheme yields $\beta_c(25)=0.221687$ and $\nu \approx 0.6373$, aligning closely with world-accepted values (Yamada, 2013).

3. Bare Expansion in Quantified Boolean Formula (QBF) Solving

In theoretical computer science, specifically QBF solving, “bare expansion” refers to an algorithmic scheme where the quantifier expansion principle is applied in a non-recursive, non-nested fashion to the entire quantifier prefix, avoiding the recursive, block-wise expansion of traditional expansion solvers. The bare expansion algorithm, as implemented in the Ijtihad QBF solver, maintains two collections—universal assignments $A$ and existential assignments $S$—and iteratively generates expansions $$\Psi_\forall(A) = \bigwedge_{\alpha\in A}\phi^\alpha$$ and $$\Psi_\exists(S) = \bigwedge_{\sigma\in S}\neg\phi^\sigma$$, interleaved with SAT-solver calls. Termination and correctness are guaranteed by monotonic growth of $A$ and $S$, and the approach provides a conceptually minimal, recursion-free expansion discipline (Bloem et al., 2018).

Experimental comparisons show that bare (non-recursive) expansion is competitive with recursive expansion (e.g., in RAReQS), often requiring fewer large SAT-solver calls. Bare expansion can be efficiently hybridized with learned clauses from QCDCL-based solvers for further performance gains (Bloem et al., 2018).

4. Expansions Introducing No New Open Sets in Model Theory

In model theory, “bare expansion” terminology is analogous to the notion of expanding a structure $M$ to $M^*$ such that every open set definable in $M^*$ (with parameters) is already definable in $M$. This notion is characterized in the presence of a topological basis on $M$ and relates to the o-minimal open core property. Under technical conditions (density and openness of parameter sets), the equivalence theorem of (Boxall et al., 2010) asserts that $M^*$ introduces no new open sets if and only if certain density criteria for types hold, or equivalently, that every $M^*$-definable open set is $M$-definable.

For expansions by a generic predicate $G$, the absence of new open sets hinges on the nonexistence of “strong dividing” among open definable sets, encapsulated in Theorem 4.1 of (Boxall et al., 2010). This result preserves the “bare” topological structure of $M$, with implications for o-minimal structures, geometric theories, and various valued field settings.

5. Comparative Table: Bare Expansion Across Domains

Domain	Bare Expansion Context	Defining Features
Quantum field theory	Bare diagrammatic expansion	Taylor series in interaction; all lines/vertices undressed
Statistical mechanics	$(1/M)$ or bare-mass series	Series in bare mass, high-$T$ limit; no resummation initially
QBF solving	Non-recursive (bare) variable expansion	Expansion applies to entire quantifier prefix; no block-wise nesting
Model theory/topology	Expansions with no new open sets	Expanded structure adds no new definable open sets

Each instance involves constructing the minimal, unadorned expansion from the underlying data: no feedback loops, no recursive or feedback-based parameter adjustments, and no indirect structural complications.

6. Practical Considerations and Limitations

Bare expansions provide transparent, systematically improvable series but may suffer from slow convergence or large correction terms. In diagrammatic or series-based contexts, bare expansions are rigorously justified when analyticity is established (e.g., under finite-volume and absence of phase transitions). However, factorial proliferation of terms and conditional convergence often motivate subsequent dressing or resummation. In computational settings (e.g., QBF), the bare expansion may become memory-intensive due to the size of expanded formulas, but offers a clearer path to modularity and hybridization. In model-theoretic settings, checking the preservation of the “bare” open set structure requires verifying density and type conditions, with applications to topological tameness and definability preservation (Rossi et al., 2015, Yamada, 2013, Bloem et al., 2018, Boxall et al., 2010).

7. Broader Implications and Theoretical Role

The bare expansion forms the foundation for perturbative, analytic, and algorithmic frameworks. All partial resummations, dressed expansions, or structural refinements must ultimately connect to a bare expansion justified by analyticity, monotonicity, or definability arguments. As demonstrated across disparate research areas, the bare expansion concept unifies technical strategies by providing a canonical reference series, against which the correctness and convergence of more sophisticated, dressed, or hybrid schemes are measured (Rossi et al., 2015, Yamada, 2013, Bloem et al., 2018, Boxall et al., 2010).