Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck pass
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.

Position-bin probabilities of a Gaussian packet

Physical scope

A finite model computation of position-bin probabilities in the spinless massive-particle model: for a normalized Gaussian packet in the first coordinate and an arbitrary normalized transverse factor, the probability that the first position coordinate lies in a Borel bin is the Gaussian integral over that bin, and the probability of an exact value is zero while every bin of positive length gets positive probability with the stated elementary bounds. The item is conditional on the model's postulates, uses no measured data and asserts no apparatus behaviour.

Example

Work in the spinless massive-particle model of P5, that is H=L2(R3;C) with position operators Qj (Kinematics and massive-particle model postulate P5: Newtonian frames and one-particle operators, Position and momentum operators on Euclidean L2), fix a width σ>0 in metres, and let ψσ(t):=(2πσ2)−1/4e−t2/(4σ2)(t∈R), the Gaussian packet of width σ. Let φ∈L2(R2;C) satisfy ∫R2∣φ∣2=1 and put ψ(x):=ψσ(x1) φ(x2,x3)(x∈R3), so that ψ∈H is a unit vector and the preparation [ψ] is a state of the model. Then:

(i) The probability that the first coordinate Q1 lies in a Borel set B⊆R is μψQ1(B)=∫B∣ψσ(t)∣2 dt=12πσ2∫Be−t2/(2σ2) dt, independently of the transverse factor φ; the law has density ∣ψσ∣2 and μψQ1(R)=1.

(ii) For every λ∈R the probability of the exact value λ is zero, μψQ1({λ})=0, while for every a<b the bin (a,b] has positive probability with the explicit bounds b−a2πσ2exp⁡(−max⁡{∣a∣,∣b∣}22σ2)≤μψQ1((a,b])≤b−a2πσ2. In particular these bounds hold when 0≤a<b. In the symmetric case a=−δ, b=δ with δ>0, the probability satisfies 2πe ≤ μψQ1((−σ,σ]) ≤ 2π,0 < μψQ1((−δ,δ]) ≤ 2δ2πσ2. In particular a single recorded event localized in a bin of positive length is possible in the model, while an event at an exact coordinate value has probability zero.

(iii) For each j∈{1,2,3} the same formulas hold for Qj in the unit product preparation ψ(j)(x):=ψσ(xj)φ(x⊥), where x⊥ lists the other two coordinates in increasing index order. For the original preparation ψ=ψ(1), the laws of Q2 and Q3 are the marginals of ∣φ∣2 and need not be Gaussian. The width and bin endpoints are model parameters read in metres.

The computation is the framework's own outcome law applied to an explicit state; it records no measurement, no apparatus response and no empirical data.

Facts & Assumptions

Given: The spinless massive-particle model of P5 with H=L2(R3;C) and position operators Qj (Kinematics and massive-particle model postulate P5: Newtonian frames and one-particle operators, Position and momentum operators on Euclidean L2); the outcome-law reading of Assigned sharp observables and the outcome law of the framework; a width σ>0; a unit vector φ∈L2(R2;C); the Gaussian packet ψσ and state ψ=ψσ⊗φ; a bin (a,b]⊆R; the Axiom of Countable Choice and the Axiom of Choice (The Axiom of Countable Choice (ACω), The Axiom of Choice).

[F1]

Gaussian integrals. ∫Re−u2du=π (The Gaussian integral ∫−∞∞e−x2 dx=π); for c>0 the C1 substitution u=t/2c gives ∫Re−t2/(2c)dt=2πc.

[F2]

Position law of the model. For the spinless massive model and a unit vector ψ, the law of Qj is μψQj(B)=∫xj−1(B)∣ψ(x)∣2dx, with density fj(t)=∫R2∣ψ(x⊥,t)∣2dx⊥ and μψQj({λ})=0 for every λ (Position and momentum outcome laws and the Born density of the massive particle model clauses (b) and (d)).

[F3]

Iterated integrals and monotonicity. For product-measurable nonnegative functions on σ-finite spaces the integral may be iterated (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product); for nonnegative measurable f≤g one has ∫f≤∫g and ∫Af≤∫Bf for A⊆B, directly from the supremum definition of the nonnegative integral (The nonnegative Lebesgue integral, Integral over a measurable subset); and t↦e−t2/(2σ2) is continuous, hence Borel measurable (Continuous functions on Euclidean spaces are Borel measurable).

[F4]

The product state is a unit vector. ψ=ψσ⊗φ is the almost-everywhere product of an L2 function of x1 and an L2 function of (x2,x3), hence lies in L2(R3;C) (The space Lp(μ) as the quotient by null functions,); Tonelli [F3] and the normalizations of ψσ and φ give ∥ψ∥2=1, and ∣ψ∣2 is the product ∣ψσ(x1)∣2∣φ(x2,x3)∣2 because the modulus of a product is the product of the moduli (Conjugation is an involutive real-field automorphism, zz‾=∣z∣2, and modulus is definite, multiplicative, and subadditive).

[F5]

States. The pure preparation of the unit vector ψ is the state Tψ,ψ of the model, and the outcome law is read as in Assigned sharp observables and the outcome law of the framework clause (b).

Verification

technique · direct; normalize the Gaussian packet and compute the position-bin probabilities, their bounds and the exact-value probability
1.1givenF1F3F4F5algebra

[Normalization of the Gaussian packet] With c=σ2 in [F1], ∫Re−t2/(2σ2)dt=2πσ2. Therefore ∫R∣ψσ(t)∣2dt=(2πσ2)−1/22πσ2=1, since ∣ψσ(t)∣2=(2πσ2)−1/2e−t2/(2σ2) by [F4]; consequently ∫R3∣ψ∣2dx=(∫R∣ψσ∣2)(∫R2∣φ∣2)=1 by Tonelli [F3], so ψ is a unit vector and [ψ] is a pure preparation of the model by [F5].

2.1givenstep 1.1F2F3F4algebra

[The position law and its density] By [F2] the law of Q1 in the preparation [ψ] is μψQ1(B)=∫x1−1(B)∣ψ∣2dx; writing the integrand as ∣ψσ(x1)∣2∣φ(x2,x3)∣2 by [F4] and iterating the integral by Tonelli [F3], ∫x1−1(B)∣ψ∣2dx=(∫B∣ψσ(t)∣2dt)(∫R2∣φ∣2)=∫B∣ψσ(t)∣2dt, which is clause (i) with density f1(t)=∣ψσ(t)∣2.

3.1givenstep 1.1step 2.1F1F2F3algebra∎

[Exact values and bin bounds] By [F2] (the atomless clause of the position law) μψQ1({λ})=0 for every λ, so no exact coordinate value carries probability. For any finite a<b, put M:=max⁡{∣a∣,∣b∣}. Every t∈[a,b] satisfies ∣t∣≤M, and therefore 12πσ2e−M2/(2σ2)≤∣ψσ(t)∣2≤12πσ2. Integrating these inequalities over (a,b] and using the position law in [F2] and monotonicity [F3] gives the two displayed bounds. Their lower bound is strictly positive because a<b and σ>0, so every bin of positive length receives positive probability, including bins crossing the origin and bins with negative endpoints. For the symmetric bin (−σ,σ], the substitution u=t/σ in step 2.1 gives μψQ1((−σ,σ])=12π∫−11e−u2/2du, and since e−1/2≤e−u2/2≤1 on [−1,1], monotonicity [F3] yields 2/(πe)≤μψQ1((−σ,σ])≤2/π. Permuting the selected coordinate in the product state repeats steps 1.1 and 2.1 with xj in place of x1, proving (iii); the other two marginals of the original state come from ∣φ∣2 by [F2] and Tonelli [F3]. The final upper bound for (−δ,δ] is the general upper estimate with a=−δ, b=δ; its lower estimate is positive for every δ>0.

Remarks

  • The transverse factor φ enters the computation only through its total mass ∫∣φ∣2=1; the first-coordinate law of a product state is independent of the transverse profile, while a state that is not a product can correlate the coordinates and change the marginal, as the general density formula fj(t)=∫R2∣ψ(x⊥,t)∣2dx⊥ of Position and momentum outcome laws and the Born density of the massive particle model shows.
  • The bounds are deliberately elementary: they neither sharpen the Gaussian integral nor claim an error analysis. They are finite checks of the model's law, not measured frequencies, and no apparatus resolution, binning procedure or count is asserted.

Depends on

Dependency tree · 2 levels

Sources