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.
CC realization of the bounded spatial operator on a finite-component H² domain
Statement
Assume Countable Choice (The Axiom of Countable Choice ()). Fix integers , , and a real measurable function with . Put where the vector space, pairing and Sobolev norm are the finite component sums of the scalar conventions of Hilbert space, The space as the quotient by null functions and Integer-order Sobolev spaces and their norms. Use the componentwise Plancherel unitary of Plancherel theorem, with the negative-sign convention of Fourier transform on complex L1 classes. Define Then , and for every , with the distributional Laplacian acting componentwise. The operator is densely defined and self-adjoint on exactly , and . Both and have graph norms equivalent to the stated Sobolev norm, and is a core for both. For with , there is the concrete two-sided inverse with range exactly and .
This realizes the equal-mass bounded spatial operator used at fixed by setting and any finite spin multiplicity ; for an -fold spin- tensor the full multiplicity is . The lemma makes no statement about Coulomb potentials, unequal-mass operators, thermodynamic limits, or physical assignments. It uses no Axiom of Choice or Kato–Rellich theorem.
Facts & Assumptions
Given: CC; as above. Pairings are linear in the first argument.
Under CC, the scalar Plancherel transform is a surjective complex-linear isometry preserving the pairing (Plancherel theorem, Statement). Under CC, equals the weighted Fourier space, with its Sobolev norm equivalent to , and the derivative multiplier is when the weak derivative is in (Integer-order W^{k,2} and H^k agree with equivalent norms, Statement (1),(2), Distributional derivatives are polynomial Fourier multipliers, Statement). Finite component sums preserve these identities and norm equivalences.
For a densely defined operator, the adjoint domain consists of vectors admitting a representing vector in its pairing identity; a symmetric operator is self-adjoint exactly when its adjoint has the same domain and action (Adjoint of a densely defined operator, Symmetric, self-adjoint and essentially self-adjoint operators). A self-adjoint operator is closed.
Under CC, is dense in and in (Compactly supported smooth functions are dense in W^{k,p}(R^n), Statement with and ). The same holds for finitely many components. Dominated convergence holds for the squared cutoff tails (Dominated convergence).
Proof
Given: The data of the statement and [F1]–[F3].
[Concrete multiplier, including the adjoint domain] For any real finite-valued measurable function on , multiplication on is densely defined: belongs to this domain and tends to by dominated convergence. It is symmetric because is real and the pairings are integrable by Cauchy–Schwarz. If with representing vector , every supported on belongs to the multiplier domain and satisfies on that set. The vector lies in , so testing with that vector proves a.e. on . Increasing the integer covers the space up to null sets, proving and . Conversely the symmetry identity gives every vector of in the adjoint domain with adjoint value . Thus is self-adjoint on the exact maximal domain, including for the weight . This proof is valid for the finite vector-valued space by its component-sum pairing; it makes no arbitrary family of choices.
[Fourier transfer, exact H² and normalization] Apply the componentwise unitary from [F1] to step 1.1 with . For a vector in the adjoint domain of , changing variables in its representing functional gives with the corresponding adjoint value; the converse follows from symmetry. Hence is self-adjoint on . Since with , is bounded above and below by positive multiples of . For , therefore holds exactly when , which is by [F1]. Moreover is equivalent to by the triangle inequality and nonnegativity of , and hence to . This proves graph-norm equivalence. The weak-derivative multiplier in [F1] gives , proving the exact differential action for all . Finally , with integrability by Cauchy–Schwarz.
[Explicit perturbed inverses on the fixed domain] Multiplication by is bounded and self-adjoint on , with norm at most , since is real and essentially bounded. Thus is symmetric on the dense and is closed there: if and , boundedness gives , and closedness of gives with . For , the concrete multiplier is bounded by and . Therefore maps into and satisfies both inverse equations of , with range exactly . On the correctly ordered factorization is . Since , the geometric series in the statement is the inverse of the first factor: finite-sum multiplication leaves a remainder tending to zero in norm. The bounded operator space is complete, because an operator-norm Cauchy sequence has a bounded pointwise limit on the complete target and the same uniform Cauchy estimate gives operator-norm convergence. Thus exists, maps into , and its two ordered inverse equations follow from the factorization. Surjectivity of this range onto follows from the second inverse equation. Its norm is at most .
[Self-adjointness without an AC perturbation theorem] Let . By step 3.1, is onto; solve with its explicit inverse, so . Symmetry implies , whence . For a densely defined operator with first-linear pairing, this kernel is , directly from the adjoint identity. The other inverse from step 3.1 makes that range all of , so . Since by symmetry, the adjoint domains and actions are equal, proving self-adjointness on exactly . Also for every , proving the claimed lower bound. Only the two explicit imaginary resolvents were used.
[Graph norms, cores and scope] For , boundedness of gives and . Thus the graph norms of and are equivalent, and step 2.1 identifies both with the Sobolev norm. The finite-component smooth density from [F3] therefore makes graph dense in the exact domain of each operator, which is precisely the core claim. Steps 1.1–4.1 supply the self-adjointness, exact differential action, lower bound and explicit inverses. All primitive suppliers used here assume CC; neither an AC multiplier theorem nor Kato–Rellich nor any assertion concerning a singular potential or an arbitrary spin basis was invoked.
Depends on
The Axiom of Countable Choice ()
Hilbert space
The space as the quotient by null functions
Integer-order Sobolev spaces and their norms
Adjoint of a densely defined operator
Symmetric, self-adjoint and essentially self-adjoint operators
Fourier transform on complex L1 classes
Plancherel theorem
Integer-order W^{k,2} and H^k agree with equivalent norms
Distributional derivatives are polynomial Fourier multipliers
Compactly supported smooth functions are dense in W^{k,p}(R^n)
Dominated convergence