I am trying to prove the Weyl's asymptotic law for eigenvalues. In the document Weyl's law of p. $4$, I have managed to go up to the step $$\tilde{\nu_k} \leq \nu_k \leq \mu_k \leq \tilde{\mu}_k \implies N_{\tilde{\nu_k}}(\lambda) \leq N_{\nu_k}(\lambda) \leq N_{\mu_k}(\lambda) \leq N_{\tilde{\mu}_k}(\lambda).$$ Right after, it is indicated that $N_{\mu, i} (\lambda)=c_n \text{vol}(Q_i) \lambda^{\frac{n}{2}}+o(\lambda^{\frac{n}{2}})$. Does someone could explain to me how it is possible to find an explicit function for $N_{\mu, i} (\lambda)$?
2026-04-04 07:03:26.1775286206
How to obtain $N_{\mu, i} (\lambda)=c_n \text{vol} (Q_i) \lambda^{\frac{n}{2}}+o(\lambda^{\frac{n}{2}})$? - Weyl's law
163 Views Asked by user343429 https://math.techqa.club/user/user343429/detail At
1
There are 1 best solutions below
Related Questions in EIGENVALUES-EIGENVECTORS
- Stability of system of parameters $\kappa, \lambda$ when there is a zero eigenvalue
- Stability of stationary point $O(0,0)$ when eigenvalues are zero
- Show that this matrix is positive definite
- Is $A$ satisfying ${A^2} = - I$ similar to $\left[ {\begin{smallmatrix} 0&I \\ { - I}&0 \end{smallmatrix}} \right]$?
- Determining a $4\times4$ matrix knowing $3$ of its $4$ eigenvectors and eigenvalues
- Question on designing a state observer for discrete time system
- Evaluating a cubic at a matrix only knowing only the eigenvalues
- Eigenvalues of $A=vv^T$
- A minimal eigenvalue inequality for Positive Definite Matrix
- Construct real matrix for given complex eigenvalues and given complex eigenvectors where algebraic multiplicity < geometric multiplicity
Related Questions in ASYMPTOTICS
- Justify an approximation of $\sum_{n=1}^\infty G_n/\binom{\frac{n}{2}+\frac{1}{2}}{\frac{n}{2}}$, where $G_n$ denotes the Gregory coefficients
- How to find the asymptotic behaviour of $(y'')^2=y'+y$ as $x$ tends to $\infty$?
- Correct way to prove Big O statement
- Proving big theta notation?
- Asymptotics for partial sum of product of binomial coefficients
- Little oh notation
- Recurrence Relation for Towers of Hanoi
- proving sigma = BigTheta (BigΘ)
- What's wrong with the boundary condition of this $1$st order ODE?
- Every linearly-ordered real-parametrized family of asymptotic classes is nowhere dense?
Related Questions in SPECTRAL-THEORY
- Why is $\lambda\mapsto(\lambda\textbf{1}-T)^{-1}$ analytic on $\rho(T)$?
- Power spectrum of field over an arbitrarily-shaped country
- Calculating spectrum and resolvent set of a linear operator (General question).
- Operator with compact resolvent
- bounded below operator/ Kato-Rellich
- Show directly that if $E_1\geqslant E_2\geqslant\dots$, then $E_i\rightarrow \bigwedge E_i$ strongly.
- Is the spectral radius less than $1$?
- How to show range of a projection is an eigenspace.
- Spectral radius inequality for non-abelian Banach algebras
- Do unitarily equivalent operators have the same spectrum?
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
You're not going to find an explicit function for $N$. (For example, $N$ is not even continuous.)
To prove the asymptotic expansion $$N(\lambda) = c_n|\Omega|\lambda^{n/2} + o(\lambda^{n/2})$$ for the Dirichlet counting function on a domain $\Omega$, the simplest way in bounded Euclidean domains --- and one that I assume you're to use, since you appear to have the inequality between Neumann and Dirichlet eigenvalues --- is to appeal to Dirichlet-Neumann bracketing.
This idea stems from Weyl's original papers (1911,1912) and is described very well in volume 1 of Courant-Hilbert, Methods of Modern Mathematical Physics. The basic idea is to cover $\Omega$ with small $\epsilon$-cubes $\{\chi_j\}$. Denote by $N_*^D$ the Dirichlet eigenvalue counting function and $N_*^N$ the Neumann eigenvalue counting function for the domain $*$. Let $\mathcal{S} = \{\chi\ |\ \chi\subset\Omega\}$ and let $\mathcal{T} = \{\chi\ |\ \chi\cap\Omega\neq\emptyset\}$.
Then argue that as $$ S = \bigcup_{\mathcal{S}} \chi \subset \Omega \subset \bigcup_{\mathcal{T}}\chi = T $$ by Dirichlet monotonicity and by the inequality you give in the question above, we have the following inequalities among counting functions: $$ N_S^D \leq N_\Omega^D \leq N_T^D \leq N_T^N $$
Next, use the fact that all the $\chi$ are isometric, Dirichlet monotonicity, and Neumann monotonicity to argue that the following holds: $$ (\#\mathcal{S})N_\chi^D \leq N_\Omega^D \leq (\#\mathcal{T})N_\chi^N $$ (Here $\#$ denotes the cardinality operator.)
Finally, use the explicit upper bounds you already know for the Dirichlet and Neumann counting functions of cubes to produce explicit upper and lower bounds for $N_\Omega^D$. The last step is to choose how $\epsilon\to 0$ as $x\to\infty$.
(There is a bit of a subtlety here, for as $\epsilon\to 0$, the bounds at a fixed $\lambda$ becomes very, very bad. This is an expression of the uncertainty principle: When the wavelength is larger than the size of the square, you can't capture the eigenfunction anymore. However, by letting $\lambda\to\infty$ as the squares shrink, you are able to keep the eigenfunctions "in resolution," as it were, and this lets you prove the theorem.)