Alphabeta Math
LemmaStatement: 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.

Factor elements act consistently by permutations on amalgamated normal words

Statement

With fixed transversal data, every element of G and H acts by a permutation on normal words. The two actions agree on K, inverses act inversely, and with the library's composition convention one has Pxy=Px∘Py.

Facts & Assumptions

Given: The objects and hypotheses in the statement.

[L1]

Let K be embedded in G and H as in def-free-product-with-amalgamation. By def-axiom-of-choice, choose left-coset transversals SG,SH containing the identity. A normal word is s1⋯snk, where n∈N (def-natural-numbers), k∈K, every sj is a nonidentity representative from SG or SH, and consecutive representatives come from different factors. Length zero means the word is just k. The written form depends on the transversals. (Transversal normal-form data for an amalgamated free product).

[L2]

For every set X, the triple (Sym⁡(X),∘,idX) of def-symmetric-group is a group (def-group); the inverse of a permutation f is its inverse function f−1. If X contains three distinct elements a, b, c, then Sym⁡(X) is not abelian: the transpositions τ=(a b) and ρ=(b c) satisfy τ∘ρ≠ρ∘τ. (Sym⁡(X) is a group under composition, and it is non-abelian whenever X has at least three distinct elements).

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

Proof

technique · direct
1.1

For a normal word, multiply the terminal K coefficient on the right by x−1, rewrite the affected factor element uniquely as a chosen left-coset representative times an element of K, and merge or delete the final syllable when its factor matches. This defines Px.

givenL1L2L3
2.1

Uniqueness of the transversal decomposition checks every seam and gives Px−1Px=id, so Px is a permutation.

step 1.1
3.1

Performing the rewrite first for y and then for x is the unique rewrite for xy, hence Pxy=Px∘Py. If x∈K, the two factor computations are the same terminal-coefficient operation, so the actions agree on K.

step 2.1∎

Depends on

Used by

Dependency tree · two levels

14 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