All Questions
7,280 questions
2
votes
1
answer
1k
views
How can we use the bounded convergence theorem in this proof of the Riesz Representation Theorem?
I'm studying the proof of the Riesz Representation Theorem as it appears in Ch. 6 of Royden's Real Analysis. When I looked on the web I noted there are a few different theorems that go by the name "...
1
vote
2
answers
923
views
Extremum under variations of a traceless matrix
Sorry for my precedent tentative, I was a little hasty:
Ok, I think I'd better put the original problem:
I have an action of three fields: $A$ which is the spin-connection, $B$ an skew-symmetric 2-...
2
votes
2
answers
317
views
Bibliography for topologies defined by a family of seminorms
Hello
I am trying to learn more about Fréchet spaces (in order to study the theory of distributions) and was wondering what people thought was the best resource.
Thank you very much.
14
votes
3
answers
1k
views
"Conjugacy rank" of two matrices over field extension
I have posted this elsewhere and got only a partial reply. I don't know whether this qualifies the question for an open-problem tag; if it does, please anyone insert it.
Let $L$ be a field, and $K$ a ...
12
votes
2
answers
812
views
Inequality in Gaussian space -- possibly provable by rearrangement?
The following problem arose for my collaborators and me when studying the computational complexity of the Maximum-Cut problem.
Let $f : \mathbb{R} \to \mathbb{R}$ be an odd function. Let $\rho \in [...
5
votes
5
answers
2k
views
Cardinality of Equivalence Classes of Cauchy Sequences
What's the cardinality of a single equivalence class of Cauchy sequences in ℚ?
To clarify, I'm not asking for the cardinality of the real numbers, but for the cardinality of the set of Cauchy ...
4
votes
5
answers
5k
views
conjugate gradient iteration
I'm having problems understanding why the conjugate gradient method breaks down for singular matrices. I've read a good introduction to intuitively understanding the CG method through visualizing the ...
2
votes
3
answers
946
views
How can I measure the Morse index in infinite dimensions?
Let $V$ be a vector space over $\mathbb R$, and $a: V\otimes V\to \mathbb R$ a symmetric bilinear pairing. Recall that the Morse index of $a$ is the maximal dimension of any subspace $V_- \subseteq V$...
2
votes
4
answers
3k
views
Splitting a space into positive and negative parts
Let $V$ be a vector space over $\mathbb R$. A symmetric bilinear pairing on $V$ is a linear map $a: V\otimes V \to \mathbb R$. Because $\mathbb R$ is characteristic not-two, I will freely confuse ...
4
votes
2
answers
730
views
Decomposition of Hölder continuous functions
Let $\alpha\in(0,1)$ and $\eta\in\Lambda_0^\alpha(\mathbb{R})$ be a compactly supported Hölder continuous function of order $\alpha$. I would like to show that, for any $n\in\mathbb{N}$, it is ...
23
votes
4
answers
2k
views
Which is the correct ring of functions for a topological space?
There is a fact that I should have learned a long time ago, but never did; I was reminded that I did not know the answer by Qiaochu's excellent series of posts, the most recent of which is this one.
...
51
votes
5
answers
18k
views
Integrability of derivatives
Is there a (preferably simple) example of a function $f:(a,b)\to \mathbb{R}$ which is everywhere differentiable, such that $f'$ is not Riemann integrable?
I ask for pedagogical reasons. Results in ...
3
votes
1
answer
263
views
Asymptotically multiplicative functions and matrices
Hi,
Let $\mathbb{N}_{cop}^2$ denote the set of all pairs of coprime natural numbers. A function $f:\mathbb{C}\rightarrow\mathbb{C}$ is called asymptotically multiplicative, iff $\epsilon_{m,n}:=f(mn)...
5
votes
5
answers
5k
views
Notions of Matrix Differentiation
There are a few standard notions of matrix derivatives, e.g.
If f is a function defined on the entries of a matrix A, then one can talk about the matrix of partial derivatives of f.
If the entries of ...
8
votes
2
answers
2k
views
Hermitian matrices with prescribed number of positive and negative eigenvalues
Let $H$ be a linear subspace of the space of Hermitian $n\times n$ matrices. Is there a good characterization of those $H$ such that every $A\in H$ has at least $k$ positive and $k$ negative ...
31
votes
10
answers
9k
views
When to pick a basis?
Picking a specific basis is often looked upon with disdain when making statements that are about basis independent quantities. For example, one might define the trace of a matrix to be the sum of the ...
1
vote
4
answers
385
views
Is it that only with normal matrices, the transition matrix to its [del: inherent] [ins: own] basis is unitary?
Does this even make sense what I translated into english?
PS. I am probably gonna delete this question eventually
74
votes
15
answers
18k
views
$f(f(x))=\exp(x)-1$ and other functions "just in the middle" between linear and exponential
The question is about the function $f(x)$ so that $f(f(x))=\exp (x)-1$.
The question is open ended and it was discussed quite recently in the comment thread in Aaronson's blog here http://...
91
votes
5
answers
124k
views
Eigenvalues of matrix sums
Is there a relationship between the eigenvalues of individual matrices and the eigenvalues of their sum? What about the special case when the matrices are Hermitian and positive definite?
I am ...
38
votes
26
answers
57k
views
Text for an introductory Real Analysis course.
Any suggestions on a good text to use for teaching an introductory Real Analysis course? Specifically what have you found to be useful about the approach taken in specific texts?
26
votes
2
answers
9k
views
Maximal ideals in the ring of continuous real-valued functions on ℝ
For a compact space $K$, the maximal ideals in the ring $C(K)$ of continuous real-valued functions on $K$ are easily identified with the points of $K$ (a point defines the maximal ideal of functions ...
72
votes
9
answers
16k
views
Why do functions in complex analysis behave so well? (as opposed to functions in real analysis)
Complex analytic functions show rigid behavior while real-valued smooth functions are flexible. Why is this the case?
3
votes
1
answer
2k
views
Minkowski inequality
In the Wikipedia proof of the Minkowski inequality (http://en.wikipedia.org/wiki/Minkowski_inequality), the following inequality is used:
$$|f+g|^p\leq2^{p-1}(|f|^p+|g|^p).$$
I was just wondering if ...
19
votes
4
answers
2k
views
Variation on a matrix game
The original problem appeared on last year's Putnam exam:
"Alan and Barbara play a game in which they take turns filling entries of an initially empty 2008×2008 array. Alan plays first. At each turn, ...
22
votes
2
answers
14k
views
Infinite matrices and the concept of "determinant"
Suppose we have an infinite matrix A = (aij) (i, j positive integers). What is the "right" definition of determinant of such a matrix? (Or does such a notion even exist?) Of course, I don't ...
40
votes
5
answers
10k
views
Is there a natural measures on the space of measurable functions?
Given a set Ω and a σ-algebra F of subsets, is there some natural way to assign something like a "uniform" measure on the space of all measurable functions on this space? (I suppose first ...
11
votes
1
answer
410
views
An "existence contra partition of unity" statement for integer matrices?
While reading a blog post on partitions of unity at the Secret Blogging Seminar the following question came into my mind.
Let $n$ be a positive integer and let $B_1$ and $B_2$ be $n \times n$ ...
40
votes
6
answers
6k
views
Linear transformation that preserves the determinant
It seems "common knowledge" that the following holds:
Let $T$ be a linear transformation on $n\times n$ matrices with complex coefficients that preserves the determinant. Then there exists ...
7
votes
2
answers
477
views
Characterizing the Radon transforms of log-concave functions
$f:\mathbf{R}^d\to \mathbf{R}_{\ge 0}$ is log-concave if $\log(f)$ is concave (and the domain of $\log(f)$ is convex).
Theorem: For all $\sigma$ on the sphere $\Bbb S^{d-1}$ and $r\in \mathbf{R}$,
$$
...
9
votes
6
answers
8k
views
How to approximate a solution to a matrix equation? [closed]
Suppose a matrix equation $Ax = b$ has no solution ($b$ is not in the column space of $A$)
How can I find a vector $x^\prime$ so that $Ax^\prime$ is the closest possible vector to $b$?