Problems with proofs of Robert Geroch mathematical physics

AI Thread Summary
The discussion centers on issues with Robert Geroch's definition and proofs related to monomorphisms in his book on Mathematical Physics. The user expresses confusion over Geroch's use of specific cases for the object X in proving monomorphisms, questioning whether this approach adheres to the definition that requires the condition to hold for any object X. They argue that using a particular case does not lead to a loss of generality, as the properties of elements a and a' in A are independent of the choice of X. The analogy drawn compares this reasoning to determining coefficients in a partial fractions decomposition, suggesting that the validity of the proof remains intact regardless of the specific values used. The conversation highlights the need for clarity in mathematical proofs and definitions.
impblack
Messages
1
Reaction score
0
Hello guys, I'm new in this forum, this is my first Thread.

I've started reading Robert Geroch's Mathematical Physics recently and I've been having problems with some of the proofs that involve monomorphism.

He defines monomorphism the following way (pg 4):
let ψ be a morphism between A and B. For any object X, let α and α' be morphism form X to A such that ψoα=ψoα', then, if ψ is a monomorphism, α=α'.

But then in some proofs later on, when he wants to demonstrate that some mappings are monomorphism he uses specific cases for X, the simplest cases he can find. But i was thinking that it would only be a valid proof if the definition of monomorphims was: There is at least one object X and not For any object X.

A proof for example (pg 5):
https://imagizer.imageshack.us/v2/706x397q90/538/S51cvZ.jpg

Where he uses a specific X (a set with only one member). Is there no loss of generality?
 
Last edited by a moderator:
Physics news on Phys.org
I believe there is no loss of generality. There are three sets, X, A and B. We are given A and B, and that phi is a monomorphism from A to B.
X is introduced as a tool to show a = a'. If it is true for X, it is true for any other X, because a and a' are elements of A, not X. Whether a = a'
or not is already fixed by A B and phi. The simplest analog I can think of to this kind of reasoning is finding the coefficients in a partial fractions
decomposition: you can use any values of x you want to get a system of equations for the coefficients, but once you get those coefficients, it
doesn't matter what values you used. I hope that helps.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. Someone who shows interest in science is initially a welcome development. So are fresh ideas from unexpected quarters. In contrast, there is a scientific community that is meticulously organized down to the last detail, allowing little to no external influence. With the invention of social media and other sites on the internet competing for content, unprecedented opportunities have opened up for...
I am going through this course on collision detection: https://siggraphcontact.github.io/ In this link is a PDF called course notes. Scrolling down to section 1.3, called constraints. In this section it is said that we can write bilateral constraints as ##\phi(\mathbf{x}) = 0## and unilateral constraints as ##\phi(\mathbf{x}) \ge 0##. I understand that, but then it says that these constraints call also be written as: $$\mathbf{J} \mathbf{u} = 0, \mathbf{J} \mathbf{u} \ge 0,$$ where...
Back
Top