Context
A correct invariant can still be insufficient for the desired conclusion. This entry keeps the valid homology computation separate from the invalid promotion to simple connectedness.
Definitions
- For a connected CW complex, is the abelianization of .
Hypotheses and scope
- The fixed five-leaf square–pentagon complex after quotienting disjoint scheduling.
Proof or evidence
The boundary ranks and correctly yield and , but a nontrivial perfect fundamental group would have the same first homology. The repaired proof removes one pentagon, collapses the other eight faces along recorded free edges, and leaves a connected graph with 14 vertices and 13 edges, hence a tree.
Verification notes
The ledger's invalid inference and successful replacement were checked separately. The matrix records L4 because the public page gives the complete logical obstruction and identifies the constructive proof, not because the abandoned homology argument was repaired rhetorically.
Limitations
- The homology ranks remain valid and useful corroboration.
- The collapse certificate proves the fixed complex simply connected; it is not an all-arity coherence theorem.
- No external or specialist review is documented.