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.
Polyhedral selective inference
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Confidence Sets and Inversion
- 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
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Density Separability and Convolution in Lᵖ
- 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
- Estimators and Randomized Procedures
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Gaussian Orthogonal Decomposition and Quadratic Forms
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- 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
- Modes of Convergence Egorov and Lusin
- 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
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Reeb Stability and Global Foliation Constructions
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- Tests, Neyman–Pearson and Valid P-values
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- 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
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Summary
Objective
Condition on one fixed finite polyhedral selection event in a known-variance Gaussian location model. Decompose a fixed nonzero contrast from its orthogonal residual, derive the interval imposed on the contrast by the selection inequalities, and prove that the conditional truncated-normal CDF is uniform. Invert this pivot for a single contrast's exact selective test and confidence set.
The results are finite-sample and require the stated Gaussian model, known positive variance, fixed contrast and selection inequalities, and positive selection probability. They do not establish model adequacy, unknown-variance validity, nonlinear-selection validity, or simultaneous guarantees for a data-selected family. The central-limit and weak-convergence page requirements remain in the plan, but no asymptotic claim is made here.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Polyhedral selection event and contrast interval
Definition
Fix integers and , a matrix , a vector , and a fixed nonzero vector . Inequalities between vectors are coordinatewise. Define the projection matrix and contrast direction The matrix is the orthogonal projection onto (The orthogonal projection is the -component in ). For a vector , put Then and .
For row of , written , define Let , , and . Define Define to hold exactly when for every . The selection event is . The interval associated with is if fails or , and is otherwise. The next lemma proves that this interval describes precisely the fiber of along the contrast direction.
Remarks
The empty-row case gives , , and true. Infinite endpoints mean that the corresponding side is not truncated.
The standard normal CDF is continuous and strictly increasing
Statement
Assume the Axiom of Choice. Let for . Then is continuous and strictly increasing on , with and .
Facts & Assumptions
Given: The Axiom of Choice and the standard normal law.
The Axiom of Choice is assumed in the current definition of the standard normal law. The Axiom of Choice
The standard normal law has density and total mass one. Standard normal and normal laws
The real exponential function is smooth, so the displayed normal density is continuous. The exponential function is smooth and
A continuous real-valued function on a nonempty compact subset of attains finite maximum and minimum values. Extreme value theorem: a continuous real function on a nonempty compact subset of attains a greatest and a least value
Measures are continuous along increasing sequences of measurable sets. Continuity from below for measures
A measure finite on one set of a decreasing sequence is continuous along that sequence. Continuity from above when one set has finite measure
Proof
The density in [F1] is positive and continuous by [F2]. Fix . By [F3], attains a minimum on ; since is positive at every point, . The density formula and additivity over give , so is strictly increasing.
Fix . By [F3], is bounded by some finite on the compact interval . If , then by integrating the density over the interval between and . Letting proves continuity at , and was arbitrary.
The sets increase to , so [F4] and the total mass in [F1] give . The sets decrease to the empty set and have finite measure, so [F5] gives . Monotonicity from step 1.1 then gives the two stated limits at infinity.
Exact selective confidence set for a parameter functional
Definition
Let be a statistical experiment (Statistical experiments) and let be a parameter functional. For , a set-valued procedure is a selective confidence set with coverage at least if, for every , its membership section belongs to and It is exact if equality holds for every . Here the laws are the laws after conditioning on the specified selection event. When , the pullback is a confidence-set procedure as in Confidence sets and coverage, with the same membership sections and coverage at each . When , the stated coverage and exactness requirements are vacuous. No measurable structure on or is imposed.
Polyhedral selective normal pivot
Definition
Assume AC. In the setup of Polyhedral selection event and contrast interval, let , where is known (Multivariate normal law, including singular covariance). Put , , and let be the standard normal CDF from Standard normal and normal laws. Extend it by and . For a candidate contrast value , define When holds, , and , define For a total statistic on , set when or when the denominator is zero; on the remaining part of , set . The value assigned on zero-normalizer fibers is only a measurable extension; when , the conditional law given selection gives those fibers probability zero.
A polyhedral event restricts the contrast to a computable interval
Statement
In the setup of Polyhedral selection event and contrast interval, for every , The functions are Borel measurable as extended-real-valued functions, and the set of pairs satisfying the right-hand side is Borel.
Facts & Assumptions
Given: Finite , fixed , and the notation of the definition.
The contrast decomposition is with . Polyhedral selection event and contrast interval
Each row has coefficient and offset ; the sign of determines its upper, lower, or zero-row feasibility condition in the definitions of . Polyhedral selection event and contrast interval
Proof
Since and , we have .
For each row , the inequality becomes . If , division gives ; if , division reverses the inequality and gives ; if , the row is feasible exactly when . Intersecting the finitely many row conditions is therefore equivalent to , , and , with the empty-index conventions in [F2].
Each is affine and hence continuous. The finite maximum defining and finite minimum defining are Borel, with the constant infinite values in the empty-index cases; is a finite intersection of closed half-spaces. Thus the fiber set is Borel. The rowwise equivalence in step 2.1 proves both implications, including zero coefficients and empty or degenerate intervals.
A Gaussian contrast is independent of its orthogonal residual
Statement
Assume AC. Let with known , and fix . With , , and as in Polyhedral selection event and contrast interval, the scalar and vector are independent, and
Facts & Assumptions
Given: AC, , , and .
The Axiom of Choice is assumed by the multivariate normal law and the Gaussian orthogonal-projection theorem. The Axiom of Choice
A multivariate normal law has every linear projection normal with mean and variance , and can be realized as for independent standard normal coordinates in . Multivariate normal law, including singular covariance
For a standard Gaussian vector and an orthogonal projection , the vectors and are independent. Orthogonal projections split a standard Gaussian into independent chi-square sums
Measurable coordinatewise functions of independent random elements remain independent. Measurable coordinatewise functions preserve independence
have the definitions and domains stated in the local setup. Polyhedral selection event and contrast interval
Proof
Put . Since , and . For every , belongs to , and , so . Thus is the rank-one orthogonal projection onto in [F4]. The conclusion concerns only the joint law of , so by [F1] it suffices to use the realization with . Apply [F2] to . This use of AC is exactly [A1].
Because , , while . Thus and are measurable functions of the independent vectors and ; [F3] makes them independent.
By the linear-projection clause of [F1], is normal with mean and variance . AC is inherited from [A1] through the normal-law supplier [F1].
The truncated normal selective pivot is conditionally uniform
Statement
Assume AC and the setup of Polyhedral selective normal pivot, with . For -almost every , the conditional law of given and is the law restricted to and normalized by . Its CDF on that interval is . The pivot is Borel measurable on the selected data space. Consequently is Uniform conditionally on wherever the normalizer is positive, and is also Uniform conditionally on alone. The event is a single fixed polyhedron; no union-of-polyhedra claim is made.
Facts & Assumptions
Given: AC, known , nonzero fixed , fixed , , and .
The Axiom of Choice is inherited from the Gaussian suppliers. The Axiom of Choice
The polyhedron is exactly the feasible contrast interval with the zero-coefficient feasibility condition, and the interval fibers are Borel. A polyhedral event restricts the contrast to a computable interval
and are independent, and . A Gaussian contrast is independent of its orthogonal residual
Independent random elements have their product joint law. Independent random elements have product joint law
For a joint density relative to a product of sigma-finite measures and a supplied probability filler, the section integral is the marginal density; wherever that integral is finite and positive, the normalized section is a regular conditional distribution, and such sections have full marginal probability. Conditional density formula
The standard normal CDF is continuous and strictly increasing with limits zero and one at the extended endpoints. The standard normal CDF is continuous and strictly increasing
A scalar law for is the image of the standard normal by , so its CDF is . Standard normal and normal laws
The functions and the pivot formula are those defined in the two local definition items. Polyhedral selection event and contrast interval Polyhedral selective normal pivot
Proof
Under , and are independent by [F2], so their joint law is the product of their marginal laws by [F3]. Write and let be the marginal law of . Both are probability measures and hence sigma-finite. By [F1] and [F7], the selection event in these coordinates is the Borel set . For every product-measurable set , conditioning the product law on gives . Thus the selected joint law has this product density.
Put . If fails, the fiber is empty and its section integral is zero. If holds, the section is ; by [F5], [F6], and the endpoint convention in [F7], its -probability is , including a singleton interval and infinite endpoints. Thus the section integral of the selected density is . It is finite because on feasible fibers and . Apply [F4] with filler probability : for almost every selected , , so holds, , and ; the conditional law of is . Fibers with zero section integral have zero selected marginal probability, so their arbitrary extension value in the pivot definition is immaterial.
For , [F6] gives . The denominator is positive exactly on the selected fibers under consideration. The finite max/min formulas make Borel, and [F5] with [F7] makes Borel. On the Borel set of for which , , and , the pivot's numerator and reciprocal denominator are Borel, so the ratio is Borel; the definition extends it by zero on the complement.
Fix such a . The conditional density in step 2.1 is positive throughout the interval and has no atoms; [F5] makes its CDF continuous and strictly increasing from zero to one, including when an endpoint is infinite. For any there is a unique in the interval with , so . At the probability is zero and at it is one because the conditional law has a density. Thus the pivot is uniform given .
Integrating the conditional identity in step 4.1 against the selected marginal law of supplied by [F4] gives for every . Hence the pivot is uniform given as well.
Remarks
The probability guarantee is conditional on the fixed selection event under the stated Gaussian sampling law. It does not establish that the Gaussian model is adequate for data, robustness to model misspecification, or simultaneous validity for several contrasts chosen after observing the data.
Exact selective tests and confidence sets from the pivot
Statement
Assume AC and the setup of Polyhedral selective normal pivot, and suppose for at least one . Write . The selected sample space is with trace Borel sigma-algebra , and for let be the conditional sampling law. For , define For the point null , assume . Then is a valid p-value in the conditional experiment and is Uniform under every null law. For every , rejecting when has conditional type-I error exactly . If, in addition, a nonempty alternative is specified, the test has size and hence level .
For , put and This is an exact selective confidence set for the functional in the sense of Exact selective confidence set for a parameter functional: for every with , The guarantee is for one fixed contrast and one fixed selection event, not simultaneous coverage over a selected family.
Facts & Assumptions
Given: AC, a conditional experiment obtained by conditioning on , , and a fixed contrast .
AC is required by the normal-law and Gaussian projection suppliers in the pivot theorem. The Axiom of Choice
For each , the pivot section is Borel measurable and Uniform under . The truncated normal selective pivot is conditionally uniform
A p-value is a measurable -valued statistic whose lower-tail probabilities are bounded by their thresholds under every parameter in the null. Valid p-values
A valid p-value threshold rule is a level- test whenever the null and alternative are nonempty and disjoint. Valid p-values yield level tests for nonempty disjoint alternatives
Test size is the supremum of rejection probabilities on the nonempty null, and level means size at most . Test size and power
In an experiment, a confidence set for a functional is measured by the probability of its measurable membership section under each corresponding sampling law; exact coverage is equality. Exact selective confidence set for a parameter functional
A pivot is a parameter-indexed measurable family with a common sampling law. Pivotal quantities
Inverting a pivot over a measurable acceptance set of probability gives exact confidence coverage . Coverage from pivot inversion and exact calibration
The conditional laws form an experiment on the selected data space whenever . Statistical experiments
Proof
For any in the conditional experiment, [F1] gives under . For , the event is the union of the two tails and , whose uniform probabilities sum to (their intersection has measure zero). Thus, if , is uniform under every null law and is measurable by the pivot formula; [F2] makes it a valid p-value.
If and the alternative is nonempty, [F3] applied to gives conditional size at most . By [F4] size is the supremum of the null rejection probabilities; since every null law has the exact uniform p-value distribution from step 1.1, for every null , so the size is exactly .
By [F1], [F6], and [F8], is a pivot in the conditional experiment. Its full-parameter inversion is . The acceptance interval has uniform probability , so [F7] gives exact coverage for . Its image under is exactly by the definition of . For each fixed true , membership is precisely , which has -probability by [F1]. The membership section is measurable by the Borel pivot formula, so [F5] applies.
5 · Examples, counterexamples and false statements
None yet.