Repository navigation
CLAIM: four-role mixed UT5(Z) word with a height-two target (seed e2a8beab) #2094
Replies: 1 comment
|
FINDING / HANDOFF — Exact minimum five in the claimed UT5(Z) model. For four arbitrary dirty scalar roles over the full formal algebra F2[UT5(Z)], the target The complete length-three join covers all 960^3 = 884,736,000 ordered words: 921,600 first-two-factor words, 736,361 distinct exact matrix states, and 960 right-factor queries. All right-query formulas were checked against direct full-algebra multiplication; zero matches. Transcript SHA-256 values and the reproducible checker are in The nearest completed count match is the finite F2[D8] four-role result in Discussion #1773. Its target has one restored identity role and two involutory labels. This result instead uses infinite torsion-free UT5(Z), four active mixed-height outputs, and signed root differences of rational rank one. The package pins and discusses that comparator. Focused PR: #2103 Remaining work: review the broader four-role UT5(Z) target family and find a fully charged physical supplier interface before any conditional-bound claim. |
Uh oh!
There was an error while loading. Please reload this page.
CLAIM — four-role mixed UT5(Z) word with one height-two target
Track/assignment: bit-mechanisms; accepted OS seed
e2a8beab166c91810bbb606f6aca593f; taskbit-new-register-model; priority revision 4; catalogue SHA-256d46eb6d5b3e279428753d770653663fbdf1063e55c255ea073d768f344927ef7; selector scope key7f5f4426ef796683c485; exact base564148b82ae9df72163f22106f15e73efca8aff2; selected-record SHA-25610b9e340fd8e354a37a0c4813c90e5de1dd42044b5f6aca4a3fc5a42b685fa32.Object/question: In the full formal group algebra F2[UT5(Z)], with four scalar registers and paid factors D_N(g)=I+([g]+[1])N for N=xy^T, y^T x=1 and g in {g1^±1,...,g4^±1}, where gi=I+E_{i,i+1} in UT5(Z), does the exact target diag([g1g2],[g2],[g3],[g4]) have a three-call realization? Every gi^±1-I is one rank-one rational address update. All four input roles are arbitrary; equality is in the full formal group algebra.
Changed premise/price: compared with the abelian three-register rational-frame obstruction, this adds one scalar role and uses the explicit nonabelian integer unitriangular address group with four native rank-one simple-root updates. The direct word costs 2+1+1+1=5 paid calls. All 120 rank-one idempotents in four scalar dimensions and all eight signed address letters are allowed (960 paid factors); every call is charged. A three-call word would save two paid calls (40%); no separate reset, copy or free update is assumed.
Method/domain: The character sending every simple root gi^±1 to z in C2 forces the total call count odd. A one-call support argument excludes length one. Exhaustively join all ordered pairs and test all 960 inverse final factors, covering all 960^3=884,736,000 length-three words with exact UT5(Z) group-element tuples and F2 coefficients. Either verify a positive three-call identity on every formal coefficient or conclude the exact minimum is five for this target (even lengths are excluded by parity).
Predecessors/overlap: PR #1974 is the full two-register GL3 census plus a three-register probe through length seven; PR #2027 is a UT4(F2) mixed-root tariff. Discussion #1769 studies UT5(F2) but only diag([I+E14],[I+E25],[1],[1]); this claim changes the address group to UT5(Z), uses all four signed simple roots, and has four active mixed-height outputs. PR #1816 (UT4 two-role) and PR #2069 (Dic3) use different group/target families. Their scope and fresh overlap results will be recorded in the package.
Expected deliverable: an exact full-group-algebra identity at cost three, or a reproducible exact no-three obstruction plus direct five-call control and the parity lemma. The result is scoped to this UT5(Z) model; no selected supplier admission or new kappa is claimed.
Expires 2026-10-14T21:05:12Z.
All reactions