Alphabeta Math
CorollaryStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-07
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.

Several homogeneous equations in projective space

Statement

Let XPkN be irreducible of dimension d, and let f1,,fr be homogeneous polynomials of positive degree, with r0. Every nonempty component of XV+(f1,,fr) has dimension at least dr. If dr, this common zero set is nonempty.

Work over a fixed algebraically closed field k, 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.

[F2]

Let X be an irreducible classical variety of dimension n, and let f1,,fr be global regular functions, with r0. Every nonempty irreducible component Z of their common zero set has dimZnr. Work over a fixed algebraically closed field k, 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. (r equations lower dimension by at most r).

[F3]

If XPkN is a nonempty projective algebraic set, then dimC(X)=dimX+1. Over Xi=XD+(Ti), the locus C(X)D(Ti) is isomorphic to Xi×Gm. If X is irreducible, so is C(X). Work over a fixed algebraically closed field k, 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. (A nonempty projective cone raises dimension by one).

[F5]

If U is a nonempty open of an irreducible classical variety X, then dimU=dimX. Every proper closed subvariety ZX has dimZ<dimX. Work over a fixed algebraically closed field k, 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. (Nonempty opens preserve irreducible dimension).

Proof

1.1

For r=0 the zero set is X and both assertions hold. For r>0, the affine common zero locus H on the irreducible cone C(X) contains the vertex, and every component has dimension at least (d+1)r by the equations bound. If dr, this number is positive, so H cannot be supported only at the vertex. A nonzero point yields a point of the projective common zero set.

F2F3
2.1

On a chart where Ti0, homogeneity identifies H with the corresponding projective common zero locus times Gm. A nonempty projective component, restricted away from the other components, corresponds to an affine component in this open, whose dimension is at least d+1r. Subtracting the one scaling dimension gives the bound dr. This comparison concerns the punctured locus; when the projective zero set is empty, H can still contain the vertex, so it is not identified with the supplier-defined cone of the empty set.

F3step 1.1F5

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

17 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