How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Vertex and edge stabilizers determine the quotient incidences
Statement
Let a group act without inversions on an oriented graph , and let be an oriented edge with origin and terminus . Then the edge stabilizer
is a subgroup of both vertex stabilizers and . Moreover, replacing by another representative of the same quotient edge conjugates all three stabilizers by the same element of , so the inclusions
are the representative-independent incidence maps attached to the quotient edge.
Facts & Assumptions
Given: An action without inversions on an oriented graph and an oriented edge from to .
The quotient graph records vertex and edge orbits, with origin and terminus descending from representatives. (The quotient graph of an action without inversions)
A subgroup is a subset closed under products and inverses. (Subgroup)
Proof
If , then , so applying origin and terminus to this equality gives and . Thus . Since each stabilizer is an intersection of solution sets to , it is closed under products and inverses, hence is a subgroup by [L2].
If , then and similarly and . Therefore passing to another representative of the quotient edge conjugates the two inclusion maps by the same , so the quotient incidence data from [L1] is well defined up to that canonical conjugacy.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
8 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Jean-Pierre Serre, Trees (standard reference, not scraped)
- Yuriy Tumarkin, Groups Acting on Trees (standard reference, not scraped)