Alphabeta Math
Pipeline-generated
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Finite-lattice polynomial Hamiltonian data

1 · Prerequisites

2 · Summary

This mathematical page fixes one finite-mode space, a coercive real polynomial, and its smooth compactly supported differential expression. It constructs the closed positive form, proves compactness of its inclusion by cube means and coercive tails, and obtains one explicit self-adjoint form realization with compact resolvent. Its domain is specified spectrally, and the proof does not claim essential self-adjointness of the initial differential expression or uniqueness among other extensions. A scaled Hermite basis gives an exact quadratic-form comparison; the resulting eigenbasis yields global unitary evolution, a finite Gibbs trace, and the ground-state variational principle. All claims concern fixed finite N and mathematical parameters; no measurement, continuum limit, or infinite-volume conclusion is included.

3 · Logical flowchart

4 · Definitions, postulates, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Finite-lattice polynomial Hamiltonian data

Definition

Assume Countable Choice (The Axiom of Countable Choice (ACω)). A finite-mode regulator in this item is a fixed finite nonempty label set J with N:=∣J∣≥1, a fixed enumeration of J by {1,…,N}, and the real coordinate vector q=(q1,…,qN)∈RN. The labels may name sites of a finite lattice or finitely many modes; their geometry enters only through the chosen polynomial below. No limit in N is part of this definition.

Choose real coefficients a1,…,aN>0, constants c>0 and C0≥0, and a real polynomial V∈R[q1,…,qN] such that V(q)≥c∣q∣2−C0(q∈RN). Let HN:=L2(RN,dq;C), with vectors identified up to almost everywhere equality and inner product ⟨u,v⟩:=∫RNu(q)v(q)‾ dq, linear in the first variable. Under Countable Choice this is a complex Hilbert space by L2 with the integral pairing is a Hilbert space. Let D0:=Cc∞(RN;C), the smooth compactly supported complex-valued functions. The associated polynomial differential expression is the map h0:D0→HN,h0u:=−∑j=1Naj∂j2u+Vu. It is well defined because each derivative of u and the product Vu are smooth and compactly supported. Set W:=V+C0+1, so W(q)≥1+c∣q∣2. This definition specifies finite mathematical data and a differential expression; it does not choose a self-adjoint operator domain or assert a continuum or infinite-volume limit.

LemmaStatement: AI-adaptedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Coercive polynomial form completion and injection

Statement

Assume Countable Choice. Use the finite data and notation of Finite-lattice polynomial Hamiltonian data: N≥1, HN=L2(RN,dq;C), D0=Cc∞(RN;C), and W=V+C0+1≥1+c∣q∣2. For u,v∈D0 define a(u,v):=∑j=1Naj∫RN(∂ju)∂jv‾ dq+∫RN(W+1)uv‾ dq, and ∥u∥Q:=a(u,u)1/2. Let Q be the completion of this inner-product space, constructed as equivalence classes of ∥⋅∥Q-Cauchy sequences. Then Q is a complex Hilbert space and the map sending a Cauchy class to its L2 limit is a continuous injective linear map Q↪HN with dense image. Each u∈Q has weak derivatives ∂ju∈L2 and a weighted function W+1 u∈L2, and ∥u∥Q2=∑j=1Naj∥∂ju∥22+∥W+1 u∥22. Here gj=∂ju means explicitly that ∫u ∂jφ‾=−∫gjφ‾ for every φ∈D0.

Facts & Assumptions

Given: Countable Choice, the data of Finite-lattice polynomial Hamiltonian data, and the L2 and density results below.

[A1]

The Axiom of Countable Choice (ACω): every countable family of nonempty sets has a choice function; only countably many representatives are selected in the completion argument.

[F1]

Finite-lattice polynomial Hamiltonian data: HN is complex L2 with first-variable-linear integral pairing, D0=Cc∞, and W=V+C0+1≥1+c∣q∣2.

[F2]

L2 with the integral pairing is a Hilbert space: under Countable Choice, HN is complete for ∥⋅∥2 and ⟨u,v⟩=∫uv‾ dq is its inner product.

[F3]

Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs: ∣⟨u,v⟩∣≤∥u∥2∥v∥2 in HN.

[F4]

Cc∞(Rn) is dense in Lp(Rn) for 1≤p<∞: under Countable Choice and for p=2, D0 is dense in HN.

Proof

technique · direct
1.1F1F2algebra

Since W+1≥2 and every aj>0, a is a Hermitian positive-definite sesquilinear form on D0: in particular a(u,u)=∑jaj∥∂ju∥22+∥W+1 u∥22≥2∥u∥22, and a(u,u)=0 forces u=0 in HN. Thus its Cauchy-sequence completion with the stated equivalence relation is a well-defined inner-product space.

2.1A1step 1.1algebra

To see that the completion is complete, let (Xn) be a Cauchy sequence of its classes. By [A1], choose un∈D0 with ∥[un]−Xn∥Q<2−n for each n. The triangle inequality makes (un) Q-Cauchy; its class X is defined by the Cauchy-sequence construction, and ∥Xn−X∥Q≤2−n+∥[un]−X∥Q→0. Hence Q is complete and therefore Hilbert.

2.2F1F2step 1.1

For a Q-Cauchy representative sequence (un), the inequalities ∥un−um∥2≤∥un−um∥Q, aj∥∂jun−∂jum∥2≤∥un−um∥Q, and ∥W+1(un−um)∥2≤∥un−um∥Q show that un, each ∂jun, and W+1un converge in L2 by [F2]; write their limits as u, gj, and h. The first limit defines a continuous map Q→HN, since ∥u∥2≤∥[un]∥Q, and equivalent Cauchy sequences have the same L2 limit.

3.1step 2.2F2F3algebra

For every φ∈D0, integration by parts gives ∫un∂jφ‾=−∫(∂jun)φ‾. Passing to the limit in both integrals by L2 convergence and Cauchy–Schwarz yields ∫u∂jφ‾=−∫gjφ‾, so gj is the stated weak derivative.

3.2step 2.2F1F2algebra

On each compact ball BR, the continuous polynomial W+1 is bounded. Therefore W+1un→W+1u in L2(BR), while the same sequence converges there to h; uniqueness of limits gives h=W+1u almost everywhere on every integer-radius ball and hence almost everywhere on RN. Taking limits of the component norms in a(un,un) now gives the displayed formula for ∥u∥Q2.

4.1step 3.1step 3.2F3F4algebra∎

If u=0 in L2, then step 3.1 says ⟨gj,φ⟩=0 for every φ∈D0; this pairing is continuous by [F3] and D0 is dense by [F4], so it vanishes on all of HN, and taking φ=gj gives gj=0. Step 3.2 then gives h=0; the norm formula yields ∥[un]∥Q=0, so the embedding is injective. Finally its image contains D0, which is dense in HN by [F4]; thus the continuous injection has dense image and all claims follow.

LemmaStatement: AI-adaptedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Cube mean estimate and compact form inclusion

Statement

Assume the finite-dimensional coercive form data and Hilbert space Q of Coercive polynomial form completion and injection. The inclusion J:Q↪HN is compact: the closure in HN of the image of every bounded subset of Q is compact in the metric topology. The proof below uses an explicit cube-mean approximation for each finite N and does not assume a general Rellich theorem.

Facts & Assumptions

Given: N≥1, the form domain Q, its norm, and the injection J:Q→HN.

[F1]

Coercive polynomial form completion and injection: Q is complete and injects densely into the complete Hilbert space HN; for u∈Q, its weak derivatives and weighted function are in L2 and ∥u∥Q2=∑j=1Naj∥∂ju∥22+∥W+1 u∥22, with W(q)≥1+c∣q∣2.

[F2]

Compact linear operator: a linear map is compact when the closure of the image of every bounded set is compact; it suffices to check the closed unit ball.

[F3]

Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs: on each L2 space, ∣∫fg‾∣≤∥f∥2∥g∥2.

[F4]

Fubini's theorem for L^1 functions on a sigma-finite product: integrable functions on sigma-finite products have equal iterated integrals; the continuous cube integrands used below are integrable.

Proof

technique · direct

Given: Countable Choice as inherited through [F1], the finite data, and an arbitrary Q-bounded set.

1.1F3F4algebra

Let C be a cube of side δ>0 and u∈Cc∞(RN;C), with uC:=∣C∣−1∫Cu. Expanding the square and using Fubini on the finite cube gives ∫C∣u−uC∣2=12∣C∣∫C∫C∣u(x)−u(y)∣2 dx dy. Telescope u(x)−u(y) through the N coordinate changes and use ∣∑j=1Nzj∣2≤N∑j∣zj∣2. For the jth change, the fundamental theorem of calculus and Cauchy–Schwarz give ∣Dj(x,y)∣2≤δ∫min⁡(xj,yj)max⁡(xj,yj)∣∂ju∣2. For fixed values of the other coordinates and fixed s∈[0,δ], the measure of pairs (xj,yj) whose segment contains s is 2s(δ−s)≤δ2/2; integrating the displayed bound over the cube variables and dividing by 2∣C∣ therefore yields the safe estimate ∥u−uC∥L2(C)2≤Nδ2∑j=1N∥∂ju∥L2(C)2. It applies to complex u because the squared-modulus Cauchy–Schwarz inequality is used.

1.2F1algebra

For R>0 and u∈Q, the coercive weight gives ∫∣q∣>R∣u(q)∣2 dq≤1cR2∫∣q∣>Rc∣q∣2∣u(q)∣2 dq≤1cR2∥u∥Q2. Thus the L2 tails of the Q unit ball are uniformly small for large R.

2.1step 1.1F1

The estimate of step 1.1 passes to every u∈Q: approximate u in the Q norm by elements of Cc∞ (the defining completion), restrict to C, and use [F1] to pass the L2 and derivative limits.

3.1step 2.1step 1.2F1choosealgebra

Fix ε>0. Choose R so the squared tail in step 1.2 is below ε2/16. For the Q unit ball, [F1] gives ∑j∥∂ju∥22≤∑jaj−1. Choose an integer M large enough that δ:=2R/M satisfies Nδ2∑jaj−1<ε2/16, and partition [−R,R]N into the resulting finitely many cubes of side δ. Summing the squared estimates of step 2.1 over these disjoint cubes bounds the total mean-approximation error by Nδ2∑j∥∂ju∥22<ε2/16. The squared error outside [−R,R]N is the tail from step 1.2; thus replacing u on each cube by its mean and setting it to zero outside the large cube has total squared L2 error below ε2/8, hence norm error below ε/2.

4.1step 3.1F1F3algebra

For the finite partition in step 3.1, the piecewise-constant mean function mu satisfies ∥mu∥22=∑C∣C∣∣uC∣2≤∑C∥u∥L2(C)2≤∥u∥22≤1 by Cauchy--Schwarz [F3]. Thus each mean coordinate has modulus at most ∣C∣−1/2, so the vectors of means lie in a bounded box in a finite-dimensional complex coordinate space. Subdivide its real-and-imaginary coordinates into finitely many boxes of sufficiently small side length so that the associated piecewise-constant functions approximate every mean vector to L2 error below ε/2. Combining with step 3.1 gives a finite ε-net for the image of the Q unit ball. Scaling shows that the image of every bounded Q set is totally bounded.

5.1step 4.1F1algebra

Let K be the HN closure of the image of the Q unit ball. It is complete because it is closed in the complete space HN [F1]. Suppose an open cover of K has no finite subcover. For each n≥1, step 4.1 supplies a finite 2−n−2-net for the image of the Q unit ball with centers in HN; the corresponding closed balls of radius 2−n−1 cover its closure K. Starting with C0=K, choose the least ball index for which Cn:=Cn−1∩B‾(pn,2−n−1) has no finite subcover. Such an index exists, since otherwise finitely many finite subcovers would cover Cn−1. Each Cn is nonempty, closed, nested, and has diameter at most 2−n. For m>n, any point of nonempty Cm lies in both selected balls, so ∥pm−pn∥2≤2−m−1+2−n−1; hence (pn) is Cauchy and converges to some p∈HN. Since Cn is nonempty and is contained in both K and B‾(pn,2−n−1), the distance from pn to K is at most 2−n−1. Therefore dist⁡(p,K)≤∥p−pn∥2+2−n−1→0; closedness of K gives p∈K. For fixed n and every m>n, nonempty Cm⊆Cn has a point y∈Cm with ∥pm−y∥2≤2−m−1. Thus there are points of Cn arbitrarily close to p, and closedness gives p∈Cn. An open set of the cover containing p contains K∩B(p,r) for some r>0; for large n, diam⁡(Cn)<r, so that one open set covers Cn, a contradiction. Thus K is compact. All recursive ball choices are least admissible indices in finite lists.

6.1step 5.1F2∎

Step 5.1 proves that the closed-unit-ball image under J has compact closure; applying the equivalent criterion in [F2] to the linear inclusion proves that J:Q↪HN is compact.

LemmaStatement: AI-adaptedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Anisotropic Hermite oscillator and quadratic form basis

Statement

Assume Countable Choice. Let N≥1, a1,…,aN>0 and c>0. Let Qosc be the completion of Cc∞(RN;C) for the form inner product aosc(u,v):=∑j=1Naj∫(∂ju)∂jv‾+∫(c∣q∣2+2)uv‾. This is the space Q of Coercive polynomial form completion and injection for V(q)=c∣q∣2 and C0=0. For n=(n1,…,nN)∈N0N, there is a smooth product Hermite function ψn such that ⟨ψn,ψm⟩L2=δnm,span⁡‾{ψn}=L2(RN), and (−∑j=1Naj∂j2+c∣q∣2)ψn=ϵnψn,ϵn:=∑j=1N(2nj+1)ajc. For the ground multi-index 0, the smooth representative is ψ0(q)=∏j=1N(bj/π)1/4e−bjqj2/2,bj:=c/aj. Each ψn belongs to Qosc, and every u∈Qosc satisfies the exact form expansion ∑j=1Naj∥∂ju∥22+c∥∣q∣u∥22=∑n∈N0Nϵn∣⟨u,ψn⟩∣2. All parameters are positive real mathematical parameters; this lemma makes no physical identification.

Facts & Assumptions

Given: Countable Choice, N≥1, aj,c>0, Lebesgue measure on RN, and the specified form completion Qosc.

[A1]

The Axiom of Countable Choice (ACω): every countable family of nonempty sets has a choice function; the imported basis and Hilbert expansions are used under this hypothesis.

[F1]

Coercive polynomial form completion and injection: the completion for aosc is a Hilbert space, injects continuously into L2, and its completed norm records the weak derivatives and weighted function.

[F2]

Multidimensional oscillator completeness: for ℏ,mj,ωj>0, the product Hermite functions form a complete orthonormal basis of L2(RN), and on each product function the differential expression −ℏ2∂j2/(2mj)+mjωj2qj2/2 has eigenvalue ℏωj(nj+1/2); Hermite recurrence: g0(y)=π−1/4e−y2/2; Oscillator scaling and exact realization: the scaling map is Df(x)=ℓ−1/2f(x/ℓ) with ℓ=ℏ/(mω).

[F3]

Fourier expansion in a Hilbert space: a complete orthonormal family in a Hilbert space has norm-convergent expansion and Parseval's identity; this applies to Qosc once completeness there is proved.

[F4]

Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs: ∣aosc(u,v)∣≤∥u∥Qosc∥v∥Qosc.

Proof

technique · direct

Given: the oscillator form, its completion, and positive coefficients aj,c.

1.1A1F2algebra

In [F2] choose ℏ=1, mj=(2aj)−1 and ωj=2ajc. Then ℏ2/(2mj)=aj and mjωj2/2=c. The eigenvalue from [F2] in coordinate j is ωj(nj+1/2)=(2nj+1)ajc. Summing over the N coordinates gives the displayed differential eigenvalue ϵn. In the same scaling, bj=mjωj=c/aj and the normalized nj=0 Gaussian becomes (bj/π)1/4e−bjqj2/2; taking the product gives the stated ground representative.

1.2F1algebra

Each product Hermite function is a polynomial times a Gaussian, so it and all first derivatives have finite squared integrals after multiplication by any fixed polynomial. Choose a smooth radial cutoff χR(q)=χ(q/R) with χ=1 on ∣q∣≤1, χ=0 on ∣q∣≥2, and ∣∇χR∣≤C/R. Such a χ can be formed from η(s)=e−1/s for s>0 and η(s)=0 for s≤0, by taking χ(q)=η(4−∣q∣2)/(η(4−∣q∣2)+η(∣q∣2−1)). Then 0≤χR≤1 and χRψn∈Cc∞. The weighted-function error is supported on ∣q∣>R and bounded in squared integral by the integrable tail (c∣q∣2+2)∣ψn∣2, so its L2 norm tends to zero. For each derivative, ∂j((1−χR)ψn)=(1−χR)∂jψn−(∂jχR)ψn; the first term tends to zero by its Gaussian tail and the second has norm at most C∥ψn∥2/R. Thus χRψn converges in the form norm, proving ψn∈Qosc.

2.1F1F2F4step 1.1algebra

For v∈Cc∞, integration by parts and the eigenvalue identity in step 1.1 give aosc(ψn,v)=(ϵn+2)⟨ψn,v⟩. The left side is continuous in the form norm of v by Cauchy--Schwarz [F4] in Qosc, and the right side is continuous since ∥v∥2≤∥v∥Qosc. Density of Cc∞ in its defining completion extends the identity to every v∈Qosc. Taking v=ψm proves that ξn:=(ϵn+2)−1/2ψn is orthonormal in Qosc. If u∈Qosc is orthogonal in this form inner product to every ξn, conjugating the displayed identity gives ⟨u,ψn⟩=0 for every n. Completeness in L2 from [F2] makes the image of u zero, and the injective inclusion in [F1] makes u=0 in Qosc. Thus (ξn) is complete there.

3.1F2F3step 2.1algebra∎

Parseval in Qosc with the complete orthonormal family (ξn) gives aosc(u,u)=∑n(ϵn+2)∣⟨u,ψn⟩∣2. Parseval in L2 gives ∥u∥22=∑n∣⟨u,ψn⟩∣2. Subtracting 2∥u∥22 from the first identity yields the asserted expansion of the unshifted oscillator form.

LemmaStatement: AI-adaptedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Positive injective compact polynomial form resolvent

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)) and use Q, HN, a, and W from Coercive polynomial form completion and injection. For each f∈HN, let Rf be the unique vector of Q satisfying a(v,Rf)=⟨v,f⟩HN(v∈Q), and view R as an operator HN→HN by the inclusion of Cube mean estimate and compact form inclusion. Then R is bounded, compact, self-adjoint, positive, injective, and has dense range; moreover ∥R∥≤12. This is the variational inverse of the shifted polynomial form. It establishes compactness and dense range but does not itself assert a differential-operator realization.

Facts & Assumptions

Given: Countable Choice, the coercive form Hilbert space Q, the complex Hilbert space HN, and the compact inclusion J:Q↪HN.

[A1]

The Axiom of Countable Choice (ACω): every countable family of nonempty sets has a choice function.

[F1]

Coercive polynomial form completion and injection: a is a Hilbert inner product on Q, ∥v∥2≤∥v∥Q, and a(v,v)≥2∥v∥22.

[F2]

Cube mean estimate and compact form inclusion: J:Q→HN is a compact linear inclusion.

[F3]

Riesz representation for Hilbert spaces: under Countable Choice, every bounded linear functional on a real or complex Hilbert space is uniquely represented by pairing in the first variable; the representing vector has the same norm as the functional.

[F4]

Cauchy–Schwarz: ∣⟨x,y⟩∣≤∥x∥ ∥y∥, with equality exactly for dependent pairs: ∣⟨u,v⟩∣≤∥u∥∥v∥ in HN and in Q.

[F5]

A bounded linear operator between normed spaces: a bounded linear operator is a linear map T with ∥Tx∥≤C∥x∥ for some C.

[F6]

Compact linear operator: a linear operator is compact when every bounded set has image with compact closure.

[F7]

Self-adjoint, positive, unitary and normal operators: for a bounded operator on a Hilbert space, self-adjoint means T∗=T and positive means ⟨Tx,x⟩≥0 for all x.

[F8]

The double orthogonal complement of a subspace is its closure: for a linear subspace M of a Hilbert space, M⊥⊥=M‾.

Proof

technique · direct
1.1A1F1F3F4given

For fixed f∈HN, the functional v↦⟨v,f⟩HN is linear and satisfies ∣⟨v,f⟩∣≤∥v∥2∥f∥2≤∥v∥Q∥f∥2 by [F1] and Cauchy–Schwarz. Thus [F3] applied to the Hilbert space (Q,a) gives a unique Rf∈Q with the stated variational identity. For α,β∈C, conjugate-linearity in the second argument gives a(v,αRf+βRg)=⟨v,αf+βg⟩, so uniqueness makes R linear.

2.1step 1.1F1F4F5algebra

Taking v=Rf in the identity gives ∥Rf∥Q2=a(Rf,Rf)=⟨Rf,f⟩. Hence ∥Rf∥Q2≤∥Rf∥2∥f∥2≤∥Rf∥Q∥f∥2, so ∥Rf∥Q≤∥f∥2 (with the zero case immediate). Consequently R:HN→HN is bounded by [F5].

2.2step 1.1F1F4algebra

The same identity and a(Rf,Rf)≥2∥Rf∥22 give 2∥Rf∥22≤∥Rf∥2∥f∥2; division when Rf≠0 yields ∥R∥≤12. If Rf=0, the variational identity says ⟨v,f⟩=0 for every v∈Q; since Q is dense in HN by [F1], continuity of the inner product gives ⟨f,f⟩=0, hence f=0. Thus R is injective.

2.3step 1.1F1F7algebra

For f,g∈HN, the variational identity and conjugate symmetry of a yield ⟨Rf,g⟩=a(Rf,Rg)=⟨f,Rg⟩, so R is self-adjoint by [F7]. Also ⟨Rf,f⟩=a(Rf,Rf)≥0, so it is positive.

3.1step 2.1F2F6

The map f↦Rf is bounded from HN into Q by step 2.1, and the inclusion J:Q→HN is compact by [F2]. Therefore for every bounded B⊆HN, R(B)=J(R(B)) has compact closure, which is exactly compactness by [F6].

4.1step 2.2step 2.3F8∎

If z⊥ran⁡R, then ⟨Rf,z⟩=0 for every f∈HN. Self-adjointness from step 2.3 gives ⟨f,Rz⟩=0 for every f, so Rz=0 and step 2.2 gives z=0. Thus (ran⁡R)⊥={0}, and [F8] gives ran⁡R‾=(ran⁡R)⊥⊥={0}⊥=HN. Therefore R has dense range.

TheoremStatement: AI-adaptedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Self-adjoint unbounded polynomial interaction at fixed regulator

Statement

Assume Countable Choice and the data of Positive injective compact polynomial form resolvent. Its variational operator R is compact, self-adjoint, positive, and injective on the infinite-dimensional complex Hilbert space HN. Let (μn)n≥1 be its positive eigenvalues in nonincreasing order, with multiplicity, and choose corresponding orthonormal eigenvectors (ψn)n≥1. Put En:=μn−1−1 and define D(S):={u=∑n≥1cnψn∈HN:∑n≥1En2∣cn∣2<∞},Su:=∑n≥1Encnψn. The series for u converges in HN by the Hilbert-space expansion theorem. Then S is self-adjoint and satisfies ⟨Su,u⟩≥∥u∥22 for every u∈D(S); also (S+I)−1=R is compact. For every u∈Cc∞(RN;C), Su=−∑j=1Naj∂j2u+Wu. Consequently h:=S−(C0+1)I, on the same domain, is a self-adjoint realization of the differential expression in Finite-lattice polynomial Hamiltonian data and satisfies ⟨hu,u⟩≥−C0∥u∥22 for every u∈D(h). It has compact resolvent, meaning that for some z∈C the map h−zI:D(h)→HN is bijective with bounded inverse on HN, and that inverse is compact; here z=−(C0+2) and (h+(C0+2)I)−1=R. Put λn:=En−C0−1, the eigenvalues of h; equivalently, D(h)={u=∑ncnψn:∑nλn2∣cn∣2<∞}. For every u∈Q, a(u,u)=∑n≥1(En+1)∣⟨u,ψn⟩∣2,qh(u):=a(u,u)−(C0+2)∥u∥22=∑n≥1λn∣⟨u,ψn⟩∣2. The lowest eigenvalue is attained and has finite multiplicity. This selects a form realization; it does not assert that the differential expression on Cc∞ is essentially self-adjoint or that it has no other self-adjoint extensions.

Facts & Assumptions

Given: Countable Choice, HN, the compact positive injective operator R, and its variational form.

[A1]

The Axiom of Countable Choice (ACω): every countable family of nonempty sets has a choice function; this is used to select orthonormal bases in countably many finite-dimensional eigenspaces.

[F1]

Positive injective compact polynomial form resolvent: R is bounded, compact, self-adjoint, positive, injective, and ∥R∥≤12; for each f∈HN, Rf∈Q is the unique vector satisfying a(v,Rf)=⟨v,f⟩ for all v∈Q.

[F2]

Spectral theorem for compact self adjoint operators: the nonzero eigenspaces of a compact self-adjoint operator are finite-dimensional, their eigenvalues are real with only possible accumulation point 0, and their closed span is (ker⁡R)⊥.

[F3]

Every finite-dimensional real or complex inner product space has an orthonormal basis: each finite-dimensional eigenspace has an orthonormal basis.

[F4]

Fourier expansion in a Hilbert space: a complete orthonormal family in a Hilbert space gives norm-convergent finite-subset expansions and Parseval's identity.

[F5]

Unbounded linear operators: domain, graph and extension, Adjoint of a densely defined operator, and Symmetric, self-adjoint and essentially self-adjoint operators: an unbounded operator has a specified linear domain; its adjoint domain consists of vectors for which the defining pairing is represented by a Hilbert-space vector; a densely defined operator is self-adjoint exactly when its domain equals its adjoint domain and the actions agree.

[F6]

Coercive polynomial form completion and injection and Fourier expansion in a Hilbert space: (Q,a) is a Hilbert space, Q injects into HN, and a complete orthonormal family in either Hilbert space has Parseval expansion in its Hilbert norm.

Proof

technique · direct
1.1F1F2algebra

By [F1], R is compact and self-adjoint. Applying [F2] and using ker⁡R={0} shows that the closed span of its nonzero eigenspaces is all of HN. If Rψ=μψ with ψ≠0, then μ∥ψ∥2=⟨Rψ,ψ⟩≥0 by positivity, while injectivity rules out μ=0; hence every nonzero eigenvalue is positive.

1.2F4algebra

The domains defined by the squared coefficient sums for En and λn=En−(C0+1) coincide. Indeed λn2≤2En2+2(C0+1)2,En2≤2λn2+2(C0+1)2. Multiplying by ∣cn∣2 and summing preserves finiteness in both directions because ∑n∣cn∣2=∥u∥22<∞ by [F4]. This proves the displayed coefficient-domain description of D(h).

2.1A1F1F2F3step 1.1algebra

Each eigenspace is finite-dimensional by [F2], and so has an orthonormal basis by [F3]. The set of nonzero eigenvalues is at most countable, and [A1] selects these finite bases; their union is an orthonormal family whose closed span is HN by step 1.1. The space is infinite-dimensional: the indicators of the pairwise disjoint unit cubes [r,r+1)×[0,1)N−1, r∈N, are nonzero mutually orthogonal L2 vectors. Thus the family can be indexed by n≥1. The bound ∥R∥≤12 gives 0<μn≤12 and En≥1. The compact spectral theorem says only finitely many eigenvalues satisfy μ≥ε for each ε>0; recursively taking a largest remaining eigenvalue (which exists because above half its positive supremum there are only finitely many) orders them nonincreasingly with multiplicity and gives μn→0, hence En→∞.

3.1F4F7step 1.1step 2.1algebra

The family (ψn) is complete by step 1.1, so [F4] gives u=∑n⟨u,ψn⟩ψn in norm for every u∈HN and Parseval. In particular D(S) is dense because it contains all finite linear combinations of the ψn. Since each En is real, the diagonal formula for S gives ⟨Su,v⟩=⟨u,Sv⟩ for finite sums, and then for all u,v∈D(S) by [F7] and convergence of the coefficient series; thus S is symmetric. For u∈D(S) with coefficients cn, Cauchy--Schwarz [F7] makes ∑nEn∣cn∣2 absolutely convergent, and step 2.1 gives En≥1, so ⟨Su,u⟩=∑nEn∣cn∣2≥∑n∣cn∣2=∥u∥22.

4.1F4F5F7step 3.1algebra

To compute the adjoint domain, let v=∑ndnψn∈D(S∗) and write S∗v=z=∑nznψn. Testing the adjoint identity on each ψn gives zn=Endn. Because z∈HN, Parseval gives ∑nEn2∣dn∣2<∞, so v∈D(S). Conversely, if this sum is finite, then z:=∑nEndnψn∈HN and the coefficient identity ⟨Su,v⟩=⟨u,z⟩ holds first for finite sums and then for every u∈D(S) by [F7]; hence v∈D(S∗) and S∗v=Sv. Therefore D(S∗)=D(S) and S∗=S as operators; by the unbounded self-adjointness definition in [F5], S is self-adjoint.

4.2F1F4step 2.1step 3.1algebra

For f=∑nfnψn∈HN, boundedness of R and its action on each eigenvector give Rf=∑nμnfnψn. Since Enμn=1−μn∈[0,1], we have ∑nEn2∣μnfn∣2≤∑n∣fn∣2<∞, so Rf∈D(S) and (S+I)Rf=f. Conversely, for u=∑ncnψn∈D(S), R(S+I)u=∑nμn(En+1)cnψn=u. Thus S+I:D(S)→HN is bijective with bounded inverse R, which is compact by [F1].

5.1F1F4F6step 1.1step 2.1step 4.2algebra

The variational identity for R, applied to f=ψn, gives a(v,Rψn)=⟨v,ψn⟩ for every v∈Q. Since Rψn=μnψn and μn>0, each ψn lies in Q and a(v,ψn)=μn−1⟨v,ψn⟩. Thus ξn:=μn ψn is an orthonormal family in Q. If v∈Q is orthogonal in a to every ξn, the displayed identity makes all HN coefficients ⟨v,ψn⟩ zero. The HN completeness of (ψn) and injectivity of Q↪HN force v=0 in Q. Hence (ξn) is complete in Q, and Parseval in (Q,a) gives a(v,v)=∑nμn−1∣⟨v,ψn⟩∣2=∑n(En+1)∣⟨v,ψn⟩∣2.

5.2F1F7step 4.2algebra

Let u∈Cc∞ and set f:=(−∑jaj∂j2+W+1)u∈HN. Integration by parts gives a(u,v)=⟨f,v⟩ for v∈Cc∞; both sides are continuous in v for the Q norm by [F7], and Cc∞ is dense in Q, so the identity holds for all v∈Q. It is the defining variational identity for Rf, and uniqueness in [F1] gives Rf=u. Hence u∈ran⁡R=D(S) and (S+I)u=f, so Su=−∑jaj∂j2u+Wu.

6.1step 5.1F4algebra

Parseval in HN gives ∥v∥22=∑n∣⟨v,ψn⟩∣2. Subtracting (C0+2) times this identity from step 5.1 yields the claimed formula for qh(v), because En+1−(C0+2)=En−C0−1=λn.

6.2F2step 5.1algebra

If u∈D(h)=D(S) and cn=⟨u,ψn⟩, then ∑nEn2∣cn∣2<∞ by the definition of D(S). Since En≥1, En+1≤2En2, so ∑n(En+1)∣cn∣2<∞. Step 5.1 therefore gives u∈Q. Thus every eigenvector, and indeed every operator-domain vector, belongs to the form domain.

7.1F1F2F7step 2.1step 4.2step 5.2∎

Subtracting the real scalar (C0+1)I preserves self-adjointness on the same domain, and En≥1 gives eigenvalues λn=En−C0−1≥−C0. For u∈D(h), the diagonal expansion and Cauchy--Schwarz [F7] make ⟨hu,u⟩=∑nλn∣⟨u,ψn⟩∣2 absolutely convergent; Parseval then gives ⟨hu,u⟩≥−C0∥u∥22. The lowest eigenvalue corresponds to the largest eigenvalue μ1 of R; its eigenspace is nonzero and finite-dimensional by [F2]. Since W=V+C0+1, step 5.2 shows that h=S−(C0+1)I extends the specified polynomial differential expression. Finally h+(C0+2)I=S+I, whose inverse is the compact operator R by step 4.2. These statements establish the declared realization and all listed scope limits.

TheoremStatement: AI-adaptedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Global unitary evolution at fixed finite regulator

Statement

Assume Countable Choice and let h be the self-adjoint operator of Self-adjoint unbounded polynomial interaction at fixed regulator, with complete orthonormal eigenfamily (ψn)n≥1 and real eigenvalues λn=En−C0−1. For t∈R define U(t)f:=∑n≥1e−itλn⟨f,ψn⟩ψn(f∈HN). Then the series converges in HN for every f; U(t) is unitary, U(0)=I, U(s+t)=U(s)U(t), and t↦U(t)f is norm-continuous for every f. Its norm derivative at any t exists exactly for f∈D(h), and then ddtU(t)f=−i hU(t)f. This is a mathematical one-parameter group with a dimensionless real parameter; it makes no physical unit or empirical claim.

Facts & Assumptions

Given: Countable Choice; HN; the self-adjoint h; its eigenvectors and real eigenvalues.

[A1]

The Axiom of Countable Choice (ACω): countable selections used in the eigenbasis construction are permitted.

[F1]

Self-adjoint unbounded polynomial interaction at fixed regulator: (ψn) is a complete orthonormal eigenfamily of h, hψn=λnψn, and D(h)={f:∑nλn2∣⟨f,ψn⟩∣2<∞}.

[F2]

Fourier expansion in a Hilbert space: expansions in the complete orthonormal family converge in norm and Parseval identifies the squared norm with the coefficient-square sum.

Proof

technique · direct

Given: f∈HN, its coefficients cn=⟨f,ψn⟩, and the real sequence (λn).

1.1A1F1F2algebra

Parseval gives ∑n∣cn∣2=∥f∥2. Since ∣e−itλn∣=1, the finite partial sums defining U(t)f are Cauchy in HN, so converge; Parseval gives ∥U(t)f∥2=∑n∣cn∣2=∥f∥2. The coefficient formula shows U(−t)U(t)f=f=U(t)U(−t)f and U(s)U(t)f=U(s+t)f, first on finite sums and then on all of HN by norm convergence and the norm bound. Thus U(t) is a surjective isometry, hence unitary, and U(0)=I.

1.2F2algebra

Fix s∈R and f∈HN. Given ε>0, choose a finite set F⊂N with ∑n∉F∣cn∣2<ε2/64, possible by convergence of the nonnegative series in [F2]. The norm of the difference on the complement is at most 2(∑n∉F∣cn∣2)1/2<ε/4. On the finite set F, each scalar e−itλn is continuous in t, so the finite partial difference has norm below 3ε/4 for t sufficiently close to s. The triangle inequality proves ∥U(t)f−U(s)f∥<ε, establishing strong continuity.

1.3F1F2algebra

Let f∈D(h), so ∑nλn2∣cn∣2<∞. Since ∣e−itλn∣=1, U(t)f has the same finite weighted coefficient sum and belongs to D(h). For r≠0, U(t+r)f−U(t)fr=∑ne−itλne−irλn−1rcnψn. The scalar integral identity e−irλ−1=∫0r(−iλ)e−isλ ds gives ∣(e−irλ−1)/r∣≤∣λ∣. Thus the difference quotient coefficients are dominated in square sum by λn2∣cn∣2. On each finite set they converge to −iλne−itλncn; choosing a finite set with small tail in that dominating series and then taking r→0 proves convergence in HN to −i∑nλne−itλncnψn=−ihU(t)f.

2.1F1F2F3algebra∎

Conversely, suppose the norm derivative at t=0 exists and equals g∈HN. Continuity of the coefficient functional v↦⟨v,ψn⟩ from [F3] makes its value on the difference quotient converge to −iλncn. Hence ⟨g,ψn⟩=−iλncn for every n. Parseval for g implies ∑nλn2∣cn∣2=∥g∥2<∞, so f∈D(h) by [F1]. If the derivative exists at any other t, the same coefficient argument multiplies each coefficient by a unit phase and yields the identical summability condition. Thus the differentiability domain is exactly D(h) at every t.

TheoremStatement: AI-adaptedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Finite-regulator Gibbs trace and bounded expectations

Statement

Assume Countable Choice and use the finite-mode data, form domain Q, and self-adjoint h from Self-adjoint unbounded polynomial interaction at fixed regulator. Let λ0≤λ1≤⋯ be its eigenvalues repeated with multiplicity, and let ψk be a corresponding orthonormal eigenbasis. For β>0 define the finite-rank truncations ρβ,Mf:=∑k=0Me−βλk⟨f,ψk⟩ψk. The proof establishes their operator-norm limit ρβ, with action ρβf:=∑k≥0e−βλk⟨f,ψk⟩ψk. Put αj:=ajc and let the oscillator eigenvalues ϵk be the nondecreasing ordering, with multiplicity, of ϵn=∑j=1N(2nj+1)αj,n∈N0N. Then ρβ is positive trace class and its trace Zβ:=Tr⁡(ρβ)=∑k≥0e−βλk satisfies the finite bound 0<Zβ≤eβC0∏j=1Ne−βαj1−e−2βαj<∞. For every bounded linear operator B:HN→HN, the normalized trace expectation is well defined and Zβ−1Tr⁡(ρβB)=Zβ−1∑k≥0e−βλk⟨Bψk,ψk⟩, with absolute convergence. This is a finite-N mathematical trace result; it assumes no statistical data and makes no continuum-limit claim.

Facts & Assumptions

Given: Countable Choice, finite data N,aj,c,C0,V, the form domain Q, and β>0.

[A1]

The Axiom of Countable Choice (ACω): countable eigenbasis choices are permitted.

[F1]

Self-adjoint unbounded polynomial interaction at fixed regulator: h is self-adjoint and has a complete orthonormal eigenbasis with real eigenvalues λk→+∞ and λk≥−C0; for u∈Q its form has the coefficient expansion qh(u)=∑kλk∣⟨u,ψk⟩∣2.

[F2]

Anisotropic Hermite oscillator and quadratic form basis: for the form with potential c∣q∣2, the product Hermite basis has energies ϵn and its form is the coefficient sum ∑nϵn∣⟨u,ψnosc⟩∣2.

[F3]

Finite-lattice polynomial Hamiltonian data and Coercive polynomial form completion and injection: HN is a complex Hilbert space, and the interacting form norm is the completion norm with weight W+1=V+C0+2, controlling the weak derivatives and weighted function.

[F4]

Nuclear series characterizes trace norm: under Countable Choice, a compact bounded operator that is the operator-norm limit of rank-one partial sums ∑k≤M⟨⋅,uk⟩vk with ∑k∥uk∥∥vk∥<∞ is trace class, with trace norm at most that coefficient sum.

[F5]

Trace of a positive operator is the sum of its eigenvalues: for a self-adjoint positive trace-class operator the trace is the sum of its eigenvalues with multiplicity.

[F6]

Riesz representation for Hilbert spaces: every bounded linear functional on a complex Hilbert space is represented by a unique inner-product vector, with representing-vector norm equal to the functional norm.

[F7]

Trace is absolutely convergent and basis independent: a trace-class operator has an absolutely convergent basis trace, equal to the trace computed from any nuclear representation.

[F8]

A bounded linear operator between normed spaces: a bounded linear B satisfies ∥Bx∥≤∥B∥∥x∥.

[F10]

Bounded finite rank operators are compact: every bounded linear operator with finite-dimensional range is compact.

[F11]

Norm limit of compact operators is compact: under Countable Choice, an operator-norm limit of compact operators into a Banach space is compact.

[F12]

Fourier expansion in a Hilbert space: for a complete orthonormal family in HN, Parseval gives ∑k∣⟨f,ψk⟩∣2=∥f∥22.

Proof

technique · direct

Given: N≥1, aj,c>0, V(q)≥c∣q∣2−C0, the interacting form, and β>0.

1.1F2algebra

Each ϵn is finite, and only finitely many multi-indices have ϵn≤M for any real M: for M≥0, that inequality bounds every nonnegative integer nj by M/(2αj), while for M<0 there are none. Fix the explicit degree-then-lexicographic enumeration of N0N. Recursively, among the remaining tuples choose one of least energy, breaking a tie by that fixed enumeration; such a least energy exists because below the energy of the first remaining tuple there are only finitely many candidates. Every tuple is eventually listed, since only finitely many tuples have energy at most its energy. This gives the nondecreasing list (ϵk)k≥0 with multiplicity.

1.2F2F3algebra

On Cc∞, the shifted interacting form has weight V+C0+2≥c∣q∣2+2, so it dominates the shifted oscillator form from [F2]. Therefore a Cauchy sequence in Q is Cauchy in the oscillator form norm; the identity map extends to a continuous map Q→Qosc, with the same L2 representative because both completions inject into HN by [F3]. Subtracting the shifts in the two form norms gives qh(u)=a(u,u)−(C0+2)∥u∥22≥qosc(u)−C0∥u∥22(u∈Q).

2.1A1F1F2step 1.2algebra

Fix k≥0 and let Lk=span⁡{ψ0,…,ψk}. The linear map from Lk to the span of the first k oscillator eigenvectors, sending u to its k oscillator coefficients, has a nonzero kernel because dim⁡Lk=k+1>k. Choose u≠0 in that kernel. Since u lies in the span of the first k+1 interacting eigenvectors, [F1] gives qh(u)≤λk∥u∥22. Its oscillator coefficients at indices below k vanish, so [F2] gives qosc(u)≥ϵk∥u∥22. Step 1.2 now yields λk∥u∥22≥qh(u)≥(ϵk−C0)∥u∥22, hence λk≥ϵk−C0. This argument also covers k=0, when the span of zero oscillator vectors is {0}.

3.1F2step 2.1algebra

By step 2.1 and β>0, ∑k≥0e−βλk≤eβC0∑n∈N0Ne−βϵn=eβC0∏j=1N(∑nj≥0e−β(2nj+1)αj)=eβC0∏j=1Ne−βαj1−e−2βαj. The factorization follows first for finite rectangular sums by distributivity and then by increasing limits of nonnegative sums. Each denominator is positive because 0<e−2βαj<1. The lower bound Zβ>0 follows from its positive ground term.

4.1A1F1F2F4F10F11F12step 3.1algebra

The coefficients satisfy 0<e−βλk≤eβC0 by [F1]. For each f, Parseval makes the finite partial sums in the defining series for ρβf Cauchy in HN, so the series converges; its coefficient formula gives linearity and ∥ρβf∥2≤eβC0∥f∥2. Moreover Parseval gives ∥ρβ−ρβ,M∥≤sup⁡k>Me−βλk⟶0, since λk→+∞ and β>0. Each truncation is finite rank and hence compact by [F10], so the operator-norm limit ρβ is compact by [F11]. The same convergence makes its rank-one partial sums converge in operator norm, and their coefficient sum is ∑ke−βλk=Zβ<∞; thus ρβ is trace class by [F4].

5.1A1F1F4F5F6F7F8F9F10F11F12step 3.1step 4.1algebra∎

Since each e−βλk is real, the Fourier expansion [F12] gives ⟨ρβf,g⟩=∑ke−βλk⟨f,ψk⟩⟨ψk,g⟩=⟨f,ρβg⟩ for all f,g∈HN; the series is absolutely convergent by Cauchy--Schwarz for the coefficient sequences and boundedness of the weights. Thus ρβ is self-adjoint. It is positive because ⟨ρβf,f⟩=∑ke−βλk∣⟨f,ψk⟩∣2≥0. The defining series gives ρβψk=e−βλkψk. If ρβx=μx, taking Fourier coefficients shows (e−βλk−μ)⟨x,ψk⟩=0 for every k. Completeness [F1, F12] then implies that every nonzero eigenspace is exactly the span of basis vectors with the corresponding repeated diagonal value; since every diagonal value is positive, 0 is not an eigenvalue. Thus the eigenvalues with multiplicity are precisely (e−βλk), and [F5] gives Tr⁡(ρβ)=Zβ. For bounded B, each ρβ,MB is finite rank and hence compact by [F10], while ∥ρβ,MB−ρβB∥≤∥ρβ,M−ρβ∥ ∥B∥→0 by step 4.1. Therefore ρβB is compact by [F11]. The functional x↦⟨Bx,ψk⟩ is linear and has norm at most ∥B∥ by [F9] and [F8]. By [F6] it is represented by a vector wk with ∥wk∥≤∥B∥ and ⟨Bx,ψk⟩=⟨x,wk⟩. Hence ρβBx=∑k⟨x,wk⟩e−βλkψk. The partial sums converge in operator norm: the norm of the tail after M is at most ∥B∥∑k>Me−βλk→0 by step 3.1. This nuclear representation has coefficient sum at most ∥B∥Zβ. Since ρβB is compact as shown above, [F4] gives that it is trace class. Its basis trace in (ψk) is absolutely convergent and equals the trace by [F7]. The kth diagonal entry is ⟨ρβBψk,ψk⟩=e−βλk⟨Bψk,ψk⟩, so this basis sum is the asserted numerator. Each term is bounded in modulus by e−βλk∥B∥ by [F8] and [F9], giving the stated absolute bound. Division by Zβ>0 proves the expectation formula.

LemmaStatement: AI-adaptedProof: AI-adaptedverified 2026-10-15 (gpt-6-luna, gpt-6.1-sol, and delegated Codex review/repair agents; see completed run evidence)Open item page →

Ground eigenvalue as the form variational infimum

Statement

Assume Countable Choice and use Q, qh, and the operator h from Self-adjoint unbounded polynomial interaction at fixed regulator. Let λ1 be the least eigenvalue of h. Then inf⁡{qh(u):u∈Q, ∥u∥2=1}=λ1. The infimum is attained by every normalized vector in the lowest eigenspace; no simplicity or nondegeneracy is assumed.

Facts & Assumptions

Given: Countable Choice, the form domain Q, the form qh, and the complete eigenfamily of h.

[A1]

The Axiom of Countable Choice (ACω): countable eigenbasis choices used in the form realization are permitted.

[F1]

Self-adjoint unbounded polynomial interaction at fixed regulator: the eigenvalues λn are real, ordered increasingly with multiplicity, have a least value λ1, and for u∈Q, qh(u)=∑n≥1λn∣⟨u,ψn⟩∣2.

[F2]

Fourier expansion in a Hilbert space: ∑n∣⟨u,ψn⟩∣2=∥u∥22.

Proof

technique · direct

Given: u∈Q and the ordered real eigenvalue list.

1.1A1F1F2algebra

Since λn≥λ1 for every n, [A1], [F1] and [F2] imply qh(u)−λ1∥u∥22=∑n(λn−λ1)∣⟨u,ψn⟩∣2≥0. Thus every unit vector in Q has form value at least λ1.

2.1F1F2step 1.1algebra∎

A normalized eigenvector ψ1 belongs to D(h)⊆Q by Self-adjoint unbounded polynomial interaction at fixed regulator, has norm one, and its sole nonzero coefficient is at an eigenvalue λ1. Therefore qh(ψ1)=λ1, so the lower bound is attained and equals the infimum. If the lowest eigenspace has dimension greater than one, the same coefficient calculation applies to every normalized vector in it.

5 · Examples, experiments and counterexamples

None yet.

Sources