logoalt Hacker News

ndriscolltoday at 12:11 AM2 repliesview on HN

To me it seems similar to the + C on an antiderivative (or more generally, quotient objects). Technically, you are dealing with an equivalence class of functions, so a set. But it's usually counterproductive to think of it that way (and when you study this stuff properly, one of the first things you do is prove that you (usually) don't need to, and can instead use an arbitrary representative as a stand-in for the set), so you write F(x)+C.


Replies

qsorttoday at 12:28 AM

I think the Landau notation is a bit more finicky with the details. When it's really a quotient (like modular arithmetic) I'm with you, but here $O()$ morally means "at most this" and often you have to use the "direction of the inequality" to prove complexity bounds, so I'm more comfortable with the set notation. But again, it's just notation, I could use either.

ijustlovemathtoday at 12:48 AM

Huh, never thought about the potential connection between the set-containment operation and Stokes like that.

show 1 reply