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 pair-count lattice sample covariance need not be positive definite
Statement refuted
For every finite scalar lattice sample, whenever the pair-count estimator from Lagged lattice covariance and variogram estimators is defined at all pairwise lags in a finite set of sites, the matrix of estimated lagged covariances on those sites is positive semidefinite.
Facts & Assumptions
Given: A finite scalar data vector on and the estimator from Lagged lattice covariance and variogram estimators.
Lagged lattice covariance and variogram estimators: for available lag , is the pair-count average of minus the squared global sample mean.
Positive definite functions on an abelian group: every finite quadratic form of a positive-definite covariance function must be nonnegative.
Counterexample
Take the data on . Its mean is . By [F1], the lag-zero estimator is and the lag-two estimate, based on the single pair , is The negative-lag estimate equals because the reverse pair has the same product.
At the two sites and , all pairwise lag estimates are defined and the estimated covariance matrix is Its quadratic form at equals . This contradicts the necessary nonnegative quadratic-form condition [F2], so the stated universal claim is false.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
12 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.