Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21
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.

Homotopic-loop factorizations have the same value in the group pushout

Statement

Assume the hypotheses of Loops over a two-set path-connected open cover factor through the covering sets, and let P be a pushout of

π1(UV,x0)π1(U,x0),π1(UV,x0)π1(V,x0).

A subordinate factorization is one obtained from a finite subdivision and connector paths in UV as in Loops over a two-set path-connected open cover factor through the covering sets; it writes the loop class as a product of inclusion-images of based loops lying in U or V. Replace each factor by its image under the corresponding canonical map to P and multiply in the same order. If two based loops are path-homotopic relative to their endpoints, then every subordinate factorization of the first and every subordinate factorization of the second have the same value in P.

Facts & Assumptions

Given: The two-set cover and basepoint, the pushout P with factor maps iU,iV, endpoint-homotopic based loops α,β, and subordinate factorizations of both loops.

[L1]

Every based loop over the cover has a finite subordinate factorization by loops in U and V (Loops over a two-set path-connected open cover factor through the covering sets).

[L2]

A path homotopy over the cover has a finite subordinate grid refining any prescribed bottom and top subdivisions (A path homotopy over a two-set open cover admits a finite subordinate grid).

[F1]

In the pushout, the factor maps satisfy iUkU=iVkV on π1(UV,x0) (Pushouts of group homomorphisms).

[F2]

A finite natural-number-indexed family of nonempty sets has a choice function (Every natural-number-indexed list of nonempty sets has a choice function on its family of values).

[F3]

Loop concatenation, constant loops, and reversed paths give the group operation, identity, and inverses in every fundamental group (Loop classes form the group π1(X,x0) under concatenation).

Proof

technique · direct
1.1

The value of a subordinate factorization [α]=(jA1)[a1](jAm)[am] is, by definition, iA1[a1]iAm[am]P. Subdividing a factor only replaces one factor by a product in the same fundamental group. If a connector at a subdivision point is changed, the two connectors differ by a loop in UV, and [F1] gives the same element whether that correction is read in the U factor or the V factor. Thus refinements and connector changes preserve the value.

L1F1F3
2.1

Choose an endpoint-fixed path homotopy H from α to β. By [L2], take a subordinate rectangular grid refining the prescribed subdivisions of both factorizations. At every grid vertex, choose a path to x0 inside U if all adjacent rectangles are assigned to U, inside V if all are assigned to V, and inside UV if both assignments occur. Each required path family is nonempty by path-connectedness, and [F2] licenses the finite selection; on the bottom and top edges use the prescribed connectors after the harmless adjustments of step 1.1.

step 1.1L2F2choose
3.1

For an oriented grid edge, concatenate its chosen endpoint connectors with the image of the edge. This gives a based loop in either adjacent cover member; if the adjacent assignments differ, both connectors lie in UV, so [F1] identifies the two readings in P. Around one grid rectangle, the four edge loops multiply to the identity because the restriction of H to that rectangle contracts its boundary inside its assigned cover member. Multiplying these boundary identities row by row cancels every interior edge with its reverse, leaving exactly the refined bottom word and the inverse of the refined top word. Hence the two words have equal value in P.

step 2.1F1F3algebra
4.1

Step 1.1 identifies the refined boundary words with the values of the original factorizations, while step 3.1 identifies those refined values with each other. Therefore every factorization of α and every factorization of β have the same value in P.

step 1.1step 3.1

Depends on

Used by

Dependency tree · two levels

27 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