Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generated
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.

A common factor can reverse an unreduced root classification

Example

Let ϵ be centered white noise with variance σ2>0 and put Xt=ϵt. Its canonical ARMA representation is the reduced pair (ϕ,θ)=(1,1), which is causal. Multiplying both sides of this equation by 1−2B gives the same process the unreduced equation with pair (1−2z,1−2z). That pair has a common root at z=1/2; applying the root criterion before cancelling it would falsely classify the process as noncausal.

Facts & Assumptions

Given: A centered real white-noise sequence ϵ with variance σ2>0 and the process Xt=ϵt.

[F1]

Linear processes, white noise, and ARMA models: an ARMA equation is ϕ(B)(Xt−μ)=θ(B)ϵt with normalized polynomials; the canonical representation requires common factors to be cancelled.

[F2]

ARMA causality and invertibility root criteria: for a normalized coprime pair, causality is equivalent to absence of zeros of ϕ in ∣z∣≤1.

Verification

1.1F1givenalgebra

Both polynomials 1−2z have constant term one and the common factor 1−2z has root z=1/2, so the unreduced pair is not coprime. Cancelling it leaves (ϕ,θ)=(1,1), whose AR polynomial has no root.

2.1F1F2givenstep 1.1algebra

With Xt=ϵt, the reduced equation Xt=ϵt holds and has the causal representation ψ0=1, ψj=0 for j≥1. By [F2] the reduced pair is causal. Multiplying both sides by the same finite filter 1−2B gives (1−2B)Xt=(1−2B)ϵt, so the unreduced pair also displays the same process.

3.1F1F2step 1.1step 2.1∎

The unreduced ϕ has a zero in ∣z∣≤1, but [F2] applies only after common-factor cancellation. Thus this raw root is not a valid classification of the process and explains the normalization clause.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources