One sign.
A broken route.
A reversed contribution changes cancellation into reinforcement. The count and every dependency lamp follow the same signed arithmetic.
Upper bank: initial negative counts · lower: applied additions. The three lamps show a synthetic dependency route. An undefined contribution parks the dial; it does not assign a zero total.
Reduced motion is enabled. Choose still counts with the controls.
What this register explains
Start at−m. Adding n positive signs gives−m+n; negative signs give−m−n. At n=m, the totals are0 or−2m. The dial stays−16 to16.
Planar illustration: a=(1,0), b=σ(cosθ,sinθ), det[a,b]=σsinθ. Reversing b flips the sign for0<θ<180°. At0/180°, collinear branches have no crossing sign. With n0, total−m remains valid; otherwise the undefined sign suppresses the total.
The contact banks count integers. Manual additions stop atn=m; reducing m clamps n and its control limit together. Three lamps show a synthetic route. Zero count is one prerequisite, not a proof certificate or truth verdict.
This is not a reconstruction of higher-dimensional cusp geometry or a check of Eliashberg–Murphy, Lean or a withdrawn theorem. A failed argument and a false statement are separate claims.
OpenAI: signed-count withdrawal notice ↗
Repository history and dependencies ↗