Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

The smooth transverse domain is a core for photon rotation generators

Statement

Assume the Axiom of Choice and ℏ>0. Let HTν, D, U(R), and the self-adjoint rotation generators Ja be as defined in Transverse one-photon space and helicity projectors and Transverse rotations preserve helicity and generate total angular momentum. For every unit axis a∈S2, D is a core for Ja: it is contained in D(Ja) and is dense in that domain for the graph norm

∥f∥Ja=(∥f∥HTν2+∥Jaf∥HTν2)1/2.

In particular, D is a common core for the three Cartesian rotation generators.

Facts & Assumptions

Given: The Axiom of Choice, ℏ>0, the punctured momentum space M, the mass-shell measure dν=d3k/(2∣k∣), the transverse Hilbert space, and the unitary rotation action.

[A1]

Assume the Axiom of Choice. The Axiom of Choice

[F1]

Choice implies Countable Choice, so the Hilbert, density, and Fourier suppliers' Countable Choice hypotheses are available. AC implies DC implies countable choice The Axiom of Countable Choice (ACω)

[F2]

The transverse space is the closed subspace of L2(M,dν;C3) satisfying k⋅f(k)=0 almost everywhere, and D consists of smooth compactly supported transverse fields on M. Transverse one-photon space and helicity projectors

[F3]

The action is U(R)f(k)=Rf(R−1k), and t↦U(Ra(t)) is a strongly continuous unitary group with Stone generator Ja under the convention U(Ra(t))=e−itJa/ℏ. Its differential expression on D is Ja=La+ℏSa. Transverse rotations preserve helicity and generate total angular momentum

[F4]

Put Ω=(0,∞)×R, with coordinates (ρ,z), and T=R/(2πZ) with normalized angular measure dϕ/(2π). Use the angular chart 0<ϕ<2π. The omitted z-axis and positive-x branch-cut half-plane are contained in coordinate hyperplanes and are ν-null by [F8]. On the remaining open set the cylindrical map (ρ,ϕ,z)↦(ρcos⁡ϕ,ρsin⁡ϕ,z) is a C1 diffeomorphism with Jacobian ρ. The Euclidean Borel change-of-variables lemma gives dν=(ρ/(2ρ2+z2)) dρ dϕ dz for every nonnegative Borel integrand. Fubini reorders this as dμΩ dϕ/(2π), where dμΩ=(πρ/ρ2+z2) dρ dz. Borel change of variables from the compact-support formula and Radon uniqueness Fubini's theorem for L^1 functions on a sigma-finite product

[F5]

The functions eimϕ, m∈Z, form an orthonormal basis of L2(T,dϕ/(2π)) and obey Parseval's identity. Componentwise use and Fubini give the same Fourier isometry for C3-valued functions on Ω×T. The Fourier basis and Parseval's identity on the finite torus Fubini's theorem for L^1 functions on a sigma-finite product

[F6]

Cc∞(R2;C) is dense in L2(R2); on each compact subset of Ω, the weight w(ρ,z)=πρ/ρ2+z2 is smooth and bounded above and below by positive constants. Compactly supported smooth functions are dense in W^{k,p}(R^n)

[F7]

The standard smooth step σ0 is smooth, takes values in [0,1], vanishes on (−∞,0], and equals 1 on [1,∞). It supplies the cutoffs χn(ρ,z)=σ0(nρ−1)σ0(n−ρ)σ0(n−z)σ0(n+z) used below. The standard smooth step function

[F8]

The z-axis is contained in the coordinate hyperplane {kx=0}, and the positive-x branch cut {ky=0, kx≥0} is contained in {ky=0}; both hyperplanes are Lebesgue null under Countable Choice. On each annulus 1/m≤∣k∣≤m, the density 1/(2∣k∣) is bounded, so the punctured axis and branch cut are also ν-null. A box with a degenerate side is Lebesgue null, and so is every coordinate hyperplane in Rn Transverse one-photon space and helicity projectors

[F9]

Dominated convergence applies to the L2 tails after cutoff, and Fatou applies to the squared Fourier difference quotients. Dominated convergence Fatou's lemma

[F10]

The Stone generator domain is exactly the vectors for which the group difference quotient converges in norm, and its derivative at zero is −iJa/ℏ. Stone's theorem: unitary groups and self-adjoint generators

[F11]

Under Countable Choice, every Lebesgue measurable subset of R3 differs from a Borel set by a subset of a Borel null set; equivalently, Lebesgue measure is the completion of its Borel restriction. L(Rn) is exactly the completion of the restriction of λn to the Borel sets

Proof

Given: [A1], [F1]–[F11], the space HTν, the domain D, and the generators in the Statement.

1.1A1F1F2F3F4F8F11givenconstruct

It suffices first to consider the axis e3. The z-axis and the positive-x branch cut, with the origin removed, are ν-null by [F8]: on each annulus 1/m≤∣k∣≤m, the mass-shell density is bounded and both sets lie in Lebesgue-null coordinate hyperplanes. To apply the Borel change-of-variables formula [F4] to an arbitrary f∈HTν, take a finite-valued representative and apply [F11] to the Lebesgue-measurable sublevel sets of each of its six real components at rational levels. Countable Choice lets us select the corresponding Borel sets; their symmetric differences lie in a countable union of Borel null sets. Outside that union, each component equals the infimum of the rational levels whose selected Borel sets contain k; defining each infimum to be 0 on the union gives Borel real-valued representatives, hence a Borel vector representative f0=f almost everywhere. Since dν=(2∣k∣)−1dλ3 has strictly positive finite density on M, Lebesgue-null and ν-null sets there coincide. Thus f0 represents the same Hilbert-space class, and [F4] applies to its coordinate pullback; the same formula shows the pullback is independent of the representative. Use the cylindrical coordinates of [F4], put r=ρ2+z2 and n0(ρ,z)=(ρ,0,z)/r, and define g(ρ,z,ϕ)=Re3(−ϕ)f0(ρcos⁡ϕ,ρsin⁡ϕ,z). The rotation matrices preserve the Hermitian norm, so the measure identity and its inverse coordinate map f0(k)=Re3(ϕ)g(ρ,z,ϕ) make this a unitary identification with the subspace of L2(Ω×T,w dρ dz dϕ/(2π);C3) satisfying n0(ρ,z)⋅g(ρ,z,ϕ)=0. Direct substitution gives U(Re3(t))g(ρ,z,ϕ)=g(ρ,z,ϕ−t).

2.1F3F5F9F10step 1.1givenalgebra

Write gm(ρ,z)=∫Tg(ρ,z,ϕ)e−imϕ dϕ/(2π). By [F5], Parseval identifies the squared norm with ∑m∥gm∥L2(Ω,w)2, and the rotation difference quotient has Fourier coefficients (e−imt−1)gm/t. If ∑mm2∥gm∥2<∞, then ∣(e−imt−1)/t∣≤∣m∣ and dominated convergence in the square-summable coefficient space gives convergence to (−imgm)m. Conversely, if the difference quotients converge in norm, their mth coefficients converge to −imgm; Fatou applied to finite partial sums and then their increasing limit gives ∑mm2∥gm∥2<∞. By [F10], this is exactly D(Je3); the generator acts as Je3=−iℏ∂ϕ in the rotating coordinates, and the squared graph norm is ∑m∈Z(1+ℏ2m2)∥gm∥L2(Ω,w)2.

3.1F3F5F7F9step 2.1construct

Let g represent any vector in D(Je3). For n≥2 use the explicit cutoffs χn from [F7]. They lie in Cc∞(Ω), satisfy 0≤χn≤1, and converge pointwise to 1. Since χn depends only on (ρ,z), it commutes with the ϕ-derivative. Dominated convergence [F9] therefore gives χng→g in the graph norm of [F3]. Its Fourier truncations g(N)=∑∣m∣≤Nχngmeimϕ converge in that graph norm by the weighted Parseval sum in step 2.1.

4.1F2F3F4F6F7step 3.1construct

Fix n,N and put ηn=χ2n; [F7] makes ηn=1 on the support of χn and gives compact support inside Ω. Each of the finitely many coefficients χngm is supported in supp⁡χn and lies in n0⊥. Extend it by zero to R2. On the compact support of ηn, the weight in [F4] is bounded above and below by positive constants, so [F6] gives a smooth compactly supported approximation am0 in the weighted norm. Replace it by am=ηnP(n0)am0. Because P(n0)χngm=χngm and ∥P∥≤1, this is transverse and does not increase the approximation error. Choose the finitely many coefficient errors so that ∑∣m∣≤N(1+ℏ2m2)∥am−χngm∥2 is arbitrarily small. Then ∑∣m∣≤Nam(ρ,z)eimϕ is smooth, transverse, and compactly supported away from ρ=0; after applying Re3(ϕ) and returning to k coordinates it is an element of D, since both factors are 2π-periodic and their derivatives match across the angular seam. Combining these finite coefficient approximations with the cutoff and Fourier truncation from step 3.1 gives graph convergence to g, so D is a core for Je3.

5.1F3step 4.1givenalgebra∎

For any unit a, choose R∈SO(3) with Re3=a. The rotation representation gives U(R)U(Re3(t))U(R)∗=U(Ra(t)); Stone uniqueness then gives Ja=U(R)Je3U(R)∗ with the conjugated domain. Also U(R)D=D, because rotations preserve smoothness, compact support away from zero, and transversality. Applying the unitary U(R) to the graph-dense approximation in step 4.1 proves that D is a core for Ja.

Remarks

The proof uses the rotating vector frame only to identify the one-parameter rotation generator with angular differentiation. The domain statement is then established by Fourier coefficients and a graph-norm approximation; it does not infer an operator core property from ordinary L2 density alone.

Depends on

Dependency tree · 2 levels

Sources