Given a linear operator T on the space of all cts. real valued functions given by, T(f) = integral (from 0 to x) f(t)dt. Show that T has no characteristic values. I solved T(f) = pf and got, f(x) = Ae^(x/p), where A is constant
No, no. We don't know anything about $f(x)$. No matter what continuous function $f$ you look at, what value of $x$ can you tell me the value of $\int_0^x f(t)dt$?
BTW, with regard to that $S^{\omega + 1}$ question, I realized that if you glue two contractible things along something contractible, van Kampen isn't very interesting. :P
@Ted What does it mean to take connection of tensors? I suspect $\nabla_X T(X_1, \cdots, X_n) = -X T(X_1, \cdots, X_n) + \sum_i T(X_1, \cdots, \nabla_X X_i, \cdots, X_n)$
If you consider a covering of X with included finite intersections then you can make this into a category O with morphisms the usual inclusions. Then all van kampen says is the fundamental groupoid of X is the colimit of fundamental groupoids of objects of O
If $T$ is an $(n,0)$ tensor then $T(X_1,\dots,X_n)$ is a scalar function and it's just differentiation in the direction of $X$. But it equals the sum when you use the derivation property. So your formula isn't right.
Categorical language is a sure way for me to ignore you, Ali, but that's OK. :P
Particularly today. I had a tooth extracted, and I'm bleeding and in pain :P
Actually, my very first coauthor complained that I was too much of an algebraist because I loved to use differential forms. ... We never wrote a second paper together :P
I'm reading Concrete Mathematics: A Foundation for Computer Science (for my own amusement), and after working out the recurrence for the number of three-dimensional regions that can be defined by $n$ different planes, I got interested in another question, more geometrical than combinatoric in nat...
@Wildcard for the record, even though intuitively the process is 'smooth' (you could balance the lines out by slowly moving them) I think with larger line (or plane) counts you start running into the problem where the sides of the square/cube are very large compared to the combinatorial explosion of tiny regions you get in the center of the cube where all lines (or planes) overlap
@Wildcard even stronger statement that I can't disprove is the following
given a set of lines on a square, can you smoothly translate and/or rotate the lines such that all regions have equal area, without ever reducing or increasing the amount of regions?
Is it safe to assume that the maximum number of regions in $d$ dimensions using $n$ cuts of $d-1$ dimensional dividers is $\displaystyle R_d(n) = \sum_{k=0}^d \binom{n}{k}$?
(there must be a proper term for '$d-1$ dimensional dividers' that form regions, right?)
you can interpret the vector space as {0,a,b,c}, where adding a letter to itself gives 0 and adding two distinct letters gives the third. every permutation of {a,b,c} (fixing 0) is then a linear map (preserves this addition operation).
The exercise in the book is to work out what the recurrence is, not to put it in closed form. I did that successfully. When I checked my answer, the neat patterned closed form was given.
@orlp If a square can be cut in 7 equal area portions by 3 straight lines then I think a cube can probably be cut into 15 equal volume portions with 4 planes.
2x2 matrices with entries from Z/2Z. what do we do with 2x2 matrices? we apply them to column vectors. column vectors with entries from Z/2Z in this case.
for each matrix, figure out how the corresponding matrix transformation permutes a,b,c
for example, the matrix with top row (0,1) and bottom row (1,0) swaps coordinates, so it permutes a and b while fixing c, so the permutation in one-line notation is (ab)(c).