Is There a Mistake in This CLQG Thesis?

  • Context: Undergrad 
  • Thread starter Thread starter julian
  • Start date Start date
  • Tags Tags
    Mistake Thesis
Click For Summary
SUMMARY

The forum discussion identifies a critical error in the thesis "Semi-Classical Holomorphic Transition Amplitudes in Covariant Loop Quantum Gravity." Specifically, on page 52, the thesis incorrectly states that the number of ways to remove ##k## vertices from a list of length ##p + 1## is ##\binom{p+1}{k+1}##, when it should be ##\binom{p+1}{k}##. This mistake affects the interpretation of Lemma 3.2.1, which should state that the number of ##n-##simplices contained in a ##p-##simplex is given by the formula ##N^p_n = \binom{p+1}{n+1}##. The discussion concludes that this error does not impact the overall results of the thesis.

PREREQUISITES
  • Understanding of combinatorial mathematics, specifically binomial coefficients.
  • Familiarity with simplicial complexes and their properties.
  • Knowledge of Loop Quantum Gravity concepts and terminology.
  • Basic understanding of the Euler characteristic in topology.
NEXT STEPS
  • Review the thesis "Semi-Classical Holomorphic Transition Amplitudes in Covariant Loop Quantum Gravity" for further insights.
  • Study the binomial coefficient properties and their applications in combinatorial geometry.
  • Examine Nakahara's "Geometry, Topology and Physics" for a deeper understanding of simplicial structures.
  • Research the implications of the Euler characteristic in various mathematical contexts.
USEFUL FOR

Researchers, mathematicians, and physicists interested in Loop Quantum Gravity, combinatorial topology, and the accuracy of mathematical theses.

julian
Science Advisor
Gold Member
Messages
860
Reaction score
365
I've been reading this interesting thesis recently posted. But I think I spotted a mistake. On page 52 of "Semi-Classical Holomorphic Transition Amplitudes in Covariant Loop Quantum Gravity":

https://arxiv.org/pdf/2001.04651.pdf

It says "In general, removing ##k## vertices from ##[v_0, v_1, . . . , v_p]## leaves us with a ##p − k##-simplex contained in the original ##p-##simplex. As there are ##\binom{p+1}{k+1}## possibilities to remove ##k## elements from a list of length ##p + 1## we just proved..."

This is a mistake, it should say there are ##\binom{p+1}{k}## possibilities!

Or if you like there are ##\binom{p+1}{p-k+1}## possibilities.

If you put ##n=p-k## you get the same result as stated on page 67 of Nakahara, "Geometry, Topology and Physics" which says (adjusting for notation) that the number of ##n-##faces in a ##p-##simplex is ##\binom{p+1}{n+1}##.

Yep?
 
Last edited:
  • Like
Likes   Reactions: atyy
Physics news on Phys.org
Thanks for the like @atyy.

I think maybe the author needs to change Lemma 3.2.1 in https://arxiv.org/pdf/2001.04651.pdf to:

"The number of ##n-##simplices (where ##n=p-k##) contained in a ##p-##simplex, which we denote as ##N^p_n##, is given by

$$
N^p_n = \binom{p+1}{n+1} \quad \text{for } 0 \leq n \leq p .
$$"

because then the formula that he uses for the Euler characteristic in Eq (3.28), namely ##\chi (\sigma^{(d)}) = \sum_{n=0}^d (-1)^n N^d_n##, would be correct (i.e. in accordance with page 86 of Nakahara).Eq (3.28) appears to be the only place Lemma 3.2.1 is applied, and so the mistake he made has no impact on any of the results of the thesis.

It appears to be a very nicely written thesis.
 
Maybe you could email the author? And report back to us what he says :smile:
 
atyy said:
Maybe you could email the author? And report back to us what he says :smile:

I did email him, but didn't receive a response - but I then I realized that is not his current email address...

I actually know somebody who knows him, I might email them at some point.
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 29 ·
Replies
29
Views
4K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 100 ·
4
Replies
100
Views
12K
  • · Replies 33 ·
2
Replies
33
Views
4K
  • · Replies 2 ·
Replies
2
Views
686
  • · Replies 51 ·
2
Replies
51
Views
10K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 45 ·
2
Replies
45
Views
6K