Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Extension of finite partial prime-ideal diagrams

Statement

Let A⊆C be finite Boolean subalgebras of a Boolean algebra B. Every homomorphism e:A→2 extends to a homomorphism e′:C→2. Consequently every finite partial prime-ideal diagram extends across any prescribed finite subset of B.

Facts & Assumptions

Given: The finite subalgebras A⊆C⊆B and a homomorphism e:A→2.

[F1]

A finite partial prime-ideal diagram is a homomorphism on its whole finite subalgebra, and finite generated subalgebras have nonzero cells as atoms. Finite partial prime-ideal diagrams

Proof

1.1F1givenchoose

The finitely many atoms of A have join 1. At least one has e-value 1, since e(1)=1; at most one does, since distinct atoms have meet 0 whereas two value-1 atoms would have meet of value 1. Let a be this unique atom.

2.1F1step 1.1choose

The atoms of C below a have join a: intersect the atomic decomposition of 1C with a. Because a≠0, at least one such C-atom c is nonzero. This chooses one element from one finite nonempty set, not a choice function on a family.

3.1F1step 2.1construct

Define e′(x)=1 exactly when c≤x. Since c is an atom, it lies below exactly one of x,¬x, and c≤x∧y exactly when both c≤x and c≤y; hence e′ preserves 0,1,¬,∧, and therefore ∨. Thus e′:C→2 is a Boolean homomorphism.

4.1step 1.1step 2.1step 3.1

For x∈A, the selected A-atom a lies below exactly one of x,¬x, and c≤a. If e(x)=1, uniqueness in step 1.1 forces a≤x, hence e′(x)=1; if e(x)=0, then e(¬x)=1, so a≤¬x and e′(x)=0. Therefore e′∣A=e.

5.1F1step 4.1∎

Given a finite F⊆B, take C=⟨A∪F⟩. The cell description makes C finite, step 4.1 extends the original diagram to C, and its domain contains F; this is precisely extension across F. It is not called a diagram deciding F, because the preceding definition reserves that phrase for a diagram whose domain is exactly ⟨F⟩.

Depends on

Used by

Dependency tree · two levels

2 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