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.
Dimension is detected by avoiding linear subspaces
Statement
For a closed subset and integer , if and only if some projective linear subspace of dimension is disjoint from .
Work over a fixed algebraically closed field , with the Axiom of Choice. Classical varieties are separated and admit finite affine covers; they may be reducible or empty unless irreducibility is specified. Irreducible means nonempty. All fibres and points below are classical closed-point fibres and points.
Facts & Assumptions
Given: The objects and hypotheses in the statement.
Let be irreducible of dimension . If is homogeneous of positive degree and does not vanish identically on , then is nonempty and every irreducible component has dimension . Work over a fixed algebraically closed field , with the Axiom of Choice. Classical varieties are separated and admit finite affine covers; they may be reducible or empty unless irreducibility is specified. Irreducible means nonempty. All fibres and points below are classical closed-point fibres and points. (Nontrivial projective hypersurface sections).
Let be irreducible closed subvarieties. Every nonempty irreducible component of satisfies . If , then . Work over a fixed algebraically closed field , with the Axiom of Choice. Classical varieties are separated and admit finite affine covers; they may be reducible or empty unless irreducibility is specified. Irreducible means nonempty. All fibres and points below are classical closed-point fibres and points. (Projective intersection dimension and nonemptiness).
If a Noetherian space is a finite union of closed subsets , then . For both sides are . (Dimension of a finite closed union).
For every integer , . Work over a fixed algebraically closed field , with the Axiom of Choice. Classical varieties are separated and admit finite affine covers; they may be reducible or empty unless irreducibility is specified. Irreducible means nonempty. All fibres and points below are classical closed-point fibres and points. (Affine and projective n-space have dimension n).
Proof
For , the inequality means , and the only -plane is the whole , which is disjoint from exactly in that case. For and , any coordinate -plane works.
Suppose and . In any current linear ambient space, choose a hyperplane containing none of the finitely many irreducible components of its intersection with . Such a hyperplane exists: the coefficient vectors of hyperplanes containing a fixed nonempty component form a proper vector subspace of the dual; finitely many such subspaces cannot cover the dual over infinite . Indeed enclose them in hyperplanes with nonzero linear equations; their product is a nonzero polynomial and cannot vanish on all of , as follows by induction on from the one-variable root bound.
Each positive-dimensional component drops dimension by one on cutting by the chosen hyperplane, and a zero-dimensional component is a point avoided by it. Repeat inside the successive linear spaces. After at most cuts the intersection is empty; continue taking arbitrary hyperplanes if necessary until precisely cuts have been made. Each cut is a hyperplane of the previous linear space, so the final linear space has dimension and avoids .
Conversely suppose an -plane avoids . If , some irreducible component has dimension at least . Then , so the projective intersection theorem forces , a contradiction. Thus .
Depends on
Used by
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.
Sources
- Milne Proposition 6.48 and Lemma 6.49 (standard reference, not scraped)