Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-generatedSession-authored (Fable 5 assisted)precheck passjudge pass (gpt-5.6-terra)audited 2026-08-26
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.

The imprimitive wreath product preserves its fiber blocks

Example

Let H act on a nonempty set B, and let HΣK act on B×Σ in the imprimitive action of The imprimitive wreath product of permutation groups. For each σΣ, the fiber Fσ:=B×{σ} is a block. If B>1 and Σ>1, these fibers form a nontrivial block system.

Facts & Assumptions

Given: A nonempty H-set B and the imprimitive wreath product action of HΣK on B×Σ.

[L1]

In the imprimitive wreath action, (f,k)(b,σ)=(f(kσ)b, kσ). (The imprimitive wreath product of permutation groups).

[L2]

A block is a nonempty subset B such that for every group element g, either gB=B or (gB)B= (Blocks and block systems for a group action).

Verification

technique · direct
1.1

For (f,k)HΣK, the image of the fiber Fσ is exactly Fkσ by [L1]. Hence every group element sends a fiber to a fiber.

L1
2.1

Each fiber is nonempty because B is nonempty, and two distinct fibers are disjoint, so [L2] makes each Fσ a block. The collection of all fibers partitions B×Σ.

L2step 1.1given
3.1

If B>1 and Σ>1, then each fiber is a proper non-singleton subset. So the fiber partition is a nontrivial block system.

step 2.1

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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