The Einstein constraint equations and the conformal method
Bibliographic record
Abstract
This thesis constitutes an exposition of much of what is currently known about the conformal method of parameterizing solutions to the Einstein constraint equations. First, the relevant background information is presented, including the Einstein field equations. Then the problem of coming up with a well-posed initial value problem is discussed, including the relevant theorems of Y. Choquet-Bruhat, leading into a discussion and derivation of the Einstein constraint equations.Next, the conformal method for parameterizing solutions to the constraint equations is motivated and discussed, concluding the first part of the thesis. After this the Yamabe problem is discussed and the relevant results about the Yamabe invariant proven, which plays a very important role in the solving of the conformal constraint equations.The next part of this thesis will focus on the solving of the conformal constraint equations, and the main influence is Maxwell’s work ([9]). We begin with the Lichnerowicz equation and move onto solving the coupled system by using techniquesincluding the method of global supersolutions ([9]) and the limit equation ([2], [10]). Nonexistence results are also discussed, mainly towards the end, as well as some minor new results.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.012 | 0.002 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".