Krivine Schemes: Banach Spaces, Rounding, and Optimization

• Krivine schemes are distinct mathematical constructions that describe approximate finite-dimensional structure, randomized vector-to-sign rounding, or positivity certificates, depending on the field.
• In Banach-space theory, the Krivine set identifies spaces such as ℓ_p that occur with arbitrarily small linear distortion, while counterexamples show this does not guarantee exact finite metric embeddings.
• In optimization and theoretical computer science, Krivine methods yield convergent linear-programming hierarchies, Grothendieck-inequality approximations, diffusion-based rounding, abstract machines, and realizability semantics.

Krivine schemes are a family of mathematical and computational constructions associated with several distinct uses of Krivine’s name. In the theory of Banach spaces, a Krivine scheme records finite-dimensional normed spaces that occur with arbitrarily small distortion inside a Banach space. In Grothendieck-type inequalities and semidefinite rounding, a Krivine scheme is a randomized transformation of Euclidean vectors into signs, usually through Gaussian projections and Boolean functions, designed to preserve inner products up to a controlled factor. In polynomial optimization, Krivine–Stengle schemes form hierarchies of linear-programming positivity certificates. Related but formally different objects include Krivine Abstract Machines, Alternating Parity Krivine Automata, Krivine realizability algebras, and Krivine diffusions.

1. Terminology and mathematical lineages

The expression Krivine scheme is not associated with a single formalism. Its meaning depends on the surrounding field.

In Banach-space theory, the term refers to approximate finite-dimensional representability. A Banach space $X$ contains $\ell_p^n$ with distortion at most $1+\varepsilon$ if there is an $n$-dimensional subspace of $X$ linearly isomorphic to $\ell_p^n$ with distortion at most $1+\varepsilon$. The values of $p$ for which this holds uniformly in $n$ form the Krivine set, or Krivine scheme, of $X$. This notion concerns approximate linear copies, not exact finite metric copies.

In Grothendieck theory, a Krivine scheme is a rounding procedure converting vector solutions of a semidefinite relaxation into scalar signs. Its analysis is governed by a Gaussian correlation function and, typically, by tensor-power transformations that invert this correlation function. The objective is to approximate the real Grothendieck constant $\ell_p^n$0, the least universal constant satisfying

$\ell_p^n$1

In polynomial optimization, a Krivine scheme is a finite-order hierarchy of Krivine–Stengle representations. A positive polynomial is represented as a nonnegative linear combination of products of normalized constraint polynomials $\ell_p^n$2 and their complements $\ell_p^n$3. Coefficient matching yields a linear program.

The term is also used in computational semantics. A Krivine Abstract Machine is an evaluator for lambda terms based on closures, environments, continuations, and stacks. Alternating Parity Krivine Automata combine such higher-order evaluation with alternating parity tree automata. Krivine realizability extends the machine-level apparatus into a classical realizability semantics for set theory. These formalisms are conceptually related through higher-order computation but are not instances of the Banach-space or Grothendieck-rounding meanings.

2. Krivine schemes in Banach-space theory

Let $\ell_p^n$4 and $\ell_p^n$5 be Banach spaces. A finite-dimensional space $\ell_p^n$6 is finitely representable in $\ell_p^n$7 if, for every $\ell_p^n$8, there is a linear embedding $\ell_p^n$9 with

$1+\varepsilon$0

A Banach space $1+\varepsilon$1 is finitely representable in $1+\varepsilon$2 when every finite-dimensional subspace of $1+\varepsilon$3 is finitely representable in $1+\varepsilon$4.

The classical Krivine theorem states that if $1+\varepsilon$5, then, for every $1+\varepsilon$6 and $1+\varepsilon$7, $1+\varepsilon$8 contains an $1+\varepsilon$9-dimensional subspace $n$0-isomorphic to $n$1. Equivalently, $n$2 occurs in $n$3 with arbitrarily small linear distortion, uniformly in $n$4.

This approximate assertion is substantially weaker than exact finite isometric representability. Linear isomorphism preserves norms only up to multiplicative constants, whereas an isometric embedding of a finite metric subset preserves every distance exactly. The distinction is expressed by the implications

$n$5

For $n$6, there exists a space $n$7 into which

$n$8

does not embed isometrically. The construction uses the Orlicz sequence space $n$9 with

$X$0

Strict convexity forces the images of $X$1 and $X$2, and of $X$3 and $X$4, to be antipodal. The prescribed distances then imply

$X$5

which contradicts the corresponding Clarkson inequality after separating the $X$6- and $X$7-power contributions.

For $X$8, the construction uses a modular sequence space with

$X$9

sufficiently rapidly. This space is isomorphic to $\ell_p^n$0, but the finite set

$\ell_p^n$1

does not embed isometrically into it. The obstruction again follows from strict convexity and Clarkson inequalities, now in the regime $\ell_p^n$2 and $\ell_p^n$3 (Kilbane et al., 2017).

The geometric mechanism can be described using the James constant

$\ell_p^n$4

The constructed spaces $\ell_p^n$5 have the same James constant as $\ell_p^n$6, but the supremum is not attained. Thus exact extremal configurations may disappear while the optimal numerical constant remains unchanged. The case $\ell_p^n$7 is exceptional: the strict coefficient inequalities used in both contradictions disappear, and the corresponding general finite-isometric question remains open in the cited discussion.

3. Krivine rounding and Grothendieck’s inequality

For a real matrix $\ell_p^n$8, define

$\ell_p^n$9

and

$1+\varepsilon$0

Grothendieck’s inequality asserts that

$1+\varepsilon$1

where $1+\varepsilon$2 is the real Grothendieck constant.

A $1+\varepsilon$3-dimensional Krivine scheme consists of a Borel probability measure

$1+\varepsilon$4

A sample $1+\varepsilon$5 from $1+\varepsilon$6 provides Boolean functions $1+\varepsilon$7. Given vectors $1+\varepsilon$8, the scheme preprocesses them into $1+\varepsilon$9, samples a Gaussian matrix $p$0, and outputs

$p$1

The scheme has quality $p$2 when the transformed vectors can be chosen so that

$p$3

for every $p$4. Multiplying by $p$5, summing, and using that the outputs are signs yields the Grothendieck inequality with constant $p$6.

Gaussian rotational invariance implies that every scheme induces a scalar correlation function

$p$7

The preprocessing must realize transformed inner products satisfying

$p$8

When $p$9 is invertible, the formal target is

$n$0

Tensor-power maps provide a way to realize the required nonlinear inner products simultaneously.

The classical one-dimensional scheme uses

$n$1

For correlated standard Gaussians,

$n$2

The inverse correlation is $n$3. Tensorizing the odd Taylor expansion of $n$4 yields transformed unit vectors whose inner products equal

$n$5

Consequently,

$n$6

This is the classical Krivine bound, not the exact value of $n$7. The bound is strictly larger than the real Grothendieck constant, so Krivine’s original conjecture that it was exact is false (Friedland et al., 2017).

Naor and Regev proved that the apparent defect of the classical one-dimensional rule does not imply a defect of the general method. For every $n$8, there exists a $n$9-dimensional oblivious Krivine scheme of quality at most

$X$0

where $X$1 is universal. Their construction begins with a measure realizing the normalized inner product at scale $X$2, analyzes a Gaussian correlation function $X$3, and constructs nonlinear tensor maps from the inverse series of $X$4. The resulting quality satisfies

$X$5

so high-dimensional oblivious Krivine schemes approximate $X$6 arbitrarily well (Naor et al., 2012).

The theorem does not establish Krivine’s original numerical conjecture. It establishes asymptotic optimality of the class of oblivious schemes when the dimension is allowed to grow.

4. Generalized Krivine rounding and stochastic variants

Krivine rounding extends beyond the sign-valued endpoint corresponding to $X$7. For the $X$8-Grothendieck problem in the convex range

$X$9

the vector relaxation has the form

$\ell_p^n$00

subject to

$\ell_p^n$01

The relaxation is convex precisely because $\ell_p^n$02 and $\ell_p^n$03.

The scalar sign map is replaced by Hölder-dual Gaussian powers: $\ell_p^n$04 Writing

$\ell_p^n$05

the normalized Gaussian correlation is

$\ell_p^n$06

The classical arcsine correlation is the endpoint case $\ell_p^n$07.

As in the classical construction, the inverse correlation function is expanded into a power series and simulated by tensor powers. If

$\ell_p^n$08

define the coefficientwise absolute majorant

$\ell_p^n$09

The admissible scaling is

$\ell_p^n$10

The resulting approximation guarantee is

$\ell_p^n$11

with the equivalent $\ell_p^n$12-formulation obtained by setting $\ell_p^n$13. The analysis connects approximation ratios with Gaussian moments, hypergeometric functions, inverse Taylor coefficients, and factorization through Hilbert space (Bhattiprolu et al., 2018).

A related stochastic formulation is given by Krivine diffusions. Let $\ell_p^n$14 be Brownian motion and let

$\ell_p^n$15

where $\ell_p^n$16 is positive on $\ell_p^n$17 and vanishes at the endpoints. The terminal value is a sign

$\ell_p^n$18

For the special coefficient

$\ell_p^n$19

the terminal signs satisfy

$\ell_p^n$20

Thus the diffusion reproduces exactly the Gaussian hyperplane-rounding kernel. Applied to MAXCUT, it attains the Goemans–Williamson ratio

$\ell_p^n$21

The diffusion is therefore not a better MAXCUT approximation algorithm than Goemans–Williamson; its significance is the realization of the same kernel as the terminal law of a slowed-down diffusion (Eldan et al., 2019).

Recent work has also investigated finite Gaussianized Hermite-chaos schemes. These use reservoirs based on Hermite polynomials of degrees such as $\ell_p^n$22 and $\ell_p^n$23, with correlations $\ell_p^n$24 and $\ell_p^n$25 rather than $\ell_p^n$26. Anti-alignment of the third-chaos component and alignment of the fifth-chaos component can suppress low-order nonlinear terms in the inverse correlation. The resulting improvement over the classical hyperplane radius is formulated through an inverse-majorant condition and transferred from an asymptotic weighted model to finite-dimensional schemes using locally uniform convergence, Rouche’s theorem, Cauchy estimates, and Wiener-algebra bounds. The advertised numerical conclusion in the supplied draft remains conditional on an unfinished interval certificate and contains an apparent inconsistency in translating the target radius into the final bound (Saha et al., 11 Aug 2026).

5. Krivine–Stengle schemes in polynomial optimization

Let

$\ell_p^n$27

be a compact basic semialgebraic set. For multi-indices $\ell_p^n$28, define

$\ell_p^n$29

Every such generator is nonnegative on $\ell_p^n$30.

The Krivine–Stengle positivity theorem states that if a polynomial $\ell_p^n$31 is strictly positive on $\ell_p^n$32, then, for some $\ell_p^n$33,

$\ell_p^n$34

Restricting the total exponent to $\ell_p^n$35 defines a finite-order Krivine scheme. Increasing $\ell_p^n$36 enlarges the certificate cone.

For polynomial minimization,

$\ell_p^n$37

the order-$\ell_p^n$38 relaxation is

$\ell_p^n$39

It satisfies

$\ell_p^n$40

The relaxation is a linear program because the coefficients $\ell_p^n$41 enter linearly and polynomial identities are imposed by coefficient matching.

Dense representations become large rapidly. For a box with $\ell_p^n$42 coordinate constraints, the number of LP variables is

$\ell_p^n$43

and the number of coefficient constraints is

$\ell_p^n$44

when the constraint polynomials are linear.

Sparse Krivine–Stengle schemes use variable blocks $\ell_p^n$45 and constraint blocks $\ell_p^n$46. They require:

1. a decomposition $\ell_p^n$47 with $\ell_p^n$48 depending only on variables in $\ell_p^n$49;
2. local constraints $\ell_p^n$50 depending only on variables in $\ell_p^n$51 for $\ell_p^n$52;
3. coverage of all variables and constraints;
4. the running intersection property.

Under these assumptions, a positive polynomial can be decomposed as

$\ell_p^n$53

where each $\ell_p^n$54 has a local Krivine–Stengle representation. The running intersection property preserves asymptotic convergence rather than merely reducing the number of variables.

In certified roundoff analysis, the floating-point model is

$\ell_p^n$55

The roundoff error is decomposed as

$\ell_p^n$56

where $\ell_p^n$57 is the first-order error and $\ell_p^n$58 is bounded separately by interval arithmetic. After scaling by $\ell_p^n$59, the first-order part is optimized over $\ell_p^n$60.

The sparse block for error variable $\ell_p^n$61 contains all input variables and only $\ell_p^n$62: $\ell_p^n$63 The corresponding local generators contain factors

$\ell_p^n$64

This avoids products involving several distinct error variables.

The resulting lower and upper LP relaxations produce

$\ell_p^n$65

and therefore certified enclosures

$\ell_p^n$66

Adding an interval enclosure $\ell_p^n$67 of the higher-order remainder gives

$\ell_p^n$68

The associated implementations are FPBern and FPKriSten. The Krivine-based implementation is particularly suited to polynomial programs over semialgebraic domains and to problems with many error variables, whereas Bernstein methods are particularly effective for low-dimensional box-constrained problems and also handle rational programs (Rocca et al., 2016, Magron et al., 2018).

6. Krivine machines, automata, and realizability

A Krivine Abstract Machine evaluates simply typed or untyped lambda terms using closures, environments, and an argument stack. A closure is a pair $\ell_p^n$69, consisting of an expression and the environment in which it is evaluated. Application pushes an argument closure onto the stack; variable lookup retrieves closures from environments; continuation mechanisms can capture and restore stacks.

Alternating Parity Krivine Automata combine this machinery with alternating parity tree automata. They operate on infinite full binary trees and provide operational semantics for Higher-Order Modal Fixpoint Logic. Their configurations contain a tree position, a current expression, environments, a closure stack, and a priority stack.

When a fixpoint state is entered, its arguments are stored in a fresh environment and its priority is pushed. When ground-type evaluation returns from an environment, the corresponding priority is removed. Acceptance is therefore governed not by ordinary parity on all visited states, but by a stair parity condition: only priorities that remain permanently on the dynamically evolving stack matter. An infinite play is accepting when the greatest priority that is never eventually popped is even.

APKA and HFL translate into one another without increasing type order. A state $\ell_p^n$70 becomes a fixpoint expression

$\ell_p^n$71

where $\ell_p^n$72 for odd priorities and $\ell_p^n$73 for even priorities. Conversely, HFL formulas can be normalized into APKA states with typed arguments and priority assignments. The translations establish equal expressive power at each fixed order.

The number and parity of priorities induce a strict hierarchy. For the semantic classes $\ell_p^n$74 and $\ell_p^n$75, the inclusions

$\ell_p^n$76

hold over the full class of infinite binary trees. The proof encodes acceptance games into trees and uses Arnold’s diagonal method together with Banach’s Fixpoint Theorem. The encoding map is a contraction under the metric

$\ell_p^n$77

where $\ell_p^n$78 is the first level at which the trees differ. Its unique fixed point yields the self-referential tree required for the contradiction argument (Bruse, 2016).

Krivine realizability uses related machine concepts but has a different semantic objective. A realizability algebra consists of closed lambda terms, stacks, a reduction relation, and a pole $\ell_p^n$79 of successful processes. Orthogonality is defined by

$\ell_p^n$80

A term realizes a formula when it is orthogonal to every stack in the formula’s falsity value.

The control operator $\ell_p^n$81 captures the current continuation and realizes Peirce’s law,

$\ell_p^n$82

This permits classical logic, unlike ordinary intuitionistic realizability. From a realizability algebra and a ground model of $\ell_p^n$83, one constructs a universe of names and interprets formulas through truth and falsity values. Under coherence, the resulting theory is consistent; after extensional collapse, it yields a model of ordinary ZF. Special instructions such as quote support non-extensional choice principles and dependent choice. Boolean-valued models and forcing arise as special cases or limiting semantic forms of the general framework (Matthews, 2023).

These computational meanings should not be conflated with Krivine rounding. A Krivine rounding scheme is a probabilistic or measurable transformation used in functional inequalities and approximation algorithms. A Krivine–Stengle scheme is a positivity-certificate hierarchy. A Krivine Abstract Machine is an operational evaluator. A Krivine realizability algebra is a machine-plus-pole semantics. Their common feature is the use of structured transformations—probabilistic, algebraic, or operational—to recover a target semantic property, but their mathematical objects and purposes are different.