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.

Frame change of a declared protocol: how the prediction map and an additive error transform between two inertial frames

Physical scope

A worked conditional computation of the frame behaviour of one declared protocol: a protocol whose readout is the position of one label at one observation time is described in a second inertial frame, and the prediction map and the additive error are transformed by the displayed affine law. The item asserts no measured position, no measured error and no frame-independent reading; it records that the prediction map and the error model are frame-relative data of a protocol.

Example

Fix one particle label (N=1), the force branch and a model as in Operational observable model of the force branch: parameters, preparations, observation times, readout, units and additive error, and fix two inertial frames F, F′ of the model with adapted coordinates (t,x) and (t′,x′). By Galilean transformation of worldlines: velocity and acceleration laws, frame-independence of zero coordinate acceleration, and the group of frame changes there are b∈R, a0,v∈R3 and R∈SO(3) with t′(p)=t(p)+b,x′(p)=R x(p)+v t(p)+a0for every event p.

The protocol in F. Take a protocol of Operational observable model of the force branch: parameters, preparations, observation times, readout, units and additive error with a single observation time t1∈I0 and the position readout Φ(θ,z):=xθ,z(t1)∈R3 of dimension ℓ, read in metres (Dimensions and SI unit conventions of the non-relativistic classical mechanics framework); the observation is Y=Φ(θ,z)+ε for an error random element ε:Ω→R3 on a probability space (Ω,F,P).

Domains under the coordinate change. The transformed configuration set at time t′ is Qt′′:=RQ+v(t′−b)+a0, so the transformed time-configuration domain {(t′,x′):t′∈I0+b, x′∈Qt′′} is open (it is the image of I0×Q under the invertible affine frame change). It need not be a product with one fixed configuration set, for example when a boost translates bounded Q. The following formulas always describe the coordinates of the same worldline and recorded events. They define a force-branch protocol in F′ only when the transformed model has an admissible fixed-domain presentation, in particular when Q=R3; no fixed-domain model is asserted in the general moving-domain case.

The coordinate readout in F′. The same event at which the readout is taken has F′-time t1+b; reading the same label position in F′ at that time defines the transformed prediction map on the same parameter/preparation labels, Φ′(θ,z):=xθ,z′(t1+b)=R Φ(θ,z)+v t1+a0, and the F′-coordinates of the recorded point are Y′:=R Y+v t1+a0=Φ′(θ,z)+R ε, so the additive-error form is preserved with the rotated error ε′:=Rε and the transformed open error domain V′:=RV, which contains 0 and contains every value of ε′.

Transform of the error law. Suppose ε is square-integrable with mean E[ε]=0 and covariance matrix Σ in the sense of Mean vector and covariance matrix of a square-integrable random vector. Then ε′=Rε has mean 0 and covariance Cov⁡(ε′)=R Σ RT, and ∣ε′∣=∣ε∣ in the Euclidean norm because R is orthogonal. In particular an additive error declared in one frame need not have the same law in another: its law is the pushforward under R, which equals the original law precisely when that law is invariant under this rotation, and the prediction map acquires the known affine term v t1+a0. A protocol must declare the frame of its readout and of its error model.

Facts & Assumptions

Given: Two inertial frames F, F′ with the transformation of Galilean transformation of worldlines: velocity and acceleration laws, frame-independence of zero coordinate acceleration, and the group of frame changes, a protocol with the single position readout Φ(θ,z)=xθ,z(t1), and a square-integrable error ε with mean 0 and covariance Σ.

[L1]

The transformation law between the two frames is t′(p)=t(p)+b and x′(p)=Rx(p)+vt(p)+a0 for every event p, with b∈R, a0,v∈R3 and R∈SO(3); the parameters have dimensions [b]=τ, [a0,j]=ℓ, [vj]=ℓτ−1 and R is dimensionless (Galilean transformation of worldlines: velocity and acceleration laws, frame-independence of zero coordinate acceleration, and the group of frame changes, Inertial frames, stationary observers and the adopted Galilean transformations between frames, Dimensions and SI unit conventions of the non-relativistic classical mechanics framework).

[L2]

A continuous map preimage of a Borel set is Borel, and composing a random element with a Borel map gives a random element: for the continuous affine map α(y):=Ry+vt1+a0 one has α−1(B) Borel for Borel B, and (α∘ε)−1(B)=ε−1(α−1(B)) (A measurable function between measurable spaces, A continuous map has Borel preimages of Borel sets, Random elements and real random variables).

[L3]

For a square-integrable random vector X with mean μ and covariance Σ and a linear map A, the affine map T(x)=h(μ)+A(x−μ) applied to X has covariance AΣAT (The covariance of the linearization is AΣAT, Mean vector and covariance matrix of a square-integrable random vector); expectations of integrable components are linear and the components of a linear image are finite linear combinations of integrable components (Linearity, monotonicity, and the modulus bound for expectation).

Verification

technique · direct transformation of the worldline and of the recorded point by the cited frame-change law, followed by the linear propagation of the error mean and covariance
1.1givenL1algebra

The worldline of the label described in F′ satisfies xθ,z′(t′)=R xθ,z(t′−b)+v(t′−b)+a0 for t′∈Jθ,z+b by [L1] applied to the events of the worldline; the readout event in F has F-time t1, hence F′-time t1+b, and evaluating at t′=t1+b gives Φ′(θ,z)=R xθ,z(t1)+v t1+a0=R Φ(θ,z)+v t1+a0.

1.2givenL3algebra

Square-integrability of ε and the hypothesis E[ε]=0 give E[εj]=0 for every j, and the components of Rε are finite linear combinations of the integrable components εj, so E[Rε]=R E[ε]=0 by linearity of expectation of the components [L3]; for the covariance, [L3] applied to X=ε, μ=0 and the affine map y↦Ry (whose derivative is R at every point) gives Cov⁡(Rε)=R Σ RT, and orthogonality of R gives ∣Ru∣=∣u∣ for every u, hence equality of the norms of ε′ and ε pointwise.

2.1givenstep 1.1L2

The recorded point has F′-coordinates Y′=R Y+v t1+a0 by the same transformation law applied to the observed event, and substituting Y=Φ+ε together with step 1.1 gives Y′=Φ′+Rε; the rotated error ε′:=Rε is a random element of R3 by [L2], since y↦Ry is linear and continuous and addition of the constant vector vt1+a0 is a translation.

3.1step 1.1step 2.1step 1.2given∎

The computation is a transformation of declared protocol data; it asserts nothing about which frame an apparatus realizes, no measured position and no measured error, and it shows that the prediction map and the error model of Operational observable model of the force branch: parameters, preparations, observation times, readout, units and additive error are frame-relative and that a change of frame applies to both, with the affine shift v t1+a0 and the rotation of the error.

Depends on

Dependency tree · 2 levels

Sources