Lower bounds for linear satisfiability problem
I strongly suggest reading the more recent followup paper by Ailon and Chazelle, which avoids the whole infinitesimal issue entirely.  If you want to stick with my paper, please read the journal version (Chicago J Theoretical Computer Science 1999).  The SODA version has a major bug in Section 5, and (I think) the journal version explains the main proof much more clearly.