Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck pendingverified 2026-10-23 (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.

One weighted sensor for one constant velocity mode

Physical scope

Symbolic one-mode calculation inside the adopted finite-modal, linear-Gaussian fluid observation model, with one ideal weighted spatial velocity sensor. The datum is a model variable, not a reported measurement; no claim about an actual flow or instrument is made.

Example

Assume the Axiom of Choice (AC), meaning every family of nonempty sets has a choice function, for the finite Gaussian-law construction in the adopted model. Let D⊂R3 be bounded and Lebesgue measurable in SI spatial coordinates, with volume V=∣D∣>0 measured in m3, and let e∈R3 be a fixed unit vector. Define the dimensionless constant modal field ϕ:D→R3 and the sensor weight ψ:D→R3 by ϕ(x)=e and ψ(x)=e/V for x∈D; the weight has units m−3. Define the ideal weighted spatial sensor Sψ:L2(D;R3)→R by Sψ(v):=∫Dv(x)⋅ψ(x) d3x. Then ϕ,ψ∈L2(D;R3) and Sψ(ϕ)=1, a dimensionless response. Let the scalar modal coefficient have prior law a0∼N(μ,P), where N(μ,P) denotes the scalar Gaussian law with mean μ and variance P, including P=0, with μ in m s−1 and P≥0 in (m s−1)2. Set the dimensionless transition F1=1, zero process covariance Q1=0 in (m s−1)2, and zero process noise q1=0 in m s−1, so a1=F1a0+q1=a0. Take observation noise r1∼N(0,R) with R>0 in (m s−1)2, independent of a0 and q1. The represented velocity is U1(x)=a1e for x∈D and the single observation is y1=a1+r1 in m s−1. The exact one-step filter outputs m1∣1=μ+PP+R(y1−μ),P1∣1=PRP+R. This is a symbolic model calculation, including the deterministic-prior case P=0; it records no measured fluid data.

Facts & Assumptions

Given: A finite-volume region D of volume V>0, a unit vector e, the one-mode field ϕ(x)=e and sensor weight ψ(x)=e/V for x∈D, prior a0∼N(μ,P) with P≥0, transition F1=1 with q1=0, and independent observation noise r1∼N(0,R) with R>0.

[A1]

Assume AC, meaning every family of nonempty sets has a choice function, for the Gaussian-law construction. The Axiom of Choice

[F1]

A weighted sensor on L2(D;R3) is the integral Sψ(v)=∫Dv⋅ψ d3x, and it is not a point evaluation. Finite-second-moment random velocity sensor law

[F2]

The sensor pairing is finite, representative-independent, and linear for all v,ψ∈L2(D;R3). The L2 velocity sensor is well-defined

[F3]

The adopted model defines the observation matrix entry as H1,11=Sψ(ϕ); the example chooses F1=1 and q1=0. Finite-modal fluid observation and noise model

[F4]

Under these hypotheses and positive-definite innovation, the exact conditional field law is the pushforward of the coefficient Kalman law. Exact conditional law for the finite-modal fluid filter

[F5]

The fixed Cartesian inertial chart uses SI time and spatial units; fluid velocity has units m s−1. Classical frames, primitive quantities and SI units

Verification

Given: The hypotheses and notation in the Example.

1.1F1F2F3F5givenalgebra

Since ∣e∣=1, ∥ϕ∥L22=∫D∣e∣2 d3x=V<∞ and ∥ψ∥L22=∫D∣e/V∣2 d3x=1/V<∞. Linearity of the sensor integral gives Sψ(ϕ)=∫De⋅(e/V) d3x=V/V=1, so the scalar observation matrix is H1=1.

2.1F3givenstep 1.1algebra

The chosen state transition and process noise give forecast mean m1∣0=μ and variance P1∣0=P. Thus the innovation covariance is S1=H1P1∣0H1T+R=P+R>0, the gain is K1=P/(P+R), and the covariance update is P1∣1=P−P2P+R=PRP+R. Substituting v1=y1−μ into the mean update gives the displayed m1∣1. These formulas hold at P=0 as well because R>0.

3.1A1F4step 2.1given∎

Apply [F4] to the same one-step model: the conditional field law is the pushforward of N(m1∣1,P1∣1) under a↦ae. Therefore the symbolic update in the Example is the exact conditional law within this finite model, not an empirical claim about a measured flow.

Depends on

Dependency tree · 2 levels

Sources