Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedverified 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.

Boost-translation loop phase

Example

Assume AC and Countable Choice. For z∈C, write ez:=exp⁡z:=∑k=0∞zk/k! for the complex exponential, whose series converges for every z. Let dx be Lebesgue measure on Rd. Let d be a positive integer, let m>0 and ℏ>0, and take a,v∈Rd. Put θ=mv⋅a/ℏ and let T(a)f(x)=f(x−a) and Bm(v)f(x)=eimv⋅x/ℏf(x) on L2(Rd,dx;C). Their loop Bm(v)T(a)Bm(v)∗T(a)∗ equals eiθI, so a common scalar phase leaves squared overlap unchanged on an isolated component. In the explicitly defined two-arm path model below, applying the loop to exactly one arm gives recombination squared overlap cos⁡2(θ/2), while applying the same scalar to both arms gives squared overlap 1.

Facts & Assumptions

Given: A positive integer d, real parameters m>0, ℏ>0, vectors a,v∈Rd, and the translation and modulation operators of the mathematical model.

[A1]

Assume AC and Countable Choice, as required by the supplier theorem. The Axiom of Choice The Axiom of Countable Choice (ACω)

[F1]

The unitary families T(a) and Bm(v) satisfy Bm(v)T(a)Bm(v)∗T(a)∗=eimv⋅a/ℏI. Mass cocycle for translations and boosts

[F2]

The scalar complex exponential is the everywhere-convergent power series exp⁡z=∑k=0∞zk/k!, also written ez. The complex exponential by its power series

[F4]

For real x,y, exp⁡(x+iy)=ex(cos⁡y+isin⁡y) and ∣exp⁡(x+iy)∣=ex. exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0

[F5]

The real exponential is defined by its power series, so e0=1. The real exponential function and the number e by a power series

[F6]

For every real x, cos⁡(−x)=cos⁡x and sin⁡(−x)=−sin⁡x. Pythagorean and parity identities for all six trigonometric functions on their natural domains

Verification

1.1givenA1F1

Put θ=mv⋅a/ℏ. The loop identity in [F1] gives the scalar operator eiθI on the system Hilbert space, so it multiplies every vector in an isolated component by the same scalar and leaves squared moduli of inner products unchanged there.

2.1F2F3F4F5F6F7step 1.1algebra∎

Let H=L2(Rd,dx;C). On the path space C2 set ∣0⟩=(1,0)T, ∣1⟩=(0,1)T, and ⟨j∣:=∣j⟩∗. Its orthogonal projectors are ∣0⟩⟨0∣=diag⁡(1,0) and ∣1⟩⟨1∣=diag⁡(0,1), so they are self-adjoint, square to themselves, have zero product and sum to I2. Interpret the finite path-system product as H⊕H with ∣0⟩⊗f=(f,0), ∣1⟩⊗f=(0,f) and squared norm ∥(f,g)∥2=∥f∥2+∥g∥2; completeness follows componentwise from that of H. In this explicit product model define the controlled loop C=∣0⟩⟨0∣⊗L+∣1⟩⟨1∣⊗I, where L=Bm(v)T(a)Bm(v)∗T(a)∗. By step 1.1, C=Uθ⊗I with Uθ=diag⁡(eiθ,1). Equip the path space with inner product u∗w and put u+=(1,1)T/2. The recombining path overlap is u+∗Uθu+=(1+eiθ)/2. The addition law [F3] and Euler formula with parity [F4, F6] give (1+eiθ)/2=eiθ/2(e−iθ/2+eiθ/2)/2=eiθ/2cos⁡(θ/2). By [F4, F5], ∣eiθ/2∣=e0=1, and modulus is multiplicative by [F7], so the squared modulus of this overlap is cos⁡2(θ/2). If the same scalar is applied to both arms, the path gate is eiθI2, whose matrix coefficient has squared modulus 1 by [F4, F5].

Depends on

Dependency tree · 2 levels

Sources