Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-08-27
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.

A radical of a product and intersection computation

Example

In the polynomial ring k[x,y], one has (x2,xy)∩(y3)=(xy).

Facts & Assumptions

Given: A field k.

[L1]

The radical of an intersection is the intersection of the radicals (The radical of a finite intersection).

[L2]

The radical of (x2,xy) is (x) (Computing sqrt((x^2,xy)) from its containing primes).

[L3]

An element lies in the radical of an ideal exactly when some positive power lies in that ideal (Radical membership via positive powers).

Verification

technique · direct
1.1L1L2L3givenchoosealgebra

By [L1] and [L2], (x2,xy)∩(y3)=(x2,xy)∩(y3)=(x)∩(y3). Since y3∈(y3), [L3] gives y∈(y3), so (y)⊆(y3). Conversely, if g∈(y3), choose m≥1 with gm∈(y3) and write g=a(x)+yh(x,y) with a(x)∈k[x]; if a(x)≠0, then gm=a(x)m+y b(x,y) for some b(x,y)∈k[x,y], so gm has a nonzero y0 term and cannot lie in (y3), a contradiction. Hence a(x)=0, so g∈(y). Thus (y3)=(y).

2.1step 1.1algebra

Step 1.1 reduces the problem to (x)∩(y). A polynomial lies in both ideals exactly when it is divisible by both x and y, hence by xy. Therefore (x)∩(y)=(xy).

3.1step 1.1step 2.1∎

Therefore (x2,xy)∩(y3)=(xy).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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