@Charlie Well, you have a bunch of objects $A_i$, we call $P$ another object together with maps $\pi_i:P\to A_i$ a product of the $A_i$s if for any object $B$ and any set of maps $\psi_i:B\to A_i$ there is a unique map $\varphi:B\to P$ for which $\pi_i\circ \varphi=\psi_i$.
The coproduct is the same but with the things to the other side.
I want to learn how to do 3d drawing using 2d lines to construct cubes in a 3d space...suppose i draw a line in 3d space, suppose from (5,5,5) to (10,10,10). Suppose my eye is at position (x,y,z) and i can move it and rotate it. How would i map this line to a flat surface? I don't know if this question makes sense, but i am hoping someone knows a resource for me to start learning about basic math concepts involving this
Do you mean using computer programs or drawing by hand @mathguy ?
Also, a question. I need to show that given the ordinals a, b, and a<b. I have to show that Ua=Ub iff b=a+1, and a is not a following number (i.e. it doesn't have a direct predecessor). I am completely lost.
@Studentmath I want to use it for computers, but either way, the same math concepts should apply. I know that we have to define the degrees of vision that the eye has. The equation for the 3d line will always be the same no matter what, but the equation for the 2d representation for htat line will keep changing if the camera keeps changing
I am very confused. with regards to your examples, what's the difference between C-algebraic and C-rational? second, your examples are numbers, but you are using algebraic and rational to describe functions.
@anon This is why one does not consider $$\int_{\text{blah}}^{\text{blah'}} \frac1{\sqrt{P(x)}}$$ is not considered to be hyperelliptic if $\text{deg}P = 4$
@AlexanderGruber as user says, you mean rational functions not polynomials. I think the natural setting to prove it in is algebra but I will think combinatorially about it.
@AlexanderGruber the fact the expression has a lot of minus signs means there's probably not a proof involving just pure counting. generating functions with positive coefficients can be used to mimic combinatorial proofs algebraically, but gfs generalize to allow more exotic interactions. I suppose things with - signs might track something like "uncounting," akin to negative numbers generalizing positive.
@anon @AlexanderGruber Here's an interesting question : Say we have a function $f$ holomorphic such that $f(X)^5 + f(X) + X = 0$. Is it possible to prove $f$ must be modular?
@Henrique you mean a question on MSE? just use the dollar signs for inline math and double dollar signs for centered display equations. else you can use \begin{array}s and whatnot
@anon @AlexanderGruber Here's an interesting question : Say we have a function $f$ holomorphic such that $f(X)^5 + f(X) + X = 0$. Is it possible to prove $f$ must be modular?
Drawn like that, essentially I take the (mass of the left side of the bar * distance to fulcrum) + m1 = (mass of right side of bar * distance to fulcrum)+m2
@N3buchadnezzar If you duplicate your complex integrals the same as is done in $\mathbb{C}$, then it should work. But you need the complex structure and the contour integrals.