Alphabeta Math
TheoremStatement: Literature-sourcedProof: 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.

Internal direct products are external direct products, equivalently every element has a unique factorisation

Statement

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.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

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).

[L2]

For groups G and H, the componentwise operation of def-external-direct-product-of-groups makes G×H a group. Its identity is (eG,eH), and (g,h)−1=(g−1,h−1). Moreover the coordinate maps πG(g,h)=g and πH(g,h)=h are group homomorphisms. (G×H is a group with identity (eG,eH), coordinatewise inverses, and homomorphic coordinate projections).

[L3]

Let (M,⋅,e) and (M′,⋅′,e′) be monoids (def-semigroup-and-monoid). A monoid homomorphism from M to M′ is a function f:M→M′ such that - (H1) f(x⋅y)=f(x)⋅′f(y) for all x,y∈M; - (H2) f(e)=e′. Let G and G′ be groups (def-group). A group homomorphism from G to G′ is a function f:G→G′ satisfying (H1) alone: f(xy)  =  f(x) f(y)for all x,y∈G. Condition (H2) is not imposed for groups because it follows: a group homomorphism automatically satisfies f(e)=e′ and f(x−1)=f(x)−1 (lem-group-homomorphism-basic-properties). For monoids it does not follow and must be assumed, which is why the two definitions differ. A homomorphism from a structure to itself is an endomorphism. The identity map of M is a monoid homomorphism, and a composite of monoid homomorphisms is one, since (g∘f)(xy)=g(f(x)f(y))=g(f(x)) g(f(y)) and (g∘f)(e)=g(e′)=e′′; the same computation, without the second clause, shows a composite of group homomorphisms is a group homomorphism. (Monoid homomorphism and group homomorphism).

[L4]

A group homomorphism is injective if and only if its kernel is trivial. For a group homomorphism f:G→H, f is injective exactly when ker⁡f={eG}. (A group homomorphism is injective if and only if its kernel is trivial).

[L5]

If H≤G and N⊴G, then HN is a subgroup and H∩N⊴H. Here HN:={hn:h∈H, n∈N}. (If H≤G and N⊴G, then HN is a subgroup and H∩N⊴H).

Proof

technique · direct
1.1

The internal intersection condition gives Ni∩Nj={e} for i≠j. Unique factorisation gives the same conclusion, since an element of Ni∩Nj has expressions supported in either coordinate. In either case normality puts [Ni,Nj] inside Ni∩Nj, so distinct factors commute and the multiplication map μ((ni))=n0⋯nr−1 is a homomorphism.

givenL1L2L3
1.2

Conversely, suppose that μ is an isomorphism. Coordinate subgroups in the external product commute, so their images Ni commute, and surjectivity says that the factors generate G. If x∈Ni∩⟨Nj:j≠i⟩, the commuting factors express x as an ordered product of elements from the other Nj. The tuple supported at i and this tuple supported away from i have the same image, so injectivity gives x=e. Hence the factors form an internal direct product.

givenL1L2L3L4L5
2.1

Under the internal-product condition, the image of μ is the subgroup generated by the factors, hence is all of G. If μ((ni))=e, then each ni is the inverse of a product of the other factors and so lies in Ni∩⟨Nj:j≠i⟩; therefore every ni=e. Thus μ is an isomorphism.

step 1.1L1L4L5
2.2

Under unique factorisation, every element has exactly one preimage under the homomorphism μ. Thus μ is bijective and hence is an isomorphism.

step 1.1L3L4
3.1

For the empty family, each condition says that G is trivial. For one factor, each says that N0=G, and the multiplication map is then the identity after identifying the one-fold product with N0.

givenL1L2∎

Depends on

Used by

Dependency tree · two levels

18 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