Published October 6, 2026 | Version v1

L2-acyclicity and cost for a rank-100 amalgam

Authors/Creators

Description

An expanded consequence and verification note for OpenAI's rank-100 fixed-price construction. A self-contained regular-tree and cellular-boundary calculation proves that its displayed 101-generator/100-relator presentation complex is a finite two-dimensional classifying space and every L2-Betti number vanishes, independently of either cost bound. Gaboriau's action invariance and OpenAI's positive Bernoulli cost estimate then give an explicit free ergodic p.m.p. orbit relation with Cost at least 1 + 1/(100*2^61) and vanishing L2-Betti numbers. The group infimum cost is one.

The group and positive cost estimate are due to OpenAI; cost--Betti comparison and action invariance are due to Gaboriau. The general fixed-price implication was already explicit in Popa--Shlyakhtenko--Vaes, and the short conditional limit argument was already in the author's public preliminary triage. Added content is the direct all-degree invariant proof and reproducible input-validation record. No independent fixed-price discovery or firstness is claimed. The pinned upstream source warns that its source argument was intermediate. Its pivotal proof is explicitly identified and independently audited in the supplement.

AI tools were used extensively in research, drafting and adversarial verification. At publication this preprint has not undergone conventional human peer review or refereeing. Automated audits are neither human refereeing nor machine formalization. The package contains the paper source, exact arithmetic and Fox-identity checks, scoped proof audits, source hashes, priority record and clean reproduction instructions.

Files

paper.pdf

Files (271.5 kB)

Name Size
md5:66518b1e67c19d977e552498dd085af6
182.2 kB Preview Download
md5:f09306ccedd3e93b275293a3750b5327
89.3 kB Preview Download

Additional details