Milestone map
Milestone map
2 milestones
Do the problem sets and write them up
4–8 weeks (8–10 hrs/week)
Take Introduction to Abstract Group Theory for free and do the problems from every week (subgroups, homomorphisms, cosets, quotient groups, symmetric groups, Sylow theorems), written up in LaTeX. Write every solution up in LaTeX and keep the source and the PDF in one public repo as you go. Lectures are free. NPTEL's proctored exam and certificate are optional and cost money; you never need them here.
Proof required
Link your public repo with the LaTeX source and the PDF of the problems from every week (subgroups, homomorphisms, cosets, quotient groups, symmetric groups, Sylow theorems), written up in LaTeX, and show your self-check (The course's worked problem sessions).
What gets checked
- Every proof is complete and correct.
- Your attempts come before the worked sessions (commit history).
- Group tables and permutation working are checked.
Common mistakes
- Copying posted solutions: verifiers read the reasoning and the history.
- A proof that skips the hard step.
- Asking for review before the self-check.
Powstik Guide
A public repo with your LaTeX write-ups of the problems from every week (subgroups, homomorphisms, cosets, quotient groups, symmetric groups, Sylow theorems), written up in LaTeX.
Steps
- Make a public repo for this course.
- Do one problem set at a time; typeset it in LaTeX and commit.
- Self-check: Each week has "Problems" lectures. Try each problem before you watch it worked, then compare.
- Fix what the self-check shows, and say what you fixed.
- Ask three people who know the topic to check it.
Template
README Course: Introduction to Abstract Group Theory (NPTEL (IIT Madras)) What is here (problem sets, PDF): Self-check result: The hardest proof and why:
What gets sent back
- Answers with no reasoning.
- Photos of handwriting instead of typeset work.
- Self-check not shown.
Resources
Foundationstart here
Depthgo deeper
What a verifier looks for
- Every proof is complete and correct.
- Your attempts come before the worked sessions (commit history).
- Group tables and permutation working are checked.
- Pick two proofs and check every step: each argument must be correct and complete, not just present.
- Ask about one step; the answer should be clear.
You'll sign in first, then come straight back here.
Classify small groups
1–3 weeks (5–8 hrs/week)
Use what you learned. Make a proof set that finds every group of order up to 8 (up to isomorphism), with a proof that the list is complete. Typeset it in LaTeX (or a notebook with LaTeX maths) in your public repo.
Proof required
Link a proof set that finds every group of order up to 8 (up to isomorphism), with a proof that the list is complete, in your public repo.
What gets checked
- Every group on the list is really a group, with its table or rule.
- No two on the list are isomorphic (proved).
- The proof that nothing is missing is complete.
Common mistakes
- A gap in the main argument.
- A result stated but not proved.
Powstik Guide
A proof set that finds every group of order up to 8 (up to isomorphism), with a proof that the list is complete.
Steps
- Write one line: what you will prove or show.
- Draft it, then read it cold the next day.
- Ask someone to read it and mark the first step they doubt.
- Fix it and typeset the final version.
- Ask three people to check it.
Template
Title: What this shows: Main result (statement): Proof: What I would look at next:
What gets sent back
- A main step left unproved.
- Not clearly the person's own work.
- Claims more than it proves.
Resources
Foundationstart here
Depthgo deeper
What a verifier looks for
- Every group on the list is really a group, with its table or rule.
- No two on the list are isomorphic (proved).
- The proof that nothing is missing is complete.
- Every argument must be correct and complete; mark the first gap you find.
- Check that the work is the person's own.
You'll sign in first, then come straight back here.