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.
Cm Math Evidence — Examples
1 · Prerequisites
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Cm Math Evidence
- Compactness
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability Spaces and Random Variables
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Independence Borel Cantelli and Zero One Laws
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Mixed Partials, Taylor Formulae, and Extrema
- Monotone Functions, Discontinuities, and Continuity Sets
- 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
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Sequences and Limits
- Sigma Algebras and Borel Sets
- Simple Field Extensions and the Construction of the Complex Numbers
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Inverse Function Theorem Completed
- The Lebesgue Integral and the Convergence Theorems
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Laws and Series of Independent Random Variables
2 · Summary
Worked finite verifications of the measurement, propagation and inference definitions of cm-math-evidence. The two propagation computations are symbolic and quantitative: Symbolic two-input propagation of a period–length model differentiates the formal two-input model and expands into , and supplies an explicit Hessian bound on a box, mean and mean-square remainder bounds and the scalar variance correction, asserting no measured period, length or uncertainty; Exact variance against propagated variance for a nonlinear observation map compares the propagated value with the exact variance for on a three-point weighted set, exhibiting equality in both remainder bounds. Finite check of the IID sample-mean variance and Chebyshev bound enumerates two independent Rademacher variables, verifying and the Chebyshev bound at (attained) and (strict), and Equality and strictness in the uniform second-order remainder bound shows the second-order remainder bound can be an equality for a quadratic and strict for a cubic.
Two counterexamples mark the boundaries of the same results. The propagated covariance is not the exact covariance of a nonlinear observation map shows that under the full and Hessian-bound hypotheses the propagated value still differs from the exact variance of , so the hypotheses control the remainder rather than forcing equality, and Coverage level is not the posterior probability of the realized confidence set refutes the posterior reading of a confidence level: a confidence set of level can, for an explicitly declared finite prior and a datum consistent with a single parameter value, have conditional probability of containing the parameter. Every computation on this page is finite or symbolic; none reports a measurement.
3 · Logical flowchart
4 · Definitions, postulates, theorems and proofs
None yet.
5 · Examples, experiments and counterexamples
Symbolic two-input propagation of a period–length model
Example
Consider the model function where represents a duration and a length in an adopted unit convention; the definition here is purely formal and no physical model, period, length or measurement is asserted. The set is open and convex in , and is there. Fix a nominal input with , and let be a square-integrable random vector with Then the linearization of at has slope and the propagated covariance of the linearization is the matrix This is a symbolic computation in a declared model; it neither supplies values for nor asserts that any apparatus realizes the model. A physical reading in which is a period and a length, and in which a pendulum protocol with a small-angle model is used to estimate a gravitational parameter, belongs to a separate physical item that states the protocol, the small-angle idealization and its remaining error; no such reading is made here.
Explicit bounded nonlinearity correction. In addition suppose takes values in the open convex box , where and . The coordinates are fixed numerical coordinates (no addition of physical durations and lengths is intended). Write , , and Then on . For , and the propagated variance computed above,
The box makes . This correction is mathematical; physical small-angle and apparatus discrepancies are additional inputs of a physical consumer.
Facts & Assumptions
Given: The function on the open convex set , a nominal input , and a square-integrable random vector with mean and covariance matrix as displayed.
If is Borel measurable and totally differentiable at and is square-integrable with mean and covariance matrix , then the linearization has mean and covariance matrix . (The covariance of the linearization is )
The covariance matrix of a square-integrable random vector is with , and . (Mean vector and covariance matrix of a square-integrable random vector)
The partial derivatives of are and on , by the derivative of a power and the algebra of derivatives. (For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term, Sums, scalar multiples, products and quotients: , , , and when , The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case)
The Jacobian matrix of a totally differentiable map is the matrix of its total derivative in the standard bases, and matrix multiplication in the and case gives the displayed quadratic form. (The total (Fréchet) derivative as the linear first-order approximation with remainder, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case, The Euclidean inner product on )
On an open convex domain with , the Taylor remainder has ; its mean and mean-square obey the stated bounds, and its variance differs from the linearized variance by at most when . (A uniform Hessian bound controls the second-order Taylor remainder, Mean, mean-square and covariance bounds for second-order linearization error)
The matrix action and operator norm are those of A uniform Hessian bound controls the second-order Taylor remainder. For a matrix and vector , applying Euclidean Cauchy–Schwarz to each row gives , so its operator norm is at most the square root of the sum of squared entries. (The Hessian matrix and critical points of a scalar field, Cauchy–Schwarz: , with equality exactly for dependent pairs)
If is continuous, it has Borel preimages of Borel sets; if every first partial derivative exists on a neighbourhood of and is continuous at , then is totally differentiable there with Jacobian derivative. The convention is continuity of the iterated coordinate derivatives through order . (A continuous map has Borel preimages of Borel sets, If all partial derivatives exist on a neighbourhood and are continuous at a point, then the map is totally differentiable there with Jacobian derivative, Euclidean maps and diffeomorphisms)
Define and for integers . For each , any iterated partial with derivatives in and no derivative is ; with one derivative in any position it is ; with at least two derivatives it is zero. These formulas follow by repeated differentiation of powers and the product rule and are continuous on , so is under the convention of [L7]. (For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term, Sums, scalar multiples, products and quotients: , , , and when , Euclidean maps and diffeomorphisms)
Verification
The formula is continuous on , and its first partial derivatives in [L3] are continuous there. Thus is Borel measurable by [L7], and [L7] gives total differentiability at with Jacobian matrix ; its entries agree with the partial derivatives of [L3] by [L4].
Differentiating [L3] once more gives , and , hence the displayed Hessian by [L6]. On , and ; the sum of squared entries is at most , so [L6] gives . The formulas of [L8] verify continuity of every iterated partial derivative on , as asserted in the Example.
By [L1] and [L2] the propagated covariance is the single entry with , , , and :
Under the additional box hypothesis, pointwise, so . The box is open and convex and contains and all values of , so [L5] with step 1.2 gives the pointwise, mean, mean-square and scalar covariance-error bounds displayed in the Example.
The three coefficients computed in step 2.1 are exactly those displayed in the Example: , and .
Steps 2.1 and 3.1 establish the exact propagated covariance of the linearization for the initial square-integrable model; steps 1.2 and 2.2 establish its explicit Hessian correction under the additional box hypothesis.
Exact variance against propagated variance for a nonlinear observation map
Example
Let carry the weights , , let and let on the open convex set , which contains the three values of . Then is with constant Hessian and operator norm , the mean is , and The linearization has variance so the propagated variance is not the exact variance of . The linearization error satisfies so both displayed bounds of Mean, mean-square and covariance bounds for second-order linearization error are attained in this example. The example contains no measured quantity and asserts no physical model.
Facts & Assumptions
Given: The finite weighted set and the random variable displayed in the Example; the function on .
The finite probability space determines a probability measure on with , and expectations of finite-valued random variables computed by the finite weighted sum agree with their expectations as random variables on that probability space. (Finite probability spaces are exactly finite full-power-set probability spaces, Expectation of a real random variable on a finite probability space, Finite probability spaces, outcome weights, events, and event probabilities)
If is on the open convex set , on , takes values in with and , then the linearization error satisfies , and when the fourth moment is finite. (Mean, mean-square and covariance bounds for second-order linearization error)
For a square-integrable random variable with mean , the covariance matrix of the one-dimensional random vector is the matrix , and the linearization has covariance matrix . (Mean vector and covariance matrix of a square-integrable random vector, The covariance of the linearization is )
The derivative of is , and variance is for square-integrable . (For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term, Moments, variance, and covariance on a probability space)
Verification
By [L1] the weights make a probability space and the expectations below are the finite weighted sums of Expectation of a real random variable on a finite probability space: and .
The function is on the open convex set , with , so and ; its Hessian is the constant matrix , of operator norm by [L3] and [L4], and the values of and the mean all lie in .
By [L4], and .
The linearization error is .
By [L3] the propagated covariance is , while step 2.1 gives ; these differ, so the propagated covariance is not the exact variance of in this model.
With and the moments of step 1.1, the bounds of [L2] read and ; since by step 2.2, one has and , so both bounds are attained.
Finite check of the IID sample-mean variance and Chebyshev bound
Example
Let be the uniform finite probability space with four outcomes of weight , and let Then is an IID family with and ; the sample mean takes the values with probabilities respectively. The exact second moment and the Chebyshev bound computed directly below read so the bound is attained at , while is strict. This is a finite check inside the stated model; it evaluates no measurement and estimates no physical quantity.
Facts & Assumptions
Given: The uniform finite probability space on and the coordinate maps of the Example.
On a finite probability space, expectations are the finite weighted sums of Expectation of a real random variable on a finite probability space, and the finite model agrees with the probability measure , whose expectations coincide with those integral expectations. (Finite probability spaces are exactly finite full-power-set probability spaces, Finite probability spaces, outcome weights, events, and event probabilities)
A finite family of finite-valued random variables is mutually independent exactly when for every nonempty and every choice of values; it is identically distributed when the individual distributions agree. (Pairwise and mutual independence of finite-valued random variables, Identical distribution and IID families)
Verification
The four outcomes have weight each, so and the same for ; for every pair one has . By [L4] the family is independent, the two distributions agree, and , by [L3].
Enumerating on the four outcomes gives the values , each with weight ; hence
By the enumeration in step 1.2 and the expectation formula [L3], and . For any , the pointwise inequality and summation with nonnegative weights give .
At the bound of step 2.1 is , equal to the exact probability from step 1.2; at it is , strictly larger than the exact probability . These establish the displayed finite-sample identity and bounds without requiring an infinite IID extension.
Equality and strictness in the uniform second-order remainder bound
Example
Two explicit one-variable cases of A uniform Hessian bound controls the second-order Taylor remainder.
A quadratic on an interval. Let on the open convex set and fix . Then is with constant Hessian , so for every and is the sharp constant. For every , so the inequality of the lemma is an equality for every .
A cubic on an interval. Let on the open convex set and fix . Then is with Hessian , and on , so is an admissible constant. At , so the bound holds strictly at this point. Both computations are formal and assert nothing beyond the stated intervals.
Facts & Assumptions
Given: The functions on and on with the points indicated.
If is open and convex, is , and on , then for all . (A uniform Hessian bound controls the second-order Taylor remainder)
The derivatives of and are and , and the Hessian of a one-variable function is the matrix of its second derivative. (For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term, The Hessian matrix and critical points of a scalar field, The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case)
For a matrix the operator norm is . (The operator norm is zero on the zero domain and otherwise is max_{||v||=1} ||Tv||)
The intervals and are open and convex subsets of . (A convex subset of contains every line segment between two of its points)
Verification
On the second derivative of is the constant , so and by [L2] and [L3]; is open and convex by [L4].
On the second derivative of is , so and for ; is open and convex by [L4].
For with and , the difference in the Example equals by expansion, and the bound of [L1] is , so equality holds for every .
For with and , the difference at is , while the bound of [L1] is , and .
Step 2.1 exhibits equality in the bound, and step 2.2 exhibits strict inequality, so both alternatives occur under the lemma's hypotheses.
Coverage level is not the posterior probability of the realized confidence set
Statement refuted
Statement refuted: "if is a confidence set of level for a family and is any probability distribution on for which the conditional law of given the datum exists, then the conditional probability that given equals " (Confidence sets and their coverage level).
Facts & Assumptions
Given: The parameter set , the data space with the full power-set sigma-algebra, and, for each , the four-point set .
For each , is a probability measure on , where is the full power set, a sigma-algebra. (Measures on sigma-algebras, Probability measures and probability spaces, Sigma-algebras)
A confidence set is a map with each measurable, its coverage at is , and its level is when the infimum of the coverages is at least . (Confidence sets and their coverage level)
On a finite probability space with , the conditional probability of given is ; a finite weighted set determines such a probability measure and finite weighted sums give its probabilities. (Conditional probability for , Finite probability spaces, outcome weights, events, and event probabilities, Finite probability spaces are exactly finite full-power-set probability spaces)
Counterexample
By [L1] each determines a probability measure on with for and otherwise. Define Each is a subset of , and each set is a subset of and therefore an element of the full power set , so is a confidence set by [L2].
For fixed the four points of evaluate under as follows: gives , which contains ; gives , which is empty for and equals for ; in every case it does not contain ; and the two points with distinct coordinates, and , both give . Hence for every , and the coverage level of is by [L2].
Let . Since has distinct coordinates, step 1.1 gives . Moreover, holds exactly for , so equals for and for .
Fix weights summing to with , and put , a twelve-element set, and give weight . These nonnegative weights sum to , so [L3] defines a probability measure on the finite space . In events below, and denote the two coordinate maps on . The event has -probability , so the conditional probability given is defined by [L3].
The event equals , because by step 2.2; its -probability is , the same as by step 2.2. Hence
The confidence set has level by step 2.1, while for the prior and the datum the conditional probability that is by step 4.1; since , the refuted statement is false.
Remarks
The parameter is treated as random only through the explicitly specified weights ; the computation uses the finite weighted model and the conditional-probability identity of [L3]. The witness shows that the coverage level carries no data-conditional posterior content: the data can be consistent with exactly one parameter value while the level remains .
The propagated covariance is not the exact covariance of a nonlinear observation map
Statement refuted
Statement refuted: "if is open and convex, is , is square-integrable with , and is its covariance matrix, then , that is, ."
This is an unsupported nonlinear extension of The covariance of the linearization is , which states the covariance formula for the affine linearization and does not assert equality with .
Facts & Assumptions
Given: The finite weighted set with , ; the random variable with , , ; and the function on the open convex set .
On a finite probability space, expectations are the finite weighted sums of Expectation of a real random variable on a finite probability space, and the finite model determines the probability measure whose integral expectations agree with those sums. (Finite probability spaces, outcome weights, events, and event probabilities, Finite probability spaces are exactly finite full-power-set probability spaces)
For a square-integrable random variable with mean , the covariance of the linearization is whenever is differentiable at ; the derivative of is ; and . (The covariance of the linearization is , Mean vector and covariance matrix of a square-integrable random vector, For a natural the function is differentiable everywhere with derivative ; for it is the constant , with derivative ; for a natural the function is differentiable at every with derivative ; consequently every polynomial function is differentiable at every real, with the derivative computed term by term, Moments, variance, and covariance on a probability space)
If is on open convex , on , takes values in with and finite second moment, then the linearization error satisfies and when the fourth moment is finite. (Mean, mean-square and covariance bounds for second-order linearization error)
Counterexample
By [L1] the finite weighted set is a probability space and the expectations below are its finite weighted sums: , , and hence by [L2].
The function is on , with , so and the propagated variance is .
The exact moments of are and , so .
Steps 2.1 and 2.2 give propagated value and exact variance ; these are unequal, so the refuted identity fails under the stated hypotheses.
The comparison does not contradict [L3]: on the second derivative of is , of absolute value at most , so is admissible, and the linearization error satisfies at , giving and , both bounds of [L3] holding strictly.
The hypotheses of the refuted statement hold, the propagated covariance differs from the exact variance , and the remainder bounds of [L3] remain satisfied; hence the propagated covariance controls the actual covariance only through those bounds.
Remarks
This witness is a genuine failure of equality, not of the domination bounds of Mean, mean-square and covariance bounds for second-order linearization error: the bounds hold strictly here. A consumer that reports the propagated covariance as an uncertainty of must carry the remainder qualification with it.
Sources
- JCGM 100:2008, Evaluation of measurement data — Guide to the expression of uncertainty in measurement (BIPM), clauses 5.1.2 and 5.2.2, equations (10) and (13), on first-order uncertainty propagation with correlated inputs
- JCGM 100:2008, Evaluation of measurement data — Guide to the expression of uncertainty in measurement (BIPM), clause 5.1.2, note to equation (10), on higher-order terms when the nonlinearity of the model function is significant
- Rick Durrett, Probability: Theory and Examples, 5th ed., Section 2.2.1 (the variance of a sum of independent variables and the Chebyshev bound for the i.i.d. sample mean)
- K. Bryan, Taylor's Theorem in One and Several Variables (Rose-Hulman MA 433 lecture notes), the second-order case in n dimensions (equation (8)) and the Hessian matrix form 1/2 (x-a)^T H(b) (x-a)
- L. Wasserman, All of Statistics: A Concise Course in Statistical Inference (Springer, 2004), Example 6.14 (after Berger and Wolpert, 1984) and the warning in Section 6.3.2; full text copy at the cited URL
- S. Greenland, S. J. Senn, K. J. Rothman, J. B. Carlin, C. Poole, S. N. Goodman and D. G. Altman, 'Statistical tests, P values, confidence intervals, and power: a guide to misinterpretations', European Journal of Epidemiology 31 (2016), 337–350
- JCGM 100:2008, Evaluation of measurement data — Guide to the expression of uncertainty in measurement (BIPM), clause 5.1.2, note to equation (10), on the first-order character of the propagated variance
- L. Wasserman, All of Statistics: A Concise Course in Statistical Inference (Springer, 2004), Section 5.5 on the delta method as an approximation; full text copy at the cited URL