Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicable
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 declared recorded detector and sampling model of the two-path arrangement

Physical scope

A declared finite recorded-outcome detector model and a declared sampling model for the two-path arrangement of the pair: bounded measurable recorded weights, their multiplication effects and the completed finite effect family including a no-record channel, the recorded probability reading of the unsharp finite-outcome clause of the observable and probability postulate P2, the conditioned recorded law, and the assumption of finitely many independent and identically distributed trials with a declared fringe criterion. The item asserts no detector realization, no calibration, no measured counts and no statistical-inference conclusion; the recorded-event probabilities are read from the declared effects, and the identification of a concrete apparatus with these effects and of its repetitions with the sampling model is a tested identification with uncertainty under the preparation and apparatus postulate P7.

Definition

Adopt the declared two-path preparation model of The declared two-path preparation model and its ideal detection bins, the unsharp finite-outcome clause (iv) of the observable and probability postulate P2, and the preparation and apparatus discipline P7 (Observable and probability postulate P2: self-adjoint observables, spectral probability and finite unsharp outcomes, Preparation and apparatus postulate P7: declared preparations, isolation and sampling assumptions). Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). The following vocabulary is used by this page.

(a) Declared recorded detector. A declared recorded detector of the arrangement is a finite set A of recorded outcome labels with 0∉A, together with measurable recorded weights wa:R3→[0,1] for a∈A such that ∑a∈Awa(x)≤1 for almost every x∈R3. The effect of the label a is the multiplication operator Fa:=Mwa,(Mwψ)(x):=w(x)ψ(x)a.e., on Hs=L2(R3;Cr), and the no-record effect is F0:=I−∑a∈AFa. The multiplier is a well-defined linear map on almost-everywhere classes, since changing a representative on a null set changes its product only on that null set. Each Fa is bounded: for ψ∈Hs, ∥Mwaψ∥2=∫R3wa(x)2∥ψ(x)∥Cr2dx≤∥ψ∥2, so the boundedness inequality holds with bound C=1 by monotonicity of the nonnegative integral (Monotonicity and nonnegative homogeneity of the nonnegative integral). Thus Fa is a bounded linear operator (A bounded linear operator between normed spaces). Because wa is real, the componentwise pairing gives ⟨Mwaψ,ϕ⟩=⟨ψ,Mwaϕ⟩ for all ψ,ϕ∈Hs; hence Fa is self-adjoint by The Hilbert-space adjoint of a bounded operator. At almost every x, the finite-dimensional operator wa(x)ICr is nonnegative in the sense of Non-negative and positive operators, and therefore 0≤⟨Faψ,ψ⟩=∫R3wa(x)∥ψ(x)∥Cr2dx≤∥ψ∥2. Here 0≤Fa≤I means these quadratic-form inequalities for every ψ∈Hs.

Define w0(x):=max⁡{0,1−∑a∈Awa(x)}. This is measurable, 0≤w0≤1, and it equals 1−∑awa almost everywhere by the admissibility condition. Thus F0=Mw0=I−∑aFa on Hs, and the same argument gives 0≤F0≤I and self-adjointness. Consequently ∑a∈AFa+F0=I, so the completed family is a finite family of bounded effects of clause (iv) of P2 (Observable and probability postulate P2: self-adjoint observables, spectral probability and finite unsharp outcomes).

(b) Recorded probabilities. For a preparation ρ∈D(Hs) the recorded probability of a label a∈A and the no-record probability are ν(a):=tr⁡(ρFa),ν(0):=tr⁡(ρF0)=1−∑a∈Aν(a), the outcome reading of clause (iv) of P2 for the declared effects (Assigned sharp observables and the outcome law of the framework clause (f) records the reading; the numbers are nonnegative and sum to one). The recorded-event mass is ν(A):=∑a∈Aν(a)=1−ν(0)∈[0,1]. A detector is full-efficiency when ∑awa=1 almost everywhere, so that F0=0 and ν(0)=0 for every preparation. For a fixed preparation ρ, the model loses events when ν(0)>0, and the no-record channel carries this lost mass. A detector that is not full-efficiency can nevertheless have ν(0)=0 for a particular preparation. A declared recorded bin B is the special case with one label a and wa=1B; then Fa=G(B) is the position projection of clause (e) of The declared two-path preparation model and its ideal detection bins, with the position set B read in the metre unit of Dimensions, SI unit conventions and quantity types of the framework, and the recorded probability is the ideal bin probability.

(c) Loss conditioning. When ν(A)>0, the conditioned recorded law is νˉ(a):=ν(a)ν(A)(a∈A). It is a probability measure on the finite set A (Probability measures and probability spaces); it is the law of the recorded label under the declared model conditioned on the occurrence of a record. Conditioning is a statistical operation on the recorded data; it is not a state update, and no claim of P3 is made here.

(d) Sampling model. A declared N-trial sampling model for a fixed preparation ρ is a probability space (Ω,F,P) carrying measurable maps O1,…,ON:(Ω,F)→(A∪{0},P(A∪{0})) (N≥1), where 0 is the no-record label of clause (b) and is distinct from every recorded label because 0∉A. The maps are mutually independent in the sense of Pairwise and mutual independence of finite-valued random variables and identically distributed with P(Ok=a)=ν(a) for every a∈A, P(Ok=0)=ν(0) and every k, where ν is the recorded law of clause (b); the numbers ν(a) and ν(0) sum to one, so this is a probability law on the finite set A∪{0}. The empirical frequency of the label a in the sample is FN(a):=1N#{k:Ok=a}. A declared fringe criterion for sample size N is a subset C⊆(A∪{0})N; the model accepts the sample when (O1,…,ON)∈C and fails the criterion otherwise. The identification of repetitions of a concrete procedure with the independent identically distributed model is an additional statistical assumption in the sense of clause (ii) of P7; it is not a consequence of P1-P6, and correlated trials, drifting preparation, dead time and selection must be modeled or recorded as limitations if present (Preparation and apparatus postulate P7: declared preparations, isolation and sampling assumptions).

(e) Status. Clauses (a)-(d) fix the recorded-detector and sampling vocabulary of the pair and read clause (iv) of P2 and clauses (i)-(iii) of P7. The recorded weights, the label set, the conditioning convention and the sampling model are declared apparatus and procedure inputs. The claim "this apparatus realizes the effect family Fa" and the claim "its repetitions are independent and identically distributed draws of ν" are physical identifications with uncertainty under P7(iii) and P7(ii), can fail, and are not derived here. No calibration, efficiency, background or resolution value is asserted, no counts are recorded, and no statistical-inference conclusion is drawn by this definition.

Remarks

  • Relations between the detector families. The ideal detector of clause (e) of The declared two-path preparation model and its ideal detection bins is the full-efficiency case wa=1Ba of a declared recorded detector whose labels partition the bin family; a general recorded detector with non-indicator weights represents finite resolution, response and efficiency through its weights, and its no-record channel represents lost events.
  • No state update is declared. The item declares outcome probabilities only. Which post-measurement state, if any, a registration leaves behind is a separate instrument-model question and is not part of this page.

Depends on

Dependency tree · 2 levels

Sources