{
  "schema_version": 1,
  "kind": "ConceptView",
  "producer": "concept-view-1",
  "concept_id": "urn:uuid:a548ce48-3340-4d0d-a18e-ca75f604678e",
  "labels": {
    "zh-CN": "循环",
    "en": "cycle"
  },
  "alternative_labels": [],
  "scope_note": "",
  "identity_status": "active",
  "identity_revision": "2cd2f44e8319443af0c54db7adef6e6ab4a01d6b59921be834e000a5e0c68a35",
  "occurrences": [
    {
      "concept_id": "urn:uuid:a548ce48-3340-4d0d-a18e-ca75f604678e",
      "book_id": "szekeres",
      "edition_id": "source-snapshot-bc3404156f6e",
      "lang": "zh-CN",
      "route": "zh/chapter-02/02-transformation-and-permutation-groups",
      "anchor": "concept-2-cycle",
      "chapter": "2",
      "section": "2.2",
      "offset": 4524,
      "range": [
        9206,
        9420
      ],
      "source_revision": "799abb1b61f01e9b2d7152841faf2f190564a4f0ab51672f131c33ec84fc0875",
      "source_category": "translation",
      "review_status": "unreviewed",
      "role": "occurrence",
      "role_basis": {
        "kind": "explicit-source-uuid-marker"
      },
      "label": "循环(cycle)",
      "context": {
        "range": [
          9051,
          9649
        ],
        "quote": "一种更简洁的排列符号是循环符号。从任意一个要被置换的元素开始，例如 $a_1$。让 $a_2$ 成为对 $a_1$ 应用 $\\pi$ 变化的结果，让 $a_3$ 成为对 $a_2$ 应用 $\\pi$ 变化的结果，等等。最终，第一个元素 $a_1$ 必须再次出现，比如 $a_{m+1}=a_1$。这就定义了一个<u id=\"concept-2-cycle\" class=\"concept-term\" data-concept-identity=\"urn:uuid:a548ce48-3340-4d0d-a18e-ca75f604678e\" data-concept-route=\"/concept-identities#concept-a548ce48-3340-4d0d-a18e-ca75f604678e\">循环(cycle)</u>，写成 $\\left(a_1 a_2\\ldots a_m\\right)$。如果 $m=n$，那么 $\\pi$ 就被称为循环排列。如果 $m<n$ 那么取任何一个没有出现在由 $a_1$ 产生的循环中的元素 $b_1$，并在 $\\pi$ 下创建一个由 $b_1$ 的连续图像组成的新循环 $\\left(b_1 b_2\\ldots b_m\\right)$。继续下去，直到耗尽所有元素 $1, 2,\\dots, n$。置换 $\\pi$可以写成其循环的 的乘积；例如",
        "quote_sha256": "fd5731d8e3f35dee8c02d32aec072938eb3a8d1fd62dbbd16ceb07c6200b1631",
        "environment": null,
        "excerpt_omitted": false
      },
      "parallel_readings": [
        {
          "route": "en/chapter-02/02-transformation-and-permutation-groups",
          "lang": "en",
          "source_category": "original_transcription",
          "basis": "registered-book-edition-section-language-context; not-concept-equivalence"
        }
      ],
      "id": "occ-c1c06aa5661ec17f964925f6"
    },
    {
      "concept_id": "urn:uuid:a548ce48-3340-4d0d-a18e-ca75f604678e",
      "book_id": "szekeres",
      "edition_id": "source-snapshot-bc3404156f6e",
      "lang": "zh-CN",
      "route": "zh/chapter-17/04-homology-and-cohomology",
      "anchor": "exercise-17-4-1",
      "chapter": "17",
      "section": "17.4",
      "offset": 7625,
      "range": [
        11922,
        12115
      ],
      "source_revision": "962da89618680522177106de9b1899c86eb3dedc9484f12c33659d432388a117",
      "source_category": "translation",
      "review_status": "unreviewed",
      "role": "occurrence",
      "role_basis": {
        "kind": "explicit-source-uuid-marker"
      },
      "label": "循环(cycle)",
      "context": {
        "range": [
          11688,
          12258
        ],
        "quote": "一个$p$-链$C$若没有<u class=\"concept-term\" data-concept-identity=\"urn:uuid:d89858ae-0ae4-44a6-b482-787218d5e179\" data-concept-route=\"/concept-identities#concept-d89858ae-0ae4-44a6-b482-787218d5e179\">边界(boundary)</u>，即$\\partial C = 0 .$，则称其为<u class=\"concept-term\" data-concept-identity=\"urn:uuid:a548ce48-3340-4d0d-a18e-ca75f604678e\" data-concept-route=\"/concept-identities#concept-a548ce48-3340-4d0d-a18e-ca75f604678e\">循环(cycle)</u>。若存在一个$(p+1)$-链$C^{\\prime}$使得$C = \\partial C ^ { \\prime }$，则称其为边界。显然，每个边界都是$p$-循环，因为$\\partial C = \\partial ^ { 2 } C ^ { \\prime } = 0$，但反之未必成立。",
        "quote_sha256": "87ab1013623f7b1d866eec5fd7e2263c4feb3674f6500fd026699ca6e6470ef7",
        "environment": null,
        "excerpt_omitted": false
      },
      "parallel_readings": [
        {
          "route": "en/chapter-17/04-homology-and-cohomology",
          "lang": "en",
          "source_category": "original_transcription",
          "basis": "registered-book-edition-section-language-context; not-concept-equivalence"
        }
      ],
      "id": "occ-40ff56a73f5de38da30764ac"
    },
    {
      "concept_id": "urn:uuid:a548ce48-3340-4d0d-a18e-ca75f604678e",
      "book_id": "szekeres",
      "edition_id": "source-snapshot-bc3404156f6e",
      "lang": "en",
      "route": "en/chapter-17/04-homology-and-cohomology",
      "anchor": "first-20322b3f8009b543e4b2-en",
      "chapter": "17",
      "section": "17.4",
      "offset": 9172,
      "range": [
        12996,
        13220
      ],
      "source_revision": "bcdaffd9c93fa5d4dbb16ac427fef782512ff58c5d5472ea282c7769a2173a3d",
      "source_category": "original_transcription",
      "review_status": "unreviewed",
      "role": "occurrence",
      "role_basis": {
        "kind": "explicit-source-uuid-marker"
      },
      "label": "cycle",
      "context": {
        "range": [
          12964,
          13730
        ],
        "quote": "A $p$-chain $C$ is said to be a <u class=\"concept-term\" data-concept-identity=\"urn:uuid:a548ce48-3340-4d0d-a18e-ca75f604678e\" data-concept-route=\"/concept-identities#concept-a548ce48-3340-4d0d-a18e-ca75f604678e\" id=\"first-20322b3f8009b543e4b2-en\">cycle</u> if it has no <u class=\"concept-term\" data-concept-identity=\"urn:uuid:d89858ae-0ae4-44a6-b482-787218d5e179\" data-concept-route=\"/concept-identities#concept-d89858ae-0ae4-44a6-b482-787218d5e179\" id=\"first-ccd810e4a97cf523defc-en\">boundary</u>, $\\partial C = 0 .$ . It is said to be a boundary if there exists a $(p+1)$-chain $C^{\\prime}$ such that $C = \\partial C ^ { \\prime }$ . Clearly every boundary is a $p$-cycle since $\\partial C = \\partial ^ { 2 } C ^ { \\prime } = 0$ , but the converse need not be true.",
        "quote_sha256": "c4d921ec9c18b90d439dd1bfbace10c116e4b33dd2c52e2985526ab0ff0c0fbb",
        "environment": null,
        "excerpt_omitted": false
      },
      "parallel_readings": [
        {
          "route": "zh/chapter-17/04-homology-and-cohomology",
          "lang": "zh-CN",
          "source_category": "translation",
          "basis": "registered-book-edition-section-language-context; not-concept-equivalence"
        }
      ],
      "id": "occ-f8781a28782bb76b79660b1e"
    }
  ],
  "registered_positions": [
    {
      "route": "zh/chapter-02/02-transformation-and-permutation-groups",
      "lang": "zh-CN",
      "section": "2.2",
      "signal": "term-mark",
      "label": "循环",
      "english": "cycle",
      "offset": 3900
    },
    {
      "route": "en/chapter-17/04-homology-and-cohomology",
      "lang": "en",
      "section": "17.4",
      "signal": "term-mark",
      "label": "cycle",
      "english": "cycle",
      "offset": 8217
    },
    {
      "route": "zh/chapter-17/04-homology-and-cohomology",
      "lang": "zh-CN",
      "section": "17.4",
      "signal": "term-mark",
      "label": "循环",
      "english": "cycle",
      "offset": 6549
    }
  ],
  "statements": [],
  "resolved_references": [],
  "reading_order": [
    "occ-c1c06aa5661ec17f964925f6",
    "occ-40ff56a73f5de38da30764ac",
    "occ-f8781a28782bb76b79660b1e"
  ],
  "recorded_dependencies": [],
  "reading_paths": [],
  "coverage": {
    "registered_positions": 3,
    "located_occurrences": 3,
    "whole_book_search_complete": false,
    "registered_positions_truncated": false,
    "independent_human_review_implied": false
  },
  "unresolved": [],
  "base_revision": "14fc3d07069123c241ed4ef5a4a8bff4e7f2eb140c121304669058dee63c8647",
  "optional_enrichments": []
}
