ScalingStacks

Proof (0LM9)

Source history

David Gepner, Joachim Kock

Original source: arXiv:1208.1749v5

Detailed backend records are private. Public author/source status appears above.

The permanent identity and original source provenance are retained below.

{
  "key": "work:W000031:pdf:029c81cbf8b0874dcc86e04888d2586964eb82acd74ea6038c1ed5bc751fbcb8:page:35:bbox:71.999,249.208,539.97,262.771",
  "first_source_version": "1208.1749v5",
  "chapter": "work-w000031",
  "work": "W000031",
  "kind": "Proof",
  "number": "",
  "title": "Proof. Since M is combinatorial, C is presentable.40 Let f : T →S be an arrow of C, which (replacing f by",
  "source_version": "1208.1749v5",
  "source": {
    "pdf_sha256": "029c81cbf8b0874dcc86e04888d2586964eb82acd74ea6038c1ed5bc751fbcb8",
    "page": 35,
    "bbox": [
      71.999,
      249.208,
      539.97,
      262.771
    ]
  },
  "target": "/chapters/work-w000031.html",
  "identity_basis": "pinned original PDF hash and exact page/bbox; never display number",
  "status": "active"
}

Original mathematics by the credited authors. Source collection and HTML conversion remain in progress.