Giter Club home page Giter Club logo

Comments (7)

mikeshulman avatar mikeshulman commented on August 28, 2024

Because, unlike the first one, it doesn't involve an untruncated type in its definition.

from book.

mikeshulman avatar mikeshulman commented on August 28, 2024

I've removed these sentences; they were clearly confusing and didn't really convey any important information.

from book.

DanGrayson avatar DanGrayson commented on August 28, 2024

Do you mean, if S were a set, then the definition of "code" would not
involve an untruncated type? (I'm thinking of the sentences "it turns out
to be unnecessary for our proof to assume that the “set of base-points” is
a set — it might just as well be an arbitrary type" and "If S ≡ A and k is
the identity function, then we will recover the naive van Kampen theorem")

Do you also mean, that if S were a set, then where we define "code(ib, ib′
) is now a set-quotient of the type of sequences..,", we could define it as
an inductive type and it would turn out to be a set? Such a remark might
be important in justifying the examples involving colimits of fundamental
groups.

On Wed, Mar 27, 2013 at 8:10 PM, Mike Shulman [email protected]:

Because, unlike the first one, it doesn't involve an untruncated type in
its definition.


Reply to this email directly or view it on GitHubhttps://github.com//issues/43#issuecomment-15561222
.

from book.

mikeshulman avatar mikeshulman commented on August 28, 2024

Yes and no, respectively. The sentences that I just removed were
written before we realized that the improved version works just as
well even if S is not a set --- although it's not clear to me at the
moment whether it has applications when S is neither a set nor A
itself.

What is it that you think needs more "justification"?

On Wed, Mar 27, 2013 at 9:00 PM, Daniel R. Grayson
[email protected] wrote:

Do you mean, if S were a set, then the definition of "code" would not
involve an untruncated type? (I'm thinking of the sentences "it turns out
to be unnecessary for our proof to assume that the “set of base-points” is
a set — it might just as well be an arbitrary type" and "If S ≡ A and k is
the identity function, then we will recover the naive van Kampen theorem")

Do you also mean, that if S were a set, then where we define "code(ib, ib′
) is now a set-quotient of the type of sequences..,", we could define it as
an inductive type and it would turn out to be a set? Such a remark might
be important in justifying the examples involving colimits of fundamental
groups.

On Wed, Mar 27, 2013 at 8:10 PM, Mike Shulman [email protected]:

Because, unlike the first one, it doesn't involve an untruncated type in
its definition.


Reply to this email directly or view it on GitHubhttps://github.com//issues/43#issuecomment-15561222
.


Reply to this email directly or view it on GitHub.

from book.

DanGrayson avatar DanGrayson commented on August 28, 2024

Okay. Your latest version is clearer.

On further thought, I'm no longer worried about justifying those examples applying the theorem.

But now I'm wondering about this sentence: "Indeed, the conclusion of Theorem 7.5.4 says nothing at all about π_1(A); the paths in A are “built into the quotienting” in a type-theoretic way that makes it hard to extract explicit information." For some reason I find it hard to understand. I wonder if a more prosaic and satisfactory explanation for the advantage of reformulating van Kampen is that fundamental groups refer to base points, but the naive van Kampen theorem doesn't.

from book.

mikeshulman avatar mikeshulman commented on August 28, 2024

Is that going to be convincing if you are not a hardened classical
algebraic topologist who already cares about basepoints?

On Wed, Mar 27, 2013 at 9:40 PM, Daniel R. Grayson <[email protected]

wrote:

Okay. Your latest version is clearer.

On further thought, I'm no longer worried about justifying those examples
applying the theorem.

But now I'm wondering about this sentence: "Indeed, the conclusion of
Theorem 7.5.4 says nothing at all about π_1(A); the paths in A are “built
into the quotienting” in a type-theoretic way that makes it hard to extract
explicit information." For some reason I find it hard to understand. I
wonder if a more prosaic and satisfactory explanation for the advantage of
reformulating van Kampen is that fundamental groups refer to base points,
but the naive van Kampen theorem doesn't.


Reply to this email directly or view it on GitHubhttps://github.com//issues/43#issuecomment-15563802
.

from book.

DanGrayson avatar DanGrayson commented on August 28, 2024

Sure. The only way to get a group out of a groupoid is to pick a base
point. And everyone should be interested in groups already.

On Wed, Mar 27, 2013 at 10:16 PM, Mike Shulman [email protected]:

Is that going to be convincing if you are not a hardened classical
algebraic topologist who already cares about basepoints?

On Wed, Mar 27, 2013 at 9:40 PM, Daniel R. Grayson <
[email protected]

wrote:

Okay. Your latest version is clearer.

On further thought, I'm no longer worried about justifying those
examples
applying the theorem.

But now I'm wondering about this sentence: "Indeed, the conclusion of
Theorem 7.5.4 says nothing at all about π_1(A); the paths in A are
“built
into the quotienting” in a type-theoretic way that makes it hard to
extract
explicit information." For some reason I find it hard to understand. I
wonder if a more prosaic and satisfactory explanation for the advantage
of
reformulating van Kampen is that fundamental groups refer to base
points,
but the naive van Kampen theorem doesn't.


Reply to this email directly or view it on GitHub<
https://github.com/HoTT/book/issues/43#issuecomment-15563802>
.


Reply to this email directly or view it on GitHubhttps://github.com//issues/43#issuecomment-15564687
.

from book.

Related Issues (20)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.