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.
Stationary means and sample autocovariance — Examples
1 · Prerequisites
- Binary Operations, Monoids, Groups and Subgroups
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Infinite Product Measures and Kolmogorov Extension
- limsup, liminf, and Subsequential Limits
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Polynomial Rings, the Division Algorithm and Roots
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Stationary means and sample autocovariance
- Suprema and Infima
- The Lebesgue Integral and the Convergence Theorems
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
2 · Summary
The finite examples separate pairwise uncorrelated data from mutual independence and compare the two sample-ACVF denominator conventions. A three-observation vector gives an exact negative Toeplitz quadratic form for the pair-count-normalized version. No asymptotic or central-limit claim is attached to either calculation.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Pair-count-normalized sample ACVF need not be positive semidefinite
Statement refuted
For every finite real data vector, the pair-count-normalized sample ACVF has nonnegative Toeplitz quadratic forms.
Facts & Assumptions
Given: The pair-count-normalized sample ACVF definition for a finite data vector of length .
For , the pair-count-normalized rescaling divides the centered lag-product sum by and is zero outside that lag range (Autocovariance and sample autocovariance).
Counterexample
Take and data . Its sample mean is , so its centered values are . By [F1], , , and ; negative-lag values equal the corresponding positive-lag values.
In the Toeplitz matrix on indices , the diagonal entries are , the first off-diagonal entries are , and the outer off-diagonal entries are by step 1.1. For , the quadratic form is . A positive-semidefinite Toeplitz form must be nonnegative on every real vector, so this data vector refutes the statement.