Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-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.

Profile-to-Hilbert bootstrap interface

Definition

Let H=L2([0,1],B,λ;R) be the real Hilbert space of almost-everywhere classes of square-integrable real profiles, with ⟨u,v⟩H=∫01u(ξ)v(ξ) dξ, where B is generated by intervals with rational endpoints and λ is Lebesgue measure restricted to B. Let (Ω,F,P) and (S,S,ν) be probability spaces, let (δt)t∈Z be independent identically distributed measurable S-valued random elements on Ω with law ν, and let f:SN0→H be measurable from the product sigma-algebra S⊗N0 to the Borel sigma-algebra of H. The associated causal profile process is Xt=f(δt,δt−1,…). Assume X0 is Bochner integrable and has Bochner mean EBX0:=∫ΩX0(ω) dP(ω)=0, with E∥X0∥H2<∞. Assume Countable Choice and Dependent Choice and take an independent product extension carrying the countable replacement-innovation family.

For every t∈Z, m≥1, and k≤t−m, let δt,m,k′ have law ν, with all these copies mutually independent and independent of the original innovations. Set

Xt,m=f(δt,…,δt−m+1,δt,m,t−m′,δt,m,t−m−1′,…),δm=(E∥X0−X0,m∥H2)1/2.

The profile process is L2-m-approximable when ∑m=1∞δm<∞. For data X1,…,Xn∈H, n≥1, and an integer block length 1≤b≤n, moving-block resampling independently draws starts uniformly from {1,…,n−b+1}, concatenates the corresponding ordered length-b blocks, and truncates the last block to obtain exactly n resampled elements X1∗,…,Xn∗. Define Xˉn∗=n−1∑j=1nXj∗, and let E∗ denote expectation over these draws with the observations fixed. For any bounded real-linear functional L:H→R, let ∥L∥=sup⁡∥u∥H≤1∣L(u)∣; the centered resampled scalar profile summary is n L(Xˉn∗−E∗Xˉn∗). This definition specifies the data space and resampling law; it does not assert asymptotic validity.

Remarks

When a measured or simulated profile q(z) on a physical segment z∈(a,a+ℓ) is represented in H, use X(ξ)=ℓ q(a+ℓξ), so ∫aa+ℓ∣q(z)∣2 dz=∫01∣X(ξ)∣2 dξ. If z has units of length and q has units Q, then X has units Qlength, since ξ is dimensionless. Any physical scalar sensor must be transformed with the profile and carry its corresponding units. Resolution, instrument averaging, shared calibration error, and finite-data uncertainty are not removed by this mathematical representation.

Depends on

Dependency tree · 2 levels

Sources