Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-generatedprecheck passaudited 2026-08-11
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.

Complements of a maximal cyclic subgroup in C_p times C_p need not be unique

Example

In Cp×Cp, fix A=Cp×{0}. For every t∈Cp, the subgroup Bt={(tx,x):x∈Cp} is a complement of A, and distinct t give distinct complements.

Facts & Assumptions

Given: The objects and hypotheses in the example.

[L1]

Let G be a finite abelian p-group and let a∈G have maximal element order. Then there is a subgroup H≤G such that G=⟨a⟩⊕H. (A maximal-order cyclic subgroup splits off a finite abelian p-group).

[L2]

Let G be a group and let N0,…,Nr−1 be normal subgroups, where r∈N. They form an internal direct product when they generate G and, for each i<r, Ni∩⟨Nj:j<r, j≠i⟩={e}. The empty family is an internal direct product of the trivial group. For two subgroups of an abelian group this says G=HK and H∩K={e}; in additive notation one writes G=H⊕K. Normal subgroups and generated subgroups are those of def-normal-subgroup and def-generated-subgroup, and the comparison product is def-external-direct-product-of-groups. (Internal direct products of finitely many normal subgroups).

[L3]

Let N0,…,Nr−1⊴G. The following are equivalent: the Ni form an internal direct product of G; every g∈G has a unique expression g=n0⋯nr−1 with ni∈Ni; and the multiplication map μ:∏i<rNi→G is an isomorphism. These statements include the empty family and the one-factor case. (Internal direct products are external direct products, equivalently every element has a unique factorisation).

[L4]

For every n∈N, view n as its canonical nonnegative integer and put nZ:={nk:k∈Z}. Then the left cosets of nZ in (Z,+) are exactly the congruence classes modulo n, and coset addition is the published addition of congruence classes. Thus (Z,+)/nZ=(Z/n,+) as the same group on the same underlying set. This includes n=0 and n=1. (For every n∈N, the congruence-class group (Z/n,+) is the quotient group (Z,+)/nZ).

Verification

technique · direct
1.1

Each Bt is an order-p subgroup, and A∩Bt={(0,0)} because (tx,x)∈A forces x=0.

givenL1L2L3L4
2.1

For (u,v)∈Cp2, one has (u,v)=(u−tv,0)+(tv,v) with the summands in A and Bt, so A+Bt=G.

step 1.1
3.1

Internal-product recognition gives G=A⊕Bt. Since (t,1)∈Bt distinguishes the slope, the complement promised by the splitting theorem need not be unique.

step 2.1∎

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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