Balance Operators in Theory & Applications

• Balance Operators are defined as operators constrained by balance relations, such as domain equality in Hilbert spaces and fluctuation–dissipation in SPDE discretizations.
• They are applied across diverse fields—including quantum channels, evolutionary algorithms, and proof theory—ensuring consistency through detailed balance and feasibility constraints.
• The concept unifies operator-theoretic symmetry, stochastic discretization, and computational optimization to maintain stability and accurate modeling in complex systems.

Searching arXiv for relevant papers on “balance operators” and related operator-theoretic uses of balance. “Balance operators” denotes a family of non-equivalent constructions in which an operator is constrained by a balance relation. In operator theory, a densely defined closed operator $T$ on a Hilbert space is balanced when $\mathcal D(T)=\mathcal D(T^*)$ (Schmüdgen, 2021). In numerical SPDEs, balance operators are constructed so that discrete noise covariances satisfy fluctuation–dissipation balance (Pazner et al., 2018). In quantum dynamics, balance appears as detailed balance or KMS symmetry for Kraus operators, Lindblad generators, and quasi-local jump operators (Andersson, 2015, Scandi et al., 26 May 2025, Tarnowski et al., 2023). In evolutionary computation, balanced crossover operators preserve Hamming weight (Manzoni et al., 2020). In proof theory, balanced rules for grounding operators are defined through detour-eliminability and deducibility conditions (Genco, 2023). More recent work extends operator-based balance to quantum Heider networks and to inverse problems for nonlinear balance laws (Kiani et al., 30 Jun 2025, Duan et al., 12 Oct 2025).

1. Hilbert-space balanced operators

The strict operator-theoretic notion is given by the definition: a densely defined closed operator $T$ on a Hilbert space is balanced if $\mathcal D(T)=\mathcal D(T^*)$ (Schmüdgen, 2021). The same source states that balanced operators are described in terms of their phase operators and their moduli, develops examples of balanced operators, and gives a characterization of the domain equality $\mathcal D(A)=\mathcal D(B)$ for positive self-adjoint operators $A$ and $B$ with bounded inverses in terms of their spectral measures (Schmüdgen, 2021).

This notion is domain-theoretic: the balancing condition is not a symmetry of values, rates, or probabilities, but an equality of operator domains. A plausible implication is that the emphasis falls on adjoint compatibility and on how polar-decomposition data interact with domain structure, rather than on equilibrium statistics or conservation laws.

2. Fluctuation–dissipation balance in stochastic discretization

For linear parabolic SPDEs, fluctuation–dissipation balance is the relation between the dissipative generator and the covariance of the forcing. In the continuum setting,

$$\partial_t u=\mathcal L\,u+g,\qquad E[g(\cdot,t)g(\cdot,s)^T]=\mathcal G\,\delta(t-s),$$

and with steady-state covariance $C=E[uu^T]$ one obtains

$$0=\frac{dC}{dt}=\mathcal L C+C\mathcal L^T+\mathcal G, \qquad \mathcal G=-(\mathcal L C+C\mathcal L^T).$$

After a DG semi-discretization,

$\mathcal D(T)=\mathcal D(T^*)$0

with $\mathcal D(T)=\mathcal D(T^*)$1 and stationary covariance $\mathcal D(T)=\mathcal D(T^*)$2, the discrete balance law is

$\mathcal D(T)=\mathcal D(T^*)$3

and after Euler–Maruyama time discretization,

$\mathcal D(T)=\mathcal D(T^*)$4

These relations are the basis of the Fluctuation-Dissipation Discretizations framework and of the Stochastic Discontinuous Galerkin Methods introduced in the paper (Pazner et al., 2018).

On a DG mesh with element-wise mass matrix $\mathcal D(T)=\mathcal D(T^*)$5, divergence $\mathcal D(T)=\mathcal D(T^*)$6, gradient $\mathcal D(T)=\mathcal D(T^*)$7, and LDG operator

$\mathcal D(T)=\mathcal D(T^*)$8

the target covariance is chosen as $\mathcal D(T)=\mathcal D(T^*)$9, corresponding to the discrete $T$0-energy. Substitution into the discrete fluctuation–dissipation relation yields the forcing covariance

$T$1

For the Neumann or periodic case, $T$2 and

$T$3

A practical factorization uses a block-wise Cholesky $T$4 and

$T$5

so that $T$6 and one samples $T$7 with $T$8 (Pazner et al., 2018).

The same framework treats weak Dirichlet conditions by decomposing $T$9, $\mathcal D(T)=\mathcal D(T^*)$0, and splitting $\mathcal D(T)=\mathcal D(T^*)$1, and it treats strong Dirichlet conditions by eliminating boundary DOFs through a mask $\mathcal D(T)=\mathcal D(T^*)$2 and balancing the reduced operators $\mathcal D(T)=\mathcal D(T^*)$3 and $\mathcal D(T)=\mathcal D(T^*)$4 (Pazner et al., 2018). In the periodic unstructured-mesh example on $\mathcal D(T)=\mathcal D(T^*)$5 with $\mathcal D(T)=\mathcal D(T^*)$6 DG, $\mathcal D(T)=\mathcal D(T^*)$7, and $\mathcal D(T)=\mathcal D(T^*)$8 Monte Carlo samples, the empirical covariance $\mathcal D(T)=\mathcal D(T^*)$9 up to $\mathcal D(A)=\mathcal D(B)$0 in relative $\mathcal D(A)=\mathcal D(B)$1, while “random flux” forcing produces significant spurious long-range correlations (Pazner et al., 2018). Here, balance operators are not a separate named class; rather, they are the discrete operators whose stochastic forcing is prescribed so that dissipation and covariance remain balanced.

3. Detailed balance in quantum channels and open systems

In discrete-time quantum channels, detailed balance can be encoded by an algebraic relation among Kraus operators. For a unital completely positive map

$\mathcal D(A)=\mathcal D(B)$2

and a density matrix $\mathcal D(A)=\mathcal D(B)$3, the correlation matrix is

$\mathcal D(A)=\mathcal D(B)$4

If $\mathcal D(A)=\mathcal D(B)$5 has $\mathcal D(A)=\mathcal D(B)$6-symmetric correlations, the key relation is the $\mathcal D(A)=\mathcal D(B)$7-sphere condition

$\mathcal D(A)=\mathcal D(B)$8

whose $\mathcal D(A)=\mathcal D(B)$9 case is

$A$0

The modular automorphism acts by

$A$1

and the time-reversed Kraus operators are

$A$2

Detailed balance is the requirement that $A$3 coincide, up to relabeling, with the original $A$4, and Theorem 3.3 shows that this is equivalent to the $A$5-sphere condition (Andersson, 2015).

The same paper interprets $A$6 as a positive, invertible modular operator that defines the unique invariant KMS state on the Kraus algebra and links the Kraus relations to the universal unitary compact quantum group $A$7; detailed balance is then expressed by the inclusion of the time-reversal subgroup in the orthogonal quantum subgroup $A$8 (Andersson, 2015). In this setting, balance is an operator-algebraic symmetry condition on the Kraus family.

For open many-body systems, a related but distinct notion is KMS detailed balance. With Gibbs state $A$9, the KMS inner product is

$B$0

and a generator $B$1 satisfies KMS detailed balance exactly when

$B$2

for all $B$3, equivalently

$B$4

The microscopic derivation without rotating-wave approximation produces a completely positive Lindblad generator with quasi-local jump operators

$B$5

and the resulting dynamics has $B$6 as its unique fixed point under mild ergodicity or primitive-ness assumptions, while the approximation error grows at most linearly in time (Scandi et al., 26 May 2025). Here the phrase “balance operators” refers to the quasi-local operators appearing in the dissipator of a KMS-symmetric Lindbladian.

Random-matrix models of detailed-balance Lindbladians provide a spectral counterpart. For a stationary state $B$7, quantum detailed balance is imposed through the $B$8-weighted inner product

$B$9

together with $$\partial_t u=\mathcal L\,u+g,\qquad E[g(\cdot,t)g(\cdot,s)^T]=\mathcal G\,\delta(t-s),$$0 and the requirement that $$\partial_t u=\mathcal L\,u+g,\qquad E[g(\cdot,t)g(\cdot,s)^T]=\mathcal G\,\delta(t-s),$$1 commute with the modular automorphism $$\partial_t u=\mathcal L\,u+g,\qquad E[g(\cdot,t)g(\cdot,s)^T]=\mathcal G\,\delta(t-s),$$2 (Tarnowski et al., 2023). In the nondegenerate case, the dissipator takes the block-diagonal “Davies generator” form with rates $$\partial_t u=\mathcal L\,u+g,\qquad E[g(\cdot,t)g(\cdot,s)^T]=\mathcal G\,\delta(t-s),$$3 satisfying

$$\partial_t u=\mathcal L\,u+g,\qquad E[g(\cdot,t)g(\cdot,s)^T]=\mathcal G\,\delta(t-s),$$4

For $$\partial_t u=\mathcal L\,u+g,\qquad E[g(\cdot,t)g(\cdot,s)^T]=\mathcal G\,\delta(t-s),$$5, the Kossakowski matrix is real symmetric, the resulting spectrum is purely real, and the density is described through a Pastur equation (Tarnowski et al., 2023). This literature does not rename the jump operators as balance operators, but it treats detailed balance as the defining structural restriction on the generator ensemble.

4. Balanced crossover operators in genetic algorithms

In genetic algorithms, a balanced crossover operator acts on binary strings under a weight constraint. Let $$\partial_t u=\mathcal L\,u+g,\qquad E[g(\cdot,t)g(\cdot,s)^T]=\mathcal G\,\delta(t-s),$$6 be the set of binary strings of length $$\partial_t u=\mathcal L\,u+g,\qquad E[g(\cdot,t)g(\cdot,s)^T]=\mathcal G\,\delta(t-s),$$7, with Hamming weight

$$\partial_t u=\mathcal L\,u+g,\qquad E[g(\cdot,t)g(\cdot,s)^T]=\mathcal G\,\delta(t-s),$$8

A balanced crossover operator takes two parents $$\partial_t u=\mathcal L\,u+g,\qquad E[g(\cdot,t)g(\cdot,s)^T]=\mathcal G\,\delta(t-s),$$9 of the same target weight $C=E[uu^T]$0 and produces an offspring $C=E[uu^T]$1 that also has weight $C=E[uu^T]$2 (Manzoni et al., 2020). The motivation is that many discrete optimization problems require balanced candidates, so keeping every generated individual feasible reduces the search space from $C=E[uu^T]$3 to exactly $C=E[uu^T]$4 feasible solutions (Manzoni et al., 2020).

The paper studies a counter-based balanced crossover. Two counters track copied zeros and ones. Once one counter reaches its threshold, the remaining bits are forced to the opposite value, guaranteeing final Hamming weight $C=E[uu^T]$5 (Manzoni et al., 2020). Its main modification is an adaptive bias strategy that deliberately introduces temporary unbalancedness after a threshold is reached, with probability $C=E[uu^T]$6, and then restores strict balancedness later in the run by shrinking

$C=E[uu^T]$7

The same method discounts the penalty for imbalance through

$C=E[uu^T]$8

This gives an explicit exploration–exploitation schedule: when $C=E[uu^T]$9 is large, imbalance is lightly punished; as $$0=\frac{dC}{dt}=\mathcal L C+C\mathcal L^T+\mathcal G, \qquad \mathcal G=-(\mathcal L C+C\mathcal L^T).$$0, the penalty approaches the full imbalance penalty (Manzoni et al., 2020).

The experimental target is maximizing nonlinearity of balanced Boolean functions of $$0=\frac{dC}{dt}=\mathcal L C+C\mathcal L^T+\mathcal G, \qquad \mathcal G=-(\mathcal L C+C\mathcal L^T).$$1 variables, represented by truth tables of length $$0=\frac{dC}{dt}=\mathcal L C+C\mathcal L^T+\mathcal G, \qquad \mathcal G=-(\mathcal L C+C\mathcal L^T).$$2 and target weight $$0=\frac{dC}{dt}=\mathcal L C+C\mathcal L^T+\mathcal G, \qquad \mathcal G=-(\mathcal L C+C\mathcal L^T).$$3. The GA uses population size $$0=\frac{dC}{dt}=\mathcal L C+C\mathcal L^T+\mathcal G, \qquad \mathcal G=-(\mathcal L C+C\mathcal L^T).$$4, tournament-3 selection, swap-mutation $$0=\frac{dC}{dt}=\mathcal L C+C\mathcal L^T+\mathcal G, \qquad \mathcal G=-(\mathcal L C+C\mathcal L^T).$$5, one crossover per replacement, termination after $$0=\frac{dC}{dt}=\mathcal L C+C\mathcal L^T+\mathcal G, \qquad \mathcal G=-(\mathcal L C+C\mathcal L^T).$$6 evaluations, $$0=\frac{dC}{dt}=\mathcal L C+C\mathcal L^T+\mathcal G, \qquad \mathcal G=-(\mathcal L C+C\mathcal L^T).$$7 updated every $$0=\frac{dC}{dt}=\mathcal L C+C\mathcal L^T+\mathcal G, \qquad \mathcal G=-(\mathcal L C+C\mathcal L^T).$$8 evaluations, a sweep over $$0=\frac{dC}{dt}=\mathcal L C+C\mathcal L^T+\mathcal G, \qquad \mathcal G=-(\mathcal L C+C\mathcal L^T).$$9 and $\mathcal D(T)=\mathcal D(T^*)$00, and $\mathcal D(T)=\mathcal D(T^*)$01 independent runs per parameter pair (Manzoni et al., 2020). With the weighted penalty, almost all parameter combinations achieved at least $\mathcal D(T)=\mathcal D(T^*)$02 of runs reaching nonlinearity at least $\mathcal D(T)=\mathcal D(T^*)$03, three combinations attained at least $\mathcal D(T)=\mathcal D(T^*)$04 of runs with best nonlinearity at least $\mathcal D(T)=\mathcal D(T^*)$05 and at least one run at the optimal value $\mathcal D(T)=\mathcal D(T^*)$06, and the best adaptive-bias setting $\mathcal D(T)=\mathcal D(T^*)$07 reached nonlinearity $\mathcal D(T)=\mathcal D(T^*)$08 in $\mathcal D(T)=\mathcal D(T^*)$09 runs, compared with $\mathcal D(T)=\mathcal D(T^*)$10 runs for plain counter-based crossover and $\mathcal D(T)=\mathcal D(T^*)$11 run for the map-of-ones crossover (Manzoni et al., 2020). In this literature, “balanced operator” means a search operator that enforces or modulates a combinatorial feasibility constraint.

5. Balanced rules for grounding operators

In proof theory, balance is attached not to an operator’s semantic fixed point or equilibrium law but to its introduction and elimination rules. The grounding framework extends a base grounding calculus $\mathcal D(T)=\mathcal D(T^*)$12 with three operators: the immediate grounding operator $\mathcal D(T)=\mathcal D(T^*)$13, the mediate grounding operator $\mathcal D(T)=\mathcal D(T^*)$14, and the grounding-tree operator $\mathcal D(T)=\mathcal D(T^*)$15 (Genco, 2023). Their rules are stated inferentially: $\mathcal D(T)=\mathcal D(T^*)$16 internalizes a single immediate grounding step, $\mathcal D(T)=\mathcal D(T^*)$17 corresponds to the transitive closure of the immediate grounding operator, and $\mathcal D(T)=\mathcal D(T^*)$18 internalizes chains of immediate grounding claims without losing information about them (Genco, 2023).

Balanced rules are evaluated through two proof-theoretic criteria. The first is detour-eliminability, or local harmony: every immediate cut-like detour consisting of an introduction rule followed immediately by an elimination rule on the same formula can be transformed away by a finite reduction preserving open hypotheses and final conclusion. The second is deducibility of identicals, or immediate expansion: from a formula $\mathcal D(T)=\mathcal D(T^*)$19 one can eliminate it to recover exactly the data needed to re-introduce $\mathcal D(T)=\mathcal D(T^*)$20 on the same $\mathcal D(T)=\mathcal D(T^*)$21 (Genco, 2023). Because grounding is hyperintensional, the strict version of deducibility of identicals fails for all three operators. The paper therefore introduces weak deducibility of identicals with respect to a background calculus $\mathcal D(T)=\mathcal D(T^*)$22: one may use the $\mathcal D(T)=\mathcal D(T^*)$23-rules together with the grounding-calculus rules implicitly required by the introduction rule (Genco, 2023).

The detailed outcome is asymmetrical. All three operators satisfy local harmony through explicit detour-reduction schemata, and the extension $\mathcal D(T)=\mathcal D(T^*)$24 by the rules for $\mathcal D(T)=\mathcal D(T^*)$25 admits a normalization theorem: every $\mathcal D(T)=\mathcal D(T^*)$26-derivation reduces by a finite sequence of detour reductions to a normal form containing no immediate I–E redexes (Genco, 2023). Weak deducibility of identicals holds for $\mathcal D(T)=\mathcal D(T^*)$27 and $\mathcal D(T)=\mathcal D(T^*)$28, but not for $\mathcal D(T)=\mathcal D(T^*)$29; from a single mediate grounding claim $\mathcal D(T)=\mathcal D(T^*)$30, one cannot in general recover the derivation-tree information needed to reintroduce the same claim (Genco, 2023). In this setting, “balanced operators” are operators whose inferential rules are balanced in the sense of proof-theoretic harmony.

6. Quantum Heider balance operators

A recent extension of balance operators appears in a quantum version of Heider balance theory for social networks. Each triad is modeled as a quantum state with balanced state $\mathcal D(T)=\mathcal D(T^*)$31 and imbalanced state $\mathcal D(T)=\mathcal D(T^*)$32, and the elementary transition operators are

$\mathcal D(T)=\mathcal D(T^*)$33

with $\mathcal D(T)=\mathcal D(T^*)$34 and $\mathcal D(T)=\mathcal D(T^*)$35 (Kiani et al., 30 Jun 2025). The number operator is

$\mathcal D(T)=\mathcal D(T^*)$36

and the projectors onto balanced and imbalanced subspaces are

$\mathcal D(T)=\mathcal D(T^*)$37

The quantum superposition transformation is implemented by the Hadamard operator $\mathcal D(T)=\mathcal D(T^*)$38 on each qubit, with network-wide transform $\mathcal D(T)=\mathcal D(T^*)$39 (Kiani et al., 30 Jun 2025).

The zero-temperature transition Hamiltonian is built from single-flip, flip-$\mathcal D(T)=\mathcal D(T^*)$40, and joint-flip terms involving $\mathcal D(T)=\mathcal D(T^*)$41 and $\mathcal D(T)=\mathcal D(T^*)$42, and is designed so that $\mathcal D(T)=\mathcal D(T^*)$43 and so that non-diagonal parts induce classical-to-quantum transitions toward balance (Kiani et al., 30 Jun 2025). The finite-temperature extension adds imbalancing terms weighted by $\mathcal D(T)=\mathcal D(T^*)$44 and $\mathcal D(T)=\mathcal D(T^*)$45:

$\mathcal D(T)=\mathcal D(T^*)$46

At $\mathcal D(T)=\mathcal D(T^*)$47 only the $\mathcal D(T)=\mathcal D(T^*)$48 terms survive; for $\mathcal D(T)=\mathcal D(T^*)$49 the $\mathcal D(T)=\mathcal D(T^*)$50 terms allow uphill moves with probability $\mathcal D(T)=\mathcal D(T^*)$51 (Kiani et al., 30 Jun 2025).

For the two-triad toy model,

$\mathcal D(T)=\mathcal D(T^*)$52

with $\mathcal D(T)=\mathcal D(T^*)$53 the unique ground state and $\mathcal D(T)=\mathcal D(T^*)$54 the steady classical configuration $\mathcal D(T)=\mathcal D(T^*)$55 (Kiani et al., 30 Jun 2025). Numerical diagonalization identifies a critical inverse temperature $\mathcal D(T)=\mathcal D(T^*)$56 or $\mathcal D(T)=\mathcal D(T^*)$57, where spectral gaps close and a quantum-statistical balance-to-imbalance phase transition appears (Kiani et al., 30 Jun 2025). In this literature, balance operators are literal creation, annihilation, projector, and Hamiltonian operators for balanced and imbalanced triadic states.

7. Balance-law operators and inverse identification

A different operator-theoretic use of balance appears in inverse problems for nonlinear balance laws. The governing equation is

$\mathcal D(T)=\mathcal D(T^*)$58

with boundary condition $\mathcal D(T)=\mathcal D(T^*)$59 on $\mathcal D(T)=\mathcal D(T^*)$60 (Duan et al., 12 Oct 2025). The flux and source are rephrased as Sobolev-space operators

$\mathcal D(T)=\mathcal D(T^*)$61

$\mathcal D(T)=\mathcal D(T^*)$62

so that the PDE becomes

$\mathcal D(T)=\mathcal D(T^*)$63

The inverse problem is to recover the operator actions $\mathcal D(T)=\mathcal D(T^*)$64 from a single passive boundary observation on a small open subset $\mathcal D(T)=\mathcal D(T^*)$65 of the lateral boundary (Duan et al., 12 Oct 2025).

The measurement map is

$\mathcal D(T)=\mathcal D(T^*)$66

and the domain is assumed to have a product-type geometry built from nozzle or slab components of thickness or transverse diameter $\mathcal D(T)=\mathcal D(T^*)$67 (Duan et al., 12 Oct 2025). Under Hölder regularity assumptions and a boundary flux-balance condition,

$\mathcal D(T)=\mathcal D(T^*)$68

coincidence of the single boundary measurement for two configurations implies, up to $\mathcal D(T)=\mathcal D(T^*)$69 errors, closeness of the corresponding flux and source operator realizations. The main estimates are

$\mathcal D(T)=\mathcal D(T^*)$70

and, when the flux realizations agree exactly,

$\mathcal D(T)=\mathcal D(T^*)$71

The proof uses complex geometrical optics solutions, a space-time Green’s identity, Hölder expansions, and small-geometry asymptotics (Duan et al., 12 Oct 2025).

This use of balance operators differs from the previous sections. The operators are not balanced by an adjoint-domain identity, a detailed-balance law, or a feasibility constraint. Instead, they are the flux and source operators associated with a nonlinear balance law. A plausible implication is that the common term “balance” here comes from the PDE class itself rather than from an operator symmetry, but the operator-theoretic recasting makes the input–output action of the balance law the central object of identification.