Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Irreducibility is equivalent to every pair of nonempty open sets meeting

Statement

Let k be an algebraically closed field, let n0, and let XAkn be a nonempty subset with the subspace Zariski topology. Then the following are equivalent:

  1. X is irreducible.
  2. Every pair of nonempty open subsets of X has nonempty intersection.
  3. Every nonempty open subset of X is dense in X.

Facts & Assumptions

Given: An algebraically closed field k, an integer n0, and a nonempty subset XAkn with the subspace Zariski topology.

Proof

technique · direct
1.1

Assume X is irreducible. If U,VX are nonempty open subsets with UV=, then X=(XU)(XV) is a union of two proper closed subsets, contrary to irreducibility. Therefore every two nonempty open subsets of X meet.

given
1.2

Conversely, assume every two nonempty open subsets of X meet. If X=AB with A and B proper closed subsets, then XA and XB are nonempty disjoint open subsets, a contradiction. Hence X is irreducible.

givenalgebra
1.3

If every nonempty open subset of X is dense and U,V are nonempty open subsets, then U=X, so U meets the nonempty open set V. Thus every pair of nonempty open subsets meets.

givenalgebra
2.1

Assume every two nonempty open subsets of X meet, and let UX be nonempty open. If UX, then XU is a nonempty open set disjoint from U, contradiction. So U is dense.

step 1.2given
3.1

Steps 1.1 and 1.2 show that irreducibility is equivalent to pairwise intersection of nonempty opens, and steps 2.1 and 1.3 show that this is also equivalent to density of every nonempty open subset.

step 1.1step 1.2step 2.1step 1.3

Depends on

Used by

Dependency tree · two levels

4 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